참고문헌
- 고준택, 유영훈, 조근식, "한정 용량 차량 경로탐색 문제에서 이분시드 검출법에 의한 발견적 해법", 한국지능정보시스템학회 지능정보연구논문지, 15권, 1호(2009), 1-12.
- Baker E. K. and Schaffer J. R., Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, American Journal of Mathematical and Management Sciences Vol.6(1988), 261-300.
- Bard J. F., G. Kontoravdis, and G. Yu, "A Branchand-Cut procedure for the vehicle routing problem with time windows", Transportaion Secience, Vol.36, No.2(2002), 250-269
- Bodin L., B. Golden, A. Assad, and M. Ball, "Routing and Scheduling of Vehicles and Crews : The State of the Art. Comput", Opns. Res. Vol.10(1983), 62-212.
- Christofides N., A. Mingozzi, and P. Toth, "The Vehicle Routing Problem. In Combinatorial Optimizations", John Wiley and Sons, New York, 1979.
- Clarke G. and W. Wright, "Scheduling of Vehicles from a Central Depot to A Number of Delivery Points", Operational Research, Vol.12(1964), 568-581. https://doi.org/10.1287/opre.12.4.568
- Desrochers M., J. Desrosiers, and M. M. Solomon, "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows", Operations Research, Vol.40(1992), 342-354. https://doi.org/10.1287/opre.40.2.342
- Fisher M., and R. Jaikumar, "A Generalized Assignment Heuristic for Vehicle Routing". Networks, Vol.11(1981), 109-124. https://doi.org/10.1002/net.3230110205
- Gillet B., and L. Miller, "A Heuristic Algorithm for the Vehicle Dispatching Problem", Operations Research Vol.22(1974), 340-349. https://doi.org/10.1287/opre.22.2.340
- Glover F., "Tabu Search Part I", ORSA Journal on Computing, Vol.1, No.3(1989), 190-206. https://doi.org/10.1287/ijoc.1.3.190
- Glover F., "Tabu Search Part II", ORSA Journal on Computing, Vol.2, No.1(1990), 4-32. https://doi.org/10.1287/ijoc.2.1.4
- Glover F., and E. Taillard, "A user's guide to tabu search", Annals of Operations Research, Vol.41 No.1(1993), 1-28. https://doi.org/10.1007/BF02078647
- Ibrahim H. Osman, and James P. Kelly, METAHEURISTICS : Theory and Applications, Springer, 1 edition, March Vol.31, 1996.
-
Irnich S. and Villeneuve D., The shortest path problem with k-cycle elimination (k
$ge$ 3) : Improving a branch-and-price algorithm for the VRPTW. INFORMS Journal of Computing (2005). - Kolen A., Rinnooy Kan A. H. G., and H. Trienekesn, "Vehicle Routing with Time Windows", Operations Research, Vol.35(1987), 266-273. https://doi.org/10.1287/opre.35.2.266
- Lau H. C., Sim M., and K. M. Teo, "Vehicle routing problem with time windows and a limited number of vehicles", Eur. J. Oper. Res., Vol.148(2003), 559-568. https://doi.org/10.1016/S0377-2217(02)00363-6
- Lenstra, J. K., and Rinnooy Kan, A. H. G., "Complexity of vehicle routing and scheduling problems", Networks, Vol.1(1981), 221-227.
- Or I., "Traveling Salesman-type Combinatorial Problems and their relation to the Logistics of Blood Banking", Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL. 1976.
- Potvin J. Y. and J. M. Rousseau, "An Exchange Heuristic for Routing Problems with Time Windows", Journal of the Operational Research Society, Vol.46(1995), 1433-1446. https://doi.org/10.1057/jors.1995.204
- Savelsbergh M., Private Communication by Alexander Rinnooy Kan. 1984.
- Solomon Marius M., "Algorithms for the vehicle routing and scheduling problems with time window constraints", Operations Research, Vol.35, Is., Vol.2(1987), 254-262. https://doi.org/10.1287/opre.35.2.254
- Taillard E. D., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, "A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows", Te Vsportation Science, Vol.31, No.2(1997), 170-186.