Skip to main content
SpringerLink
Log in

A Two-Phase Local Search for the Biobjective Traveling Salesman Problem

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2632))

Included in the following conference series:

Abstract

This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial solution by optimizing only one single objective, and then (ii) to start from this solution a search for non-dominated solutions exploiting a sequence of different formulations of the problem based on aggregations of the objectives. This second phase is a single chain, using the local optimum obtained in the previous formulation as a starting solution to solve the next formulation. Based on this basic idea, we propose some further improvements and report computational results on several instances of the biobjective TSP that show competitive results with state-of-the-art algorithms for this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Bentley. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4(4):387–411, 1992.

    MATH  MathSciNet  Google Scholar 

  2. P. C. Borges and P. H. Hansen. A study of global convexity for a multiple objective travelling salesman problem. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 129–150. Kluwer, 2000.

    Google Scholar 

  3. P. Czyzak and A. Jaszkiewicz. Pareto simulated annealing — a metaheuristic technique for multiple objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7:34–47, 1998.

    Article  MATH  Google Scholar 

  4. V. G. da Fonseca, C. Fonseca, and A. Hall. Inferential performance assessment of stochastic optimisers and the attainment function. In E. Zitzler and et al., editors, Evolutionary Multi-Criterion Optimization (EMO’2001), LNCS 1993, pages 213–225. Springer Verlag, 2001.

    Google Scholar 

  5. M. Ehrgott. Approximation algorithms for combinatorial multicriteria problems. International Transactions in Operations Research, 7:5–31, 2000.

    Article  MathSciNet  Google Scholar 

  6. X. Gandibleux, N. Mezdaoui, and A. Freville. A tabu search procedure to solve multiobjective combinatorial optimization problems. In R. Caballero et al., editor, Advances in Multiple Objective and Goal Programming, LNEMS, pages 291–300. Springer Verlag, 1997.

    Google Scholar 

  7. M.P. Hansen. Use of subsitute scalarizing functions to guide a local search base heuristics: the case of moTSP. Journal of Heuristics, 6:419–431, 2000.

    Article  MATH  Google Scholar 

  8. M.P. Hansen and A. Jaszkiewicz. Evaluating the quality of approximations to the nondominated set. Technical Report IMM-REP-1998-7, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, 1998.

    Google Scholar 

  9. H. Ishibuchi and T. Murata. Multi-objective genetic local search algoritm. In T. Fukuda and T. Furuhashi, editors, Proceedings of the 1996 International Conference on Evolutionary Optimization, pages 119–124, Nagoya, Japan, 1996. IEEE.

    Google Scholar 

  10. A. Jaszkiewicz. Genetic local search for multiple objective combinatorial optimization. European Journal of Operational Research, 1(137):50–71, 2002.

    Article  MathSciNet  Google Scholar 

  11. D. S. Johnson and L. A. McGeoch. Experimental analysis of heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369–443. Kluwer Academic Publishers, 2002.

    Google Scholar 

  12. D.S. Johnson and L.A. McGeoch. The travelling salesman problem: A case study in local optimization. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215–310. John Wiley & Sons, Chichester, UK, 1997.

    Google Scholar 

  13. J. Knowles and D. Corne. The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation. In Proceedings of CEC’99, pages 98–105, 1999.

    Google Scholar 

  14. H. R. Lourenço, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 321–353. Kluwer Academic Publishers, Norwell, MA, 2002.

    Google Scholar 

  15. O. Martin, S.W. Otto, and E.W. Felten. Large-step markov chains for the traveling salesman problem. INFORMS Journal on Computing, 8(1):1–15, 1996.

    Article  Google Scholar 

  16. L. Paquete, M. Chiarandini, and T. Stützle. A study of local optima in the biojective travelling salesman problem. Technical Report AIDA-02-07, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2002.

    Google Scholar 

  17. L. Paquete and C. Fonseca. A study of examination timetabling with multiobjective evolutionary algorithms. In 4th Metaheuristics International Conference (MIC 2001), pages 149–154, Porto, 2001.

    Google Scholar 

  18. P. Serafini. Some considerations about computational complexity for multiobjective combinatorial problems. In Recent Advances and Historical Development of Vector Optimization, LNEMS, pages 222–231. Springer-Verlag, 1986.

    Google Scholar 

  19. P. Serafini. Simulated annealing for multiple objective optimization problems. In Multiple Criteria Decision Making, LNEMS, pages 283–292. Springer-Verlag, 1994.

    Google Scholar 

  20. K. Shaw, C. Fonseca, A. Nortcliffe, M. Thompson, J. Love, and P. Fleming. Assessing the performance of multiobjetive genetic algorithms for optimization of a batch process scheduling problem. In Proceeding of CEC’99, pages 37–45, 1999.

    Google Scholar 

  21. R.E. Steuer. Multiple Criteria Optimization: Theory, Computation and Application. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, New York, 1986.

    MATH  Google Scholar 

  22. T. Stützle and H. Hoos. Analyzing the run-time behaviour of iterated local search for the TSP. In III Metaheuristic International Conference (MIC’99), pages 1–6, 1999.

    Google Scholar 

  23. D. Tuyttens, J. Teghem, P. Fortemps, and K. Van Nieuwenhuyze. Performance of the MOSA method for the bicriteria assignment problem. Jornal of Heuristics, 6:295–310, 2000.

    Article  MATH  Google Scholar 

  24. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. on Evol. Comput., 4(3):257–271, 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Intellectics Group, Darmstadt University of Technology, Alexanderstr. 10, D-64283, Darmstadt, Germany

    Luis Paquete & Thomas Stützle

Authors
  1. Luis Paquete
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Stützle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences and Technology, Centre for Intelligent Systems, University of the Algarve, Campus de Gambelas, 8005-139, Faro, Portugal

    Carlos M. Fonseca

  2. Department of Automatic Control and Systems Engineering, University of Sheffield, Mappin Street, Sheffield, S1 3JD, UK

    Peter J. Fleming

  3. Department of Electrical Engineering, Computer Engineering and Networks Laboratory, Swiss Federal Institute of Technology, Gloriastraße 35, 8092, Zürich, Switzerland

    Eckart Zitzler  & Lothar Thiele  & 

  4. Department of Mechanical Engineering, Kanpur Genetic Algorithms Laboratory, Indian Institute of Technology, Kanpur, UP, 208 016, India

    Kalyanmoy Deb

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paquete, L., Stützle, T. (2003). A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-36970-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-01869-8

  • Online ISBN: 978-3-540-36970-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation