Now showing items 1-2 of 2
A hybrid genetic algorithm and inver over approach for the travelling salesman problem.
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded local search scheme. Within the SBGA, a ...
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling.
(Springer Science & Business, 2011)
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student ...