Abstract
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathematical programming formulation and simple metaheuristics for solving it. The formulation is based on a transformation of the input data, in such a way that a standard mathematical programming model for the Asymmetric Travelling Salesman Problem can be used on this slightly different problem. Two standard metaheuristics for the asymmetric travelling salesman are proposed and analysed on this variant: repeated random construction followed by local search with the 3-Exchange neighbourhood, and iterated local search based on the same neighbourhood and on a 4-Exchange perturbation. The computational results obtained show the interest and the complementary merits of using a mixed-integer programming solver and an approximative method for the solution of this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960)
Johnson, D., McGeoch, L.: Local search in combinatorial optimization. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization. John Wiley & Sons, Inc., New York (1997)
Croes, G.A.: A method for solving traveling-salesman problems. Operations Research 6, 791–812 (1958)
Flood, M.M.: The traveling-salesman problem. Operations Research 4, 61–75 (1956)
Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovitch, A.: Experimental analysis of heuristics for the atsp. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Kluwer Academic Publishers, Boston (2002)
Bixby, B., Reinelt, G.: TSPLIB – A library of travelling salesman and related problem instances. Internet repository (1995), http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual, Version 2.0 (2010), http://www.gurobi.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedroso, J.P. (2011). Metaheuristics for the Asymmetric Hamiltonian Path Problem. In: Dimov, I., Dimova, S., Kolkovska, N. (eds) Numerical Methods and Applications. NMA 2010. Lecture Notes in Computer Science, vol 6046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18466-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-18466-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18465-9
Online ISBN: 978-3-642-18466-6
eBook Packages: Computer ScienceComputer Science (R0)