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

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

An Exact Algorithm for the vehicle scheduling problem with multiple depots and multiple vehicle types

복수차고 복수차중 차량 일정 문제의 최적 해법

  • 김우제 (서울대학교 산업공학과) ;
  • 박우제 (서울대학교 산업공학과)
  • Published : 1988.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This vehicle scheduling problem with multiple depots and multiple vehicle types (VMM) is to determine the optimal vehicle routes to minimize the total travel costs. The object of this paper is to develope an exact algorithm for the VMM. In this paper the VMM is transformed into a mathematical model of the vehicle problem with multiple depots. Then an efficient branch and bound algorithm is developed to obtain an exact solution for this model. In order to enhance the efficiency, this algorithm emphasizes the follows; First, a heuristic algorithm is developed to get a good initial upper bound. Second, an primal-dual approach is used to solve subproblems which are called the quasi-assignment problem, formed by branching strategy is presented to reduce the number of the candidate subproblems.

Keywords

References

  1. 서울대학교 대학원 공학 석사 학위 논문 복수차고 복수차종 차량일정문제의 최적해법 김우제
  2. Networks v.17 On some matching problems arising in vehicle scheduling models Berossi,A.;Carrarasi,P.;Gallo,G.
  3. Comput. Ops. Res. v.10 Routing and scheduling of vehicles and crew-the state of the art Bodin,L.;Golden,B.;Assad,A.;Ball,M.
  4. J. Urban Anal v.5 UCOST : A Micro approach to a transit planning problem Bodin,L.;Rosenfield;Kydes,A.
  5. E.J. of Ops. Res. v.16 Nework models for vehicle and crew scheduling Carraresi,P.;Gallo,G.
  6. Mgmt. Sci. v.26 Some new branching and bounding criteria for the asymmetric traveling salesman problem Carpaneto,G.;Toth,P.
  7. OR Quaterly v.23 TRAMP-A multidepot vehicle scheduling system Cassidy,P.;Bennett H.
  8. Ops. Res. v.12 Scheduling of vehicle from a central depot to a number of delivery points Clarke;G.;Wright,J.
  9. Naval Res. Logis. Qu v.1 Minimizing the number of truckers to meet a fixed schedule Dantzing,G.;Fulkerson,D.
  10. Networks v.16 An exact algorithm for asymmetrical capacitated capactied vehicle routing problem Laporte,G.;Mercure,H.;Norbert,Y.
  11. Networks v.11 Complexity of vehicle routing and scheduling problems Lenstra,J.;Rinnooy,Kan
  12. Ops. Res. v.21 An effective heuristic algorithm for the traveling salesman problem Lin,S.;Kernighan,B.
  13. Networks v.17 A quasi-assignment algorithm for scheduling Paixao,J.;Branco,I.
  14. Computer scheduling of public transport VAMPIPE and TASC : two successfully applied bus scheduling programs Smith,B.;Wren,A.
  15. O.R. Quarterly v.23 Computer scheduling of vehicles from one or more depots to a number of delivery points Wren,A.;Holliday,A.