Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Realtime Multiple Vehicle Routing Problem using Self-Organization Map

자기조작화 신경망을 이용한 복수차량의 실시간 경로계획

  • 이종태 (동국대학교 산업공학과) ;
  • 장재진 (한국외국어대학교 산업공학과)
  • Published : 2000.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

Keywords

References

  1. 유전자 알고리즘을 이용한 TSP 권영탁, 이충세
  2. OR(경영과학) 박순달
  3. Operations Research v.39 Parallel Savings Based Heuristic for the Delivery Problem Altinkemer, K.;B. Gavish
  4. Neural Networks v.1 no.4 Self-organising feature maps and the travelling salesman problem Angeniol, B.;De. La. Croix Vaubois G.;J. LeTexier
  5. Opns. Res. v.31 An Exact Algorithm for the Time-constrained Traveling Salesman Problem Baker, E. K.
  6. Operation Research v.38 no.4 Twenty Years of Routing and Scheduling Bodin, L. D.
  7. European Journal of Operation Research v.46 Vehicle Routing Consideration in Distribution System Design Bookbinder, J. H.;K. E. Reece
  8. European Journal of Operational Research v.86 Improvement heuristics for the Vehicle Routing Problem based on Simulated Annealing Breedam, A. V.
  9. Operational Research Quarterly v.20 no.3 An Algorithm for the Vehicle Dispatching Problem Christofides, N.;S. Eilon
  10. An Algorithm for the Time Constrained Traveling Salesman Problem Christofides, N.;A. Mingozzi;P. Toth
  11. Operations Research v.12 no.4 Scheduling of Vehicles from an Central Depot to a Number of Delivery Points Clarke, G.;J. Wright
  12. Management Science v.6 no.1 The Truck Dispatching Problem Dantzig, G. B.;J. H. Ramser
  13. European Journal of Operational Research v.46 A Classification Scheme for Vehicle Routing and Scheduling Problem Dersochers, M.;J. K. Lensta;M. W. P. Savelsbergh
  14. Mgmt. Sci. v.34 Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman problem with Time Windows Desrosiers, J.;F. Soumis;M. Sauve
  15. Opns. Res. v.40 A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows Desrochers, M.;J. Desrosiers;M. Solomon
  16. Opns. Res. v.43 An Optimal Algorithm for the Traveling Salesman Problem with Time Windows Dumas, Y.;J. Desrosiers;E. Gelinas;M. Solomon
  17. Opns. Res. v.40 New Insertion and Postoptimization Procedures for the Traveling Salesman Problem Gendreau, M.;A. Hertz;G. Laporte
  18. Management Science v.40 no.10 A Tabu Search Heuristic for the Vehicle Routing Problem Gendreau, M.;A. Hertz;G. Laporte
  19. Opns. Res. v.43 A Generalized Insertion Heuristic for the Traveling Salesman with Time Windows Gendreau, M.;A. Hertz;G. Laporte;M. Stan
  20. Biological Cybernetics v.43 Self-organized formation of topologically correct feature maps Kohonen, T.
  21. Operations Research Quaterly v.27 no.1 A vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme Holmes, R. A.;R. G. Parker
  22. Biological Cybernetics v.52 Neural computation of Decisions in optimisation problems Hopfield, J. J.;D. W. Tank
  23. Annals of Operations Research v.41 Metastrategy Simulated Annealing and Tabu search Algorithms for the Vehicle Routing Problem Osman, I. H.
  24. Transportation Science v.32 no.1 An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows Pesant, G.;M. Gendreau;J. Potvin;J. Rousseau
  25. Anns. Opns. Res. v.4 Local Search in Routing Problems with Time Windows Savelsbergh, M.
  26. ORSA J. Computing v.4 The Vehicle Routing Problem with Time Windows : Minimizing Route Duration Savelsbergh, M.
  27. Journal of Operational Research Society v.53 A Self-organising model for the travelling salesman problem Somhom, S.;A. Modares;T. Enkawa
  28. Practical Handbook of Genetic Algorithms : Complex Structures Genetic Algorithms, Tabu Search and Simulated Annealing Methods for Vehicle Routing Problems with Time Windows Thangiah, S. R.;L. Chambers(ed.)