Vehicle routing problems on a line-shaped network with release time constraints

Operations Research Letters

Volumn 37, Issue 2, 2009, Pages 85-88

  Yu, Wei ^a   Liu, Zhaohui ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Line shaped network; Vehicle routing; Vehicle scheduling

Indexed keywords

NETWORK ROUTING; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; SCHEDULING; VEHICLES;

LINE-SHAPED NETWORK; MULTI VEHICLES; POLYNOMIAL-TIME ALGORITHMS; RELEASE TIME; VEHICLE ROUTING PROBLEMS; VEHICLE SCHEDULING;

VEHICLE ROUTING;

EID: 60749111187     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.10.006     Document Type: Article

References (12)

1. Gaur D.R., Gupta A., and Krishnamurti R. A frac(5, 3)-approximation algorithm for scheduling vehicles on a path with release and handling times. Information Processing Letters 86 (2003) 87-91
2. Karuno Y., Nagamochi H., and Ibaraki T. Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39 (2002) 203-209
3. Psaraftis H., Solomon M., Magnanti T., and Kim T.-U. Routing and scheduling on a shoreline with release times. Management Science 36 (1990) 212-223
4. Tsitsiklis J.N. Special cases of traveling salesman and repairman problems with time windows. Networks 22 (1992) 263-282
5. Afrati F., Cosmadakis S., Papadimitriou C.H., Papageorgiou G., and Papakostantinou N. The complexity of the traveling repairman problem. Informatique Theorique et Applications 20 1 (1986) 79-87
6. Garcia A., Jodra P., and Tejel J. A note on the traveling repairman problem. Networks 40 (2002) 27-31
7. Averbakh I., and Berman O. Routing and location-routing p-delivery men problems on a path. Transportation Science 28 (1994) 162-166
8. Simchi-Levi D., and Berman O. Minimizing the total flow time of n jobs on a network. IIE Transactions 23 (1991) 236-244
9. de Paepe W.E., Lenstra J.K., Sgall J., Sitters R.A., and Stougie L. Computer-aided complexity classification of dial-a-ride problems. INFORMS Journal on Computing 16 2 (2004) 120-132
10. Sitters R.A. The minimum latency problem is NP-hard for weighted trees. Lecture Notes in Computer Science 2337 (2002) 230-239
11. Y. Karuno, H. Nagamochi, T. Ibaraki, A 1.5-approximation for single vehicle scheduling problem on a line with release and handling times. in: Proc. ISCIE/ASME 1998 Japan-USA Symposium on Flexible Automation, vol. 3, 1998, pp. 1363-1368
12. Karuno Y., and Nagamochi H. 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discrete Applied Mathematics 129 (2003) 433-447