𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices

✍ Scribed by Hà, Minh Hoàng; Bostel, Nathalie; Langevin, André; Rousseau, Louis-Martin

Book ID
120194830
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
336 KB
Volume
226
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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