Browse > Article

A Tabu Search Algorithm for the Vehicle Routing Problem with Time Window and Dock Capacity Constraints  

Zang Heejeong (한국과학기술원 산업공학과)
Lee Kyungsik (한국외국어대학교 산업정보시스템공학부)
Choi Eunjeung (한국과학기술원 산업공학과)
Park Sungsoo (한국과학기술원 산업공학과)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.30, no.4, 2005 , pp. 45-60 More about this Journal
Abstract
We consider a vehicle routing problem with time window and dock capacity constraints (VRPTD). In most traditional models of vehicle routing problems with time window (VRPTW), each customer must be assigned to only one vehicle route. However demand of a customer may exceed the capacity of one vehicle, hence at least two vehicles may need to visit the customer We assume that each customer has Its own dock capacity. Hence, the customer can be served by only a limited number of vehicles simultaneously. Given a depot, customers, their demands, their time windows and dock capacities, VRPTD is to get a set of feasible routes which pass the depot and some customers such that all demands of each customer are satisfied Since VRPTD is NP-hard, a meta-heuristic algorithm is developed. The algorithm consists of two Procedures : the route construction procedure and the route scheduling procedure. We tested the algorithm on a number of instances and computational results are reported.
Keywords
VRPTW; Dock Capacity Constraints; Tabu Search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 서병규, 김종수, '지연 비용을 고려한 서비스 시간대가 존재하는 외판원 문제에 대한 발견적 해법', 대한산업공학회지, 제27권, 제1호(2001), pp.18-24
2 Glover, F., 'Future Paths for Integer Programming and Links to Artificial Intelligence,' Comput. Operations Res. Vol.13, No.5(1986), pp.533-549   DOI   ScienceOn
3 He, Z., T. Yang, and A Tiger, 'An Exchange Heuristic Imbedded with Simulated Annealing for Due-Dates Job-Shop Scheduling,' Euro. J. of Operational Res. Vol.91, No.1 (1994), pp.99-117
4 Koskosidis, Y.A., W.B. Powell, and M.M. Solomon, 'An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints,' Transportation Science, Vol.26, No.2(1992), pp.69-85   DOI
5 Brandao, J. and A Mercer, 'A Tabu Search Algorithm for the Multi-Trip Vehicle Routing and Scheduling Problem,' Euro. J. of Operational Res., Vol.100, No.1(1997), pp.180-191   DOI   ScienceOn
6 Kim, Y.D., 'A Comparison of Dispatching Rules for Job with Multiple Identical Jobs and Alternative Routings,' Int. J. Prod Res.,Vol.28(1990), pp.953-962   DOI
7 Clarke, G. and J,W. Wright, 'Scheduling of Vehicles from A Central Depot to A Number of Delivery Points,' Operations Res. Vol.12, No.4(1964), pp.568-581   DOI   ScienceOn
8 Solomon, M.M., 'Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,' Operations Res., Vol.35, No.2(1987), pp.254-265   DOI   ScienceOn
9 Su, L.H., P.C. Chang, and E.S. Lee, 'A Heuristic for Scheduling General Job Shops to Minimize Maximum Lateness,' Mathl.Comput. Modeling, Vol.27, No.1(1998), pp. 1-15
10 Baker, K.R. and G.B. McMahon, 'Scheduling the General Job-Shop,' Management Science, Vol.31, No.5(1985), pp.594-598   DOI   ScienceOn
11 Beasley, J.E., M. Krishnamoorthy, YM. Sharaiha, and D.A Bramsom, 'Scheduling Aircraft Landings The Static Case,' Transportation Science, Vol.34, No.2(2000), pp. 180-197   DOI   ScienceOn
12 Garey, M.R. and D.S. Johnson, Computers and Intractability, W.H. Freeman and Co., San Francisco, 1979
13 Fisher, M.L., B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan, 'Surrogate Duality Relaxation for Job-Shop Scheduling,' Discrete Applied Mathematics, Vol.5, No.1 (1983), pp.65-75   DOI   ScienceOn
14 Ball, M.O., T.L. Magnanti, C.L Monma, and G.L. Nemhauser, Network Routing, Northholland, Amsterdam, 1995
15 Tan, K.C., L.H. Lee, Q.L. Zhu, and K. Ou, 'Heuristic Methods for Vehicle Routing Problem with Time Windows,' Artificial Intelligence in Engineering, Vol.15, No.3 (2001), pp.281-29S   DOI   ScienceOn
16 Bodin, L. and B. Golden, 'Classification in Vehicle Routing and Scheduling,' Networks, Vol.11(1981), pp.97-108   DOI
17 Adams, J., E. Balas, and D. Zawack, 'The Shifting Bottleneck Procedure for Job-Shop Scheduling,' Management Science, Vol.34, No.3(1988), pp.391-401   DOI   ScienceOn