Speed-up techniques for solving large-scale biobjective TSP

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 521-533

  Lust, T ^a   Jaszkiewicz, A ^b  

^a FACULTÉ POLYTECHNIQUE DE MONS   (Belgium)

^b POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Hybrid metaheuristics; Local search; Multiobjective combinatorial optimization; Speed up techniques; TSP

Indexed keywords

HYBRID METAHEURISTICS; LOCAL SEARCH; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; SPEED-UP TECHNIQUES; TSP;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; MULTIOBJECTIVE OPTIMIZATION; SPEED;

TRAVELING SALESMAN PROBLEM;

EID: 70349275517     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.01.005     Document Type: Article

References (27)

1. Aneja Y.P., and Nair K.P.K. Bicriteria transportation problem. Management Science 25 (1979) 73-78
2. Angel E., Bampis E., and Gourvès L. A dynasearch neighborhood for the bicriteria traveling salesman problem. In: Gandibleux X., Sevaux M., Sörensen K., and T'kindt V. (Eds). Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems vol. 535 (2004), Springer, Berlin 153-176
3. Appletgate D. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15 (2003) 82-92
4. Basseur M. Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 4OR 4 3 (2006) 255-258
5. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 4 (1992) 387-411
6. Czyzak P., and Jaszkiewicz A. Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7 (1998) 34-47
7. Deb K. Multi-objective optimization using evolutionary algorithms. Wiley-interscience series in systems and optimization (2001), Wiley, Chichester
8. Ehrgott M. Multicriteria optimization. 2nd ed. (2005), Springer, Berlin
9. Ehrgott M., and Gandibleux X. Multiple criteria optimization: state of the art annotated bibliographic surveys (2002), Kluwer Academic Publishers, Boston
10. Ehrgott M., and Gandibleux X. Bound sets for biobjective combinatorial optimization problems. Computers and Operations Research 34 (2007) 2674-2694
11. Ferguson T.S. Mathematical statistics, a decision theoretic approach (1967), Academic Press, New-York and London
12. Goldberg D.E. Genetic algorithms for search, optimization, and machine learning (1989), Addison-Wesley, Reading, MA
13. Hansen P. Bicriterion path problems. In: Lecture notes in economics and mathematical systems, vol. 177, 1979, p. 109-27.
14. Hansen P., and Mladenovic N. First vs. best improvement: an empirical study. Discrete Applied Mathematics 154 (2006) 802-817
15. Jaszkiewicz A. On the performance of multiple-objective genetic local search on the 0/1 Knapsack problem-a comparative experiment. IEEE Transactions on Evolutionary Computation 6 4 (2002) 402-412
16. Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1997), Wiley, New York 215-310
17. Lust T, Teghem J. Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics 2009; doi:10.1007/s10732-009-9103-9.
18. Lust T, Teghem J. Two-phase stochastic local search algorithms for the biobjective traveling salesman problem. Technical Report, IRIDIA, Technical Report No.TR/IRIDIA/2007-014; 2007.
19. 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). Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems vol. 535 (2004), Springer, Berlin 177-199
20. Paquete L., and Stützle T. A two-phase local search for the biobjective traveling salesman problem. In: Fonseca C.M., Fleming P.J., Zitzler E., Deb K., and Thiele L. (Eds). Evolutionary multi-criterion optimization. Second international conference, EMO 2003. Lecture notes in computer science vol. 2632 (April 2003), Springer, Faro, Portugal 479-493
21. Przybylski A., Gandibleux X., and Ehrgott M. Two-phase algorithms for the biobjective assignment problem. European Journal of Operational Research 185 2 (2008) 509-533
22. Reinelt G. Tsplib-a traveling salesman problem library. ORSA Journal of Computing 3 4 (1991) 376-384
23. Steiglitz K., and Weiner P. Some improved algorithms for computer solution of the traveling salesman problem. Proceedings 6th annual allerton conference on communication, control, and computing (1968), Department of Electrical Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana 814-821
24. Ulungu E.L., and Teghem J. The two phases method: an efficient procedure to solve biobjective combinatorial optimization problems. Foundation of Computing and Decision Science 20 (1995) 149-156
25. Ulungu E.L., Teghem J., Fortemps Ph., and Tuyttens D. MOSA method: a tool for solving multiobjective combinatorial optimization problems. Journal of Multi-Criteria Decision Analysis 8 4 (1999) 221-236
26. Zitzler E. Evolutionary algorithms for multiobjective optimization: methods and applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland; November 1999.
27. Zitzler E., Laumanns M., Thiele L., Fonseca C.M., and Grunert da Fonseca V. Why quality assessment of multiobjective optimizers is difficult. In: Langdon W.B., Cantú-Paz E., Mathias K., Roy R., Davis D., Poli R., et al. (Eds). Proceedings of the genetic and evolutionary computation conference (GECCO'2002) (July 2002), Morgan Kaufmann Publishers, San Francisco, California 666-673