Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem

European Journal of Operational Research

Volumn 193, Issue 3, 2009, Pages 885-890

  Jaszkiewicz, Andrzej ^a   Zielniewicz, Piotr ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Metaheuristics; Multiobjective optimization; Traveling salesperson problem

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; EVOLUTIONARY ALGORITHMS; PARETO PRINCIPLE; SOLUTIONS; TABU SEARCH;

DECISION SPACES; LIN-KERNIGHAN ALGORITHM; LOCAL SEARCH; MEMETIC ALGORITHM; METAHEURISTICS; MULTIOBJECTIVE OPTIMIZATION; MULTIPLE OBJECTIVES; NEW SOLUTIONS; PARETO-OPTIMAL SOLUTIONS; PATH RELINKING; SHORT RUNS; STATE-OF-THE-ART ALGORITHMS; TRAVELING SALESPERSON PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 53449102767     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.10.054     Document Type: Article

References (17)

1. M. Basseur, F. Seynhaeve, E.-G. Talbi, Path relinking in Pareto multiobjective optimization algorithms, in: C.A. Coello Coello (Ed.), Int. Conf. on Evolutionary Multicriterion Optimization, Lectures Notes in Computer Science, LNCS No. 3410, Guanajuato, Mexico, March 2005, pp. 120-130.
2. Coello Coello C.A., Van Veldhuizen D.A., and Lamont G.B. Evolutionary Algorithms for Solving Multi-Objective Problems (2002), Kluwer Academic Publishers
3. Deb K. Multi-Objective Optimisation Using Evolutionary Algorithms (2001), John Wiley & Sons
4. B. Freisleben, P. Merz, A genetic local search algorithm for travelling salesman problem, in: H.-M. Voigt, W. Ebeling, I. Rechenberg, H.-P. Schwefel (Eds.), Proceedings of the 4th Conference on Parallel Problem Solving Fram Nature- PPSN IV, 1996, pp. 890-900.
5. Glover F., and Laguna M. Fundamentals of scatter search and path relinking. Control and Cybernetics 29 (1999) 653-684
6. Jaszkiewicz A. Improving performance of genetic local search by changing local search space topology. Foundations of Computing and Decision Sciences 24 2 (1999) 77-84
7. A. Jaszkiewicz, Multiple objective metaheuristic algorithms for combinatorial optimization. Habilitation thesis, 360, Poznan University of Technology, Poznan, 2001, .
8. Jaszkiewicz A. Genetic local search for multiple objective combinatorial optimization. European Journal of Operational Research 137 1 (2002) 50-71
9. Jaszkiewicz A. A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Annals of Operations Research 131 1-4 (2004) 135-158
10. A. Jaszkiewicz, Evaluation of multiple objective metaheuristics, in: X. Gandibleux, M. Sevaux, K. Sörensen, V. T'kindt (Eds.), Metaheuristics for Multiobjective Optimisation, Lecture Notes in Economics and Mathematical Systems, 2004, pp. 65-89.
11. Paquete L., Chiarandini M., and Stützle T. Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In: Gandibleux X., Sevaux M., Sörensen K., and T'kindt V. (Eds). Multiobjective Metaheuristics. Lecture Notes in Economics and Mathematical Systems vol. 535 (2004), Springer-Verlag
12. Paquete L., and Stützle T. A two-phase local search for the biobjective traveling salesman problem. In: Fonseca C.M., Fleming P., Zitzler E., Deb K., and Thiele L. (Eds). Proceedings of the Evolutionary Multi-criterion Optimization (EMO 2003). Lecture Notes in Computer Science vol. 2632 (2003), Springer-Verlag 479-493
13. Reinelt G. TSPLIB - a traveling salesman problem library. ORSA Journal of Computing 3 4 (1991) 376-384
14. Steuer R.E. Multiple Criteria Optimization - Theory, Computation and Application (1986), Wiley, New York
15. Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto evolutionary algorithm. IEEE Transactions on Evolutionary Computation 3 4 (1999) 257-271
16. Zitzler E., Thiele L., Laumanns M., Fonseca C.M., and Grunert da Fonseca V. Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7 2 (2003) 117-132
17. .