1 |
Bent, R. and Van Hentenryck, P., A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers and Operations Research, 2006, Vol. 33, No. 4, pp. 875-893.
DOI
|
2 |
Dumas, Y., Desrosiers, J., and Soumis, F., The pickup and delivery problem with time windows, European Journal of Operational Research, 1991, Vol. 54, No. 1, pp. 7-22.
DOI
|
3 |
Ha, H.G. and Kim, Y.J., The strategies to stimulate online marketplaces for freight exchange services, [Sejong, Korea] : The Korea Transport Institute, 2003.
|
4 |
IBM, IBM ILOG CPLEX Interactive Optimizer 12.8. 0.0, https://www.ibm.com/analytics/cplex-optimizer.
|
5 |
Kang, C.S. and Lee, J.S., A Heuristic for Fleet Size and Mix Vehicle Routing Problem with Time Deadline, Journal of Society of Korea Industrial and Systems Engineering, 2005, Vol. 28, No. 2, pp. 8-17.
|
6 |
Lau, H.C. and Liang, Z., Pickup and delivery with time windows : algorithms and test case generation, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence, 2001, pp. 333-340.
|
7 |
Lee, S.C. and Yu, J.C., Improved VRP & GA-TSP Model for Multi-Logistics Center, Journal of the Korea Academia-Industrial Cooperation Society, 2007, Vol. 8, No. 5, pp. 1279-1288.
|
8 |
Moon, G.J. and Park, S.M., A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone, Journal of society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, pp. 171-178.
DOI
|
9 |
Li, H. and Lim, A., A metaheuristic for the pickup and delivery problem with time windows, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence, 2001, pp. 160-170.
|
10 |
Moon, G.J. and Hur, J.H., Development of an efficient vehicle routing heuristic by 2 Step advanced calculation, Journal of the Korean Institute of Plant Engineering, 2007, Vol. 12, No. 2, pp. 5-15.
|
11 |
Nanry, W.P. and Barnes, J., Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B Methodological, February 2000, Vol. 34, No. 2, pp. 107-121.
DOI
|
12 |
Ropke, S. and Pisinger, D., An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, 2006, Vol. 40, No. 4, pp. 455-472.
DOI
|
13 |
Xu, H., Chen, Z.L., Rajagopal, S., and Arunapuram, S., Solving a Practical Pickup and Delivery Problem, Transportation Science, 2003, Vol. 37, No. 3, pp. 347-364.
DOI
|
14 |
Savelsbergh, M.W.P. and Sol, M., The General Pickup and Delivery Problem, Transportation Science, 1995, Vol. 29, No. 1, pp. 17-29.
DOI
|
15 |
Sigurd, M.M., Pisinger, D., and Sig, M., The Pickup and Delivery Problem with Time Windows and Precedences, Transportation Science, 2004, Vol. 38, pp. 197-209.
DOI
|
16 |
SK Telecom, Tmap API, http://tmapapi.sktelecom/index.html.
|