Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network

Authors:
Yanyan Zhang;Lixin Tang
Affiliations:
The Logistics Institute Northeastern University, Shenyang, China;The Logistics Institute Northeastern University, Shenyang, China
Venue:
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
Year:
2007

Citing 5
Cited 0

The selective travelling salesman problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
Solving large scale traveling salesman problems by chaotic neurodynamics

Neural Networks
Hopfield neural networks for timetabling: formulations, methods, and comparative results

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Finishing line scheduling in the steel industry

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

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.