Abstract
This paper presents an artificial neural network algorithm for prize-collecting traveling salesman problem with time windows, which is often encountered when scheduling color-coating coils in cold rolling production or slabs in hot rolling mill. The objective is to find a subset sequence from all cities such that the sum of traveling cost and penalty cost of city unvisited is minimized. To deal with this problem, we construct mathematical model and the corresponding network formulation. Chaotic neurodynamic is introduced and designed to obtain the solution of the problem, and the workload reduction strategy is proposed to speed up the solving procedure. To verify the efficiency of the proposed method, we compare it with ordinary Hopfield neural network by performing experiment on the problem instances randomly generated. The results clearly indicate that the proposed method is effective and efficient for given size of problems with respect to solution quality and computation time.
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
Okano, H., Davenport, A.J., Trumbo, M., Reddy, C., Yoda, K., Amano, M.: Finishing Line Scheduling in the Steel Industry. Journal of Research & Development 48(5/6), 811–830 (2004)
Laporte, G., Martello, S.: The Selective Traveling Salesman Problem. Discrete Applied Mathematics 26, 193–207 (1990)
Balas, E.: The Prize Collecting Traveling Salesman Problem. Networks 19, 621–636 (1989)
Dror, M.: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW. Operations Research 42, 977–978 (1994)
Desrochers, M., Soumis, F.: A Reoptimization Algorithm for the Shortest Path Problem with Time Windows. European Journal of Operational Research 35, 242–254 (1988)
Smith, K.A.: Hopfield Neural Networks of Timetabling: Formulations, Methods and Comparative Results. Computers & Industrial Engineering 44, 283–284 (2003)
Hopfield, J.J., Tank, D.W.: Neural Computation of Decisions in Optimization Problems. Biological Cybernetics 52, 141–152 (1985)
Hasegawa, M., Ikeguchi, T., Aihara, K.: Solving Large Scale Traveling Salesman Problems by Chaotic Neurodynamics. Neural Networks 15, 271–283 (2002)
Chen, L.N., Aihara, K.: Chaotic Simulated Annealing by a Neural Network Model with Transient Chaos. Neural Networks 8(6), 915–930 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Tang, L. (2007). Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network. In: Liu, D., Fei, S., Hou, Z., Zhang, H., Sun, C. (eds) Advances in Neural Networks – ISNN 2007. ISNN 2007. Lecture Notes in Computer Science, vol 4492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72393-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-72393-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72392-9
Online ISBN: 978-3-540-72393-6
eBook Packages: Computer ScienceComputer Science (R0)