Traveling salesman problem solving method fit for interactive repetitive simulation of large-scale distribution networks

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

Volumn 3, Issue , 1999, Pages

  Kubota, Sen ^a   Onoyama, Takashi ^a   Oyanagi, Kazuko ^a   Tsuruta, Setsuo ^a  

^a HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE SIMULATION; LARGE SCALE DISTRIBUTION LOGISTIC NETWORKS;

APPROXIMATION THEORY; COMPUTER SIMULATION; INTERACTIVE COMPUTER SYSTEMS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

TRAVELING SALESMAN PROBLEM;

EID: 0033332962     PISSN: 08843627     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. S.Lin, and B.W.Kernighan, An effective heuristic algorithm for the traveling salesman problem, Operations Research, Vol. 21,No.2, Feb.1972, pp.498-516
2. M. Kubo, Invitation to Traveller Salesman Problem, Operations Research, Vol. 39, No. 2,Apr.1994, pp.91-96.
3. T.Ibaraki, Discrete Optimization and Algorithm, Iwanami Syoten,Tokyo, 1993.
4. J.N.Hooker, N.R.Natraj,Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search, Transportation Science, Vol.29, No.1, Feb.1995, pp.30-44.
5. Bellman,R.E., Dreyfus, S.E. Applied Dynamic Programming, Prinston University Press, Prinston, N.J., 1962.
6. S. Arora, Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems, Journal of the ACM, Vol. 45, No. 5, Sep. 1998, pp.753-782.
7. Y.Yamamoto and M.Kubo, Invitation to Travelling Salesman Problem, Asakura Syoten, Tokyo, 1997.