Solving vehicle routing problems by maximum neuron model

Advanced Engineering Informatics

Volumn 16, Issue 2, 2002, Pages 99-105

  Yoshiike, Noriko ^a   Takefuji, Yoshiyasu ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

Clustering problem; Elastic net; Maximum neuron model; Vehicle routing problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CUSTOMER SATISFACTION; HEURISTIC METHODS; IMAGE SEGMENTATION; MATHEMATICAL MODELS; VEHICLES;

CLUSTERING PROBLEM; ELASTIC NET; MAXIMUM NEURON MODEL; VEHICLE ROUTING PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 1642398859     PISSN: 14740346     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1474-0346(01)00006-4     Document Type: Article

References (19)

1. Amartur S.C., Piraino D., Takefuji Y. Optimization neural networks for the segmentation of magnetic resonance images. IEEE Trans Med Imag. 11:(2):1992.
2. Christofides N., Eilon S. An algorithm for the vehicle dispatching problem. Oper Res Q. 20:1969;309.
3. Christofides N, Mingozzi A, Toth P. The vehicle routing problem. Urbino Working Paper, July, 1978.
4. Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Oper Res. 12:(4):1964;568-581.
5. Durbin R., Wilshaw D. An analogue approach to the traveling salesman problem using an elastic net method. Nature. 326:1987;689-691.
6. Eilon S., Watson-Grandy C.D.T., Christofides N. Distribution management. 1971;Hafner Publishing Company, New York.
7. Fisher M.L., Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks. 11:1981;109-124.
8. Gaskell T.J. Basis for vehicle fleet scheduling. Oper Res Q. 18:1967;281.
9. Gillett B., Miller L. A heuristic algorithm for the vehicle dispatch problem. Oper Res. 22:1974;340-349.
10. Kohonen T. Self-organization and associative memory. 1988;Springer, New York.
11. Lin S. Computer solution of the traveling salesman problem. Bell Syst Tech J. 44:1965;2245-2269.
12. Lin S., Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Oper Res. 21:1973;498-516.
13. Oka S., Ogawa T., Oda T., Takefuji Y. A new self-organization classification algorithm for remote-sensing images. IEICE Trans Inf Syst. E81-D:(1):1998;132-136.
14. Russell R.A. An effective heuristic for the M-tour traveling salesman problem with some side conditions. Oper Res. 25:(3):1977;517-524.
15. Simmen M.W. Parameter sensitivity of the elastic net approach to the traveling salesman problem. Neural Comput. 3:1991;363-374.
16. Takefuji Y., Lee K.-C., Aiso H. An artificial maximum neural network: a winner-take-all neuron model forcing the state of the system in a solution domain. Biol Cybern. 67:1992;243-251.
17. Tyagi M. A practical method for the truck dispatching problem. J Oper Res Soc Jpn. 10:1968;76-92.
18. Vakhutinsky A.I., Golden B.L. Solving vehicle routing problems using Elastic Nets. IEEE Int Conf Neural Networks. 7:1994;4535-4540.
19. Yellow P. A computational modification to the savings method of vehicle scheduling. Oper Res Q. 21:1970;281.