Browse > Article

Optimal Routing and Uncertainty Processing using Geographical Information for e-Logistics Chain Execution  

Kim, Jin Suk (Postal Technology Research Center, ETRI)
Ryu, Keun Ho (School of Electrical and Computer Engienering, Chungbuk National University)
Publication Information
Management Science and Financial Engineering / v.10, no.2, 2004 , pp. 1-28 More about this Journal
Abstract
The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.
Keywords
e-Logistics; Supply chain; Logistics chain; Routes and scheduling; Tabu search; Moving object; GPS/GIS/ITS; Vehicles tracing; Uncertainty processing; Spatiotemporal database;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Clarke and J. W. Wright, 'Scheduling of vehicles from a central depot to a number of delivery points,' Oper. Res. 12 (1964), 568-581   DOI   ScienceOn
2 Y. Theodoridis, J. Silva, and M. Nascimento, 'On the Generation of Spatiotemporal Datasets', Proceedings of the 6th International Symposium on Large Spatial Databases (SSD-99), JuI. 1999
3 D. Pfoser, et al., 'Capturing the Uncertainty of Moving-Object Representations', Proceedings of the International Symposium on Spatial Databases (SSD), 1999
4 M. Erwig, R. H. Guting, M. Schneider and M. Vazirgiannis, 'Spatio-Temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases', GeoInformatica 3, 3 (1999), 269-296   DOI   ScienceOn
5 D. Kim, K. Ryu and H. Kim, 'A Spatiotemporal Database Model and Query Language', The Journal of Systems & Software, 55, 2 (Feb. 2001)   DOI   ScienceOn
6 P. Toth and D. Vigo., The Granular Tabu Search (and its Application to the Vehicle Routing Problem), Working paper, 2001
7 Duck-Joong Jeon, A heuristic algorithm for the vehicle routing problem with time-dependent travel time, MS thesis, KAIST, Daejeon, 2002
8 R. Guting, M. Bohlen, M. Erwig, C. Jensen, N. Lorentzos, M. Schneider, and M. Vazirgiannis, 'A Foundation for Representinf and Querying Moving Objects', ACM Transactions on Database Systems (TODS) 25, 1 (Mar. 2000)   DOI   ScienceOn
9 R. H. Ballou, Business Logistics Management, Prentice Hall, New Jersey, 1999
10 A. Mingozzi, S. Giorgi and R. Baldacci, 'An exact method for the vehicle routing problem with backhauls', Transportation Science, 33, 3 (1999), 315-329   DOI
11 J. F. Cordeau, M. Gendreau and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems, John Wiley & Sons, Inc., (1997), 105-119
12 P. Toth and D. Vigo , 'A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls', European Journal of Operational Research 113 (1999), 528-543   DOI   ScienceOn
13 S. Chopra and P. Meindl, Supply Chain Management: strategy, planning, and operation, Prentice Hall, New Jersey, 2001
14 I. H. Osman, 'Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,' Annals of Operations Research 41 (1993), 421-451   DOI
15 G. Laporte, 'The Traveling Salesman Problem: An overview of exact and approximate algorithms,' European Journal of Operational Research 59 (1992), 231-247   DOI   ScienceOn
16 R. Cordone and R. W. Calvo., 'A Heuristic for the Vehicle Routing Problem with Time Windows', Journal of Heuristics 7 (2001), 107-129   DOI