✦ LIBER ✦

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

✍ Scribed by Wei Yu; Zhaohui Liu

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 777 KB
Volume: 37
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.10.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-vehicle scheduling problems with

Single-vehicle scheduling problems with release and service times on a line

✍ Wei Yu; Zhaohui Liu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

On the worst-case performance of some he

On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints

✍ Marius M. Solomon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

Comments on “An improved model for vehic

Comments on “An improved model for vehicle routing problem with time constraint based on genetic algorithm” [Comput. Ind. Eng. 42 (2002) 361–369]

✍ Hong-Tao Lei; Bo Guo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An improved model for vehicle routing problem proposed by was recently published in Computer & Industrial Engineering Journal to solve the time constraint vehicle routing problem based on improved genetic algorithm. In this work, comments are given to the published paper of . And they centralize on

2-Approximation algorithms for the multi

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

✍ Yoshiyuki Karuno; Hiroshi Nagamochi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In this paper, given a path G with n vertices v1; v2; : : : ; vn and m identical vehicles, we consider a scheduling problem of the vehicles on the path. Each vertex vj in G has exactly one job j. Any of the n jobs must be served by some vehicle. Each job j has a release time rj and a handling time h