The multiobjective traveling salesman problem: A survey and a new approach

Studies in Computational Intelligence

Volumn 272, Issue , 2010, Pages 119-141

  Lust, Thibaut ^a   Teghem, Jacques ^a  

^a FACULTÉ POLYTECHNIQUE DE MONS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 73849140099     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-11218-8_6     Document Type: Article

References (61)

1. Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Management Science 25, 73-78 (1979)
2. Angel, E., Bampis, E., Gourves, L.: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem. Theoretical Computer Science 310, 135-146 (2004)
3. Angel, E., Bampis, E., Gourves, L.: A dynasearch neighborhood for the bicriteria traveling salesman problem. In: Gandibleux, X., Sevaux, M., Sörensen, K., T'kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. LNEMS, vol.535, pp. 153-176. Springer, Berlin (2004)
4. Applegate, D.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15, 82-92 (2003)
5. Basseur, M.: Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 4OR 4(3), 255-258 (2006)
6. Borges, P.C., Hansen, M.P.: A study of global convexity for a multiple objective travelling salesman problem. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys in metaheuristics, pp. 129-150. Kluwer, Dordrecht (2000)
7. Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7, 34-47 (1998)
8. Ehrgott, M., Gandibleux, X.: Multiobjective Combinatorial Optimization-Theory, Methodology, and Applications. In: Ehrgott, M., Gandibleux, X. (eds.) Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, pp. 369-444. Kluwer Academic Publishers, Boston (2002)
9. Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Computers and Operations Research 34, 2674-2694 (2007)
10. Elaoud, S., Teghem, J., Loukil, T.: Multiple crossover genetic algorithm for the multiobjective traveling salesman problem: University of Sfax (tunisia) (2008) (Submitted for publication)
11. Ferguson, T.S.: Mathematical Statistics, a decision theoretic approach. Academic Press, London (1967)
12. Fisher, R., Richter, K.: Solving a multiobjective traveling salesman problem by dynamic programming. Mathematische Operationsforschung und Statistik, Series Optimization 13(2), 247-252 (1982)
13. Gandibleux, X., Morita, H., Katoh, N.: The supported solutions used as a genetic information in a population heuristics. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol.1993, pp. 429-442. Springer, Heidelberg (2001)
14. Garcia-Martinez, C., Cordon, O., Herrera, F.: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. European Journal of Operational Research 180(1), 116-148 (2007)
15. Gendreau, M., Bérueb́, J.-F., Potvin, J.-Y.: An exact epsilon-constraint method for biobjective combinatorial optimization problems: Application to the traveling salesman problem with profits. European Journal of Operational Research 194(1), 39-50 (2009)
16. Glover, F., Kochenberger, G.: Handbook of Metaheuristics. Kluwer, Boston (2003)
17. Gupta, A., Warburton, A.: Approximation methods for multiple criteria traveling salesman problems, towards interactive and intelligent decision support systems. In: Sawaragi, Y. (ed.) Proc. 7th Internat. Conf. onMultiple Criteria DecisionMaking, Berlin, pp. 211-217. Springer, Heidelberg (1986)
18. Gutin, G., Punnen, A.: The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)
19. Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objectives. Annals of Operations Research 52, 209-230 (1994)
20. Hansen, M.P.: Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP. Journal of Heuristics 6(3), 419-430 (2000)
21. Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations of the nondominated set. Technical report, Technical University of Denmark, Lingby, Denmark (1998)
22. Hansen, P.: Bicriterion path problems. LNEMS, vol.177, pp. 109-127 (1979)
23. Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. European Journal of Operational Research 126, 106-130 (2000)
24. Holm, S.: A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6, 65-70 (1979)
25. Huang, B., Yao, L., Raguraman, K.: Bi-level GA and GIS for multi-objective TSP route planning. Transportation Planning and Technology 29(2), 105-124 (2006)
26. 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), 402-412 (2002)
27. Jaszkiewicz, A., Zielniewicz, P.: Pareto memetic algorithm with path-relinking for biobjective traveling salesman problem. European Journal of Operational Research 193(3), 885-890 (2009)
28. Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215-310. John Wiley and Sons Ltd., Chichester (1997)
29. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the ATSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)
30. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)
31. Jozefowiez, N., Glover, F., Laguna, M.: Multi-objective meta-heuristics for the traveling salesman problem with profits. Journal of Mathematical Modelling and Algorithms 7(2), 177-195 (2008)
32. Jozefowiez, N., Semet, F., Talbi, E.-G.: Multi-objective vehicle routing problems. European Journal of European Research 189(2), 293-309 (2008)
33. Keller, C.P., Goodchild, M.: The multiobjective vending problem: A generalization of the traveling salesman problem. Environment and Planning B: Planning and Design 15, 447-460 (1988)
34. Kumar, R., Singh, P.K.: Pareto evolutionary algorithm hybridized with local search for biobjective TSP. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Algorithms, ch. 14. Springer, Heidelberg (2007)
35. Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review 13(2), 129-170 (1999)
36. Li,W.: Finding Pareto-optimal set by merging attractors for a bi-objective traveling salesmen problem. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol.3410, pp. 797-810. Springer, Heidelberg (2005)
37. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 498-516 (1973)
38. Lust, T., Jaszkiewicz, A.: Speed-up techniques for solving large-scale biobjective TSP. Computers & Operations Research 37(3), 521-533 (2010)
39. Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. To appear in Journal of Heuristics (2009)
40. Manthey, B., Shankar Ram, L.: Approximation algorithms for multi-criteria traveling salesman problems. CoRR (2007), arxiv:abs/cs/0606040
41. Melamed, I.I., Sigal, K.I.: The linear convolution of criteria in the bicriteria traveling salesman problem. Computational Mathematics and Mathematical Physics 37(8), 902-905 (1997)
42. Merz, P., Freisleben, B.: Memetic algorithms for the traveling salesman problem. Complex Systems 13, 297-345 (2001)
43. Miettinen, K.: Nonlinear multiobjective optimization. Kluwer, Boston (1999)
44. Paquete, L.: Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: Methods and Analysis. PhD thesis, FB Informatik, TU Darmstadt (2005)
45. Paquete, L., Chiarandini, M., Stützle, T.: Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. In: Gandibleux, X., Sevaux, M., Sörensen, K., T'kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation, Berlin. LNEMS, vol.535, pp. 177-199. Springer, Heidelberg (2004)
46. Paquete, L., 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., Thiele, L. (eds.) EMO 2003. LNCS, vol.2632, pp. 479-493. Springer, Heidelberg (2003)
47. Paquete, L., Stützle, T.: Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Computers and Operations Research 36(9), 2619-2631 (2009)
48. Przybylski, A., Gandibleux, X., Ehrgott, M.: Two-phase algorithms for the biobjective assignement problem. European Journal of Operational Research 185(2), 509-533 (2008)
49. Reinelt, G.: Tsplib-a traveling salesman problem library. ORSA Journal of Computing 3(4), 376-384 (1991)
50. Samanlioglu, F., Ferrell Jr., W.G., Kurz, M.E.: A multicriteria Pareto-optimal algorithm for the traveling salesman problem. Asia-Pacific Journal of Operational Research 11, 103-115 (1994)
51. Samanlioglu, F., Ferrell Jr., W.G., Kurz, M.E.: A memetic random-key genetic algorithm for a symmetric travelling salesman problem. Computers and Industrial Engineering 55(2), 439-449 (2008)
52. Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Applications. John Wiley & Sons, New York (1986)
53. Teghem, J.: La programmation lińeaire multicrit̀ere. In: Dubois, D., Pirlot, M. (eds.) Concepts et ḿethodes pour l'aide ̀a la d́ecision, pp. 215-288. Herḿes (2006)
54. Teghem, J., Kunsch, P.: A survey of techniques for finding efficient solutions to multiobjective integer linear programming. Asia-Pacific Journal of Operational Research 3(2), 95-108 (1986)
55. Ulungu, E.L., Teghem, J.: Multiobjective combinatorial optimization problems: A survey. Journal of Multi-Criteria Decision Analysis 3, 83-104 (1994)
56. Ulungu, E.L., Teghem, J.: The two phases method: An efficient procedure to solve biobjective combinatorial optimization problems. Foundation of Computing and Decision Science 20, 149-156 (1995)
57. Ulungu, E.L., Teghem, J., Fortemps, Ph., Tuyttens, D.: Ph. Fortemps, and D. Tuyttens. MOSA Method: A Tool for Solving Multiobjective Combinatorial Optimization Problems. Journal of Multi-Criteria Decision Analysis 8(4), 221-236 (1999)
58. Yan, Z., Zhang, L., Kang, L., Lin, G.: A new MOEA for multiobjective TSP and its convergence property analysis. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.2632, pp. 342-354. Springer, Heidelberg (2003)
59. Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (November 1999)
60. Zitzler, E., Laumanns, M., Thiele, L., Fonseca, C.M., Grunert da Fonseca, V.:Why Quality Assessment of Multiobjective Optimizers Is Difficult. In: Langdon, W.B., Cant́u-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G.,Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), July 2002, pp. 666-673. Morgan Kaufmann Publishers, San Francisco (2002)
61. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance Assessment of Multiobjective Optimizers: An Analysis and Review. IEEE Transactions on Evolutionary Computation 7(2), 117-132 (2003)