Abstract
In this paper we extend the dynasearch approach proposed by Congram, Potts and van de Velde [4, 17] in the context of multicriteria optimization for the bicriteria traveling salesman problem. The idea is to use local search with an exponential sized neighborhood which can be searched in polynomial time using dynamic programming and a rounding technique. Experimental results are presented to verify the quality of the proposed approach to obtain approximate Pareto curves for the bicriteria traveling salesman problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.K. Ahuja, Ö. Ergun, J.B. Orlin, and A.P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics,123:75–102, 2002.
E. Angel and E. Bampis. A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. European Journal of Operational Research, 2002. in revision.
E. Angel and V. Zissimopoulos. On the hardness of the quadratic assignment problem with metaheuristics. Journal of Heuristics, 8(4):399–414, 2002.
R.K. Congram, C.N. Potts, and S.L. van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14:52–67, 2002.
P. Czyzak and A. Jaszkiewicz. Pareto simulated annealing — a metaheuristic technique for multiple-objective combinatorial optimization. Journal of multicriteria decision analysis, 7:34–47, 1998.
V.G. Deineko and G.J. Woeginger. A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem. Mathematical Programming, Ser. A, 87:519–542, 2000.
M. Ehrgott. Multicriteria optimization. Springer, 2000.
O. Ergun, J.B. Orlin, and A.S-Feldman. Creating very large scale neighborhoods out of smaller ones by compounding moves: A study on the vehicle routing problem, 2003. submitted.
G. Gutin. Exponential neighbourhood local search for the traveling salesman problem. Computers and Operations Research, 26(4), 1999.
G. Gutin, A. Yeo, and A. Zverovitch. Exponential neighborhoods and domination analysis for the TSP. In G. Gutin and A.P. Punnen, editors, Traveling salesman problem and its variations, pages 223–256. Kluwer, 2002.
M.P. Hansen and A. Jaszkiewicz. Evaluating the quality of approximations to the non-dominated set. Technical Report IMM-REP-1998-7, IMM (Institute Of Mathematical Modelling, Technical University of Denmark) Technical Report, 1998.
J. Hurink. Efficient calculation of a best neighbor for a one machine batching problem. Technical report, Osnabrücker Schriften zur Mathematik, Reihe P, No. 180, 1996.
A. Jaszkiewicz. Genetic local search for Multiobjective combinatorial optimization. European Journal of Operational Research,137:50-71, 2002.
D.S. Johnson. A theoretician’s guide to the experimental analysis of algorithms. In M. Goldwasser, D.S. Johnson, and C.C. McGeoch, editors, To appear in Proceedings of the 5th and 6th DIMACS Implementation Challenges. American Mathematical Society, Providence, 2002.
H. Kubotani and K. Yoshimura. Performance evaluation of acceptance probability functions for Multiobjective simulated annealing. Computers and operations research, 30(3):427–442, 2003.
C.H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proceedings 41th Annual IEEE Symposium on Foundations of Computer Science, pages 86-92, 2000.
C.N. Potts and S.L. van de Velde. Dynasearch-iterative local improvement by dynamic programming: Part 1, the traveling salesman problem. Technical report, Faculty of Mathematical Studies, University of Southampton,U.K., 1995.
C.R. Reeves, editor. Modern heuristic techniques for combinatorial problems. Blackwell Scientific Publications, 1993.
P. Serafmi. Simulated annealing for multiple objective optimization problems. In Proceedings of the tenth international conference on multiple criteria decision making, volume 1, pages 87–96, 1992. Taipei 19-24.07.
E.-G. Talbi, M. Rahoual, M.H. Mabed, and C. Dhaenens. A hybrid Multiobjective evolutionary approach to engineering shape design. In E. Zitzler, K. Deb, L. Thiele, C.A. Coello, and D. Corne, editors, Proceedings of the first international conference on evolutionary multi-criterion optimization, pages 416–428, 2001. LNCS 1993.
E.L. Ulungu, J. Teghem, Ph. Fortemps, and D. Tuyttens. MOSA method: a tool for solving multiobjective combinatorial optimization problems. Journal of multi-criteria decision analysis, 8:221–236, 1999.
E. Zitzler. Evolutionnary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss federal Institute of Technology Zurich, November 1999.
E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms on test functions of different difficulty. In Annie S. Wu, editor, Proceedings of the 1999 Genetic and Evolutionary Computation Conference. Workshop Program, pages 121–122, Orlando, Florida, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angel, E., Bampis, E., Gourvès, L. (2004). 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. Lecture Notes in Economics and Mathematical Systems, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17144-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-17144-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20637-8
Online ISBN: 978-3-642-17144-4
eBook Packages: Springer Book Archive