An Exact Algorithm for the Asymmetrical Vehicle Routing Problem

차량경로문제에 대한 최적해법

  • Published : 1987.04.01

Abstract

The general vehicle routing problem has been studied by many researchers such as Christofides, et al. and Laporte, et al., but only limited effort has been devoted to developing the optimal algorithms. The purpose of this paper is to develop a branch and bound algorithm which determines the optimal vechicle routes and the optimal number of vehicles concurrenetly for the asymmetrical vehicle routing problem. In order to enhance the efficiency, this algorithm emphasizes the followings ; First, an efficient primal-dual approach is developed to solve subproblems which are called the specialized transportation problem, formed by relaxing the illegal subtour constraints from the vehicle routing problem, second, an improved branching scheme is developed to reduce the number of candidate subproblems by adequate utilization of vehicle capacity restrictions.

Keywords

References

  1. 서울대학교대학원 공학박사학위논문 차량경로비용을 고려한 단일 분배센타 입지선정문제 송성헌
  2. Ops. Res. v.19 Pathology of Traveling Saleman Subtour Elimination Algorithms Bellmore,M.;Malone,J.C.
  3. Comput. Ops. Res. v.10 Routing and Scheduling of Vehicles and Crews. The State of the Art Bodin,L.B.;Golden,A.Assad;M.Ball
  4. Manag. Sci. v.26 Some New Branching and Bounding Criteria for the Asymmetrical Travelling Salesman Problem Carpaneto,G.;P.Toth
  5. Math. Prog. v.20 Exact Algorithm for Vehicle Routing Problem, Based on Spanning Tree and Shortest Path Relaxations Christofides,N.;A.Mingozzi;P.Toth
  6. Ops. Res. v.12 Sceduling of Vehicle from a Central . Depot to a Number of Delivery Points Clarke,G.;J.W.Wright
  7. Management Sci. v.6 The Truck Dispatching Problem Dantzig,G.B.;J.H.Ramser
  8. Networks v.14 Two Exact Algorithm for the Distance-Constrained Vehicle Routing Problem Laporte,G.;M.Desrochers;Y.Nobert
  9. Networks v.16 An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing ;roblem Laporte,G.;H.Mercure;Y.Norbert
  10. Ops. Res. v.33 Optimal Routing under Capacity and Distance Restricitions Laporte,G.;Y.Nobert;M.Desrochers
  11. Networks v.11 Complezity of Vehicle Routing and Scheduling Problems Lenstra,J.K.;A.H.G.Rinnooy Kan
  12. Combinatorial Optimization and Vehicle Fleet Planning:Perspective and Prospects v.11 Magnanti,T.L.
  13. Linear and Combinatorial Programming Murty,K.G.
  14. Networks v.11 Formulation and Structure of More Complex/Realistic Routing and Scheduling Problems Schrage,L.
  15. Naval Res. Logistics Q. v.18 The Transportation, Paradox Szware,W.