Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
The ant colony optimization meta-heuristic
New ideas in optimization
Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Path relinking in pareto multi-objective genetic algorithms
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Initial population construction for convergence improvement of MOEAs
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Path relinking on many-objective NK-landscapes
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Solving bi-objective flow shop problem with hybrid path relinking algorithm
Applied Soft Computing
Hi-index | 0.00 |
In this paper we present three path relinking approaches for solving a bi-objective permutation flowshop problem. The path relinking phase is initialized by optimizing the two objectives using Ant Colony System. The initiating and guiding solutions of path relinking are randomly selected and some of the solutions along the path are intensified using local search. The three approaches differ in their strategy of defining the heuristic bounds for the local search, i.e., each approach allows its solutions to undergo local search under different conditions. These conditions are based on local nadir points. Several test instances are used to investigate the performances of the different approaches. Computational results show that the decision which allows solutions to undergo local search has an influence in the performance of path relinking. We also demonstrate that path relinking generates competitive results compared to the best known solutions of the test instances.