✦ LIBER ✦

Exact algorithms for different classes of vehicle routing problems

✍ Scribed by Roberto Roberti

Book ID: 120967360
Publisher: Springer
Year: 2012
Tongue: English
Weight: 73 KB
Volume: 11
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-012-0206-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A unified exact method for solving diffe

A unified exact method for solving different classes of vehicle routing problems

✍ Roberto Baldacci; Aristide Mingozzi 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 373 KB

Exact algorithms for routing problems un

Exact algorithms for routing problems under vehicle capacity constraints

✍ Roberto Baldacci; Paolo Toth; Daniele Vigo 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 705 KB

An Exact Algorithm for the Multitrip Veh

An Exact Algorithm for the Multitrip Vehicle Routing Problem

✍ Mingozzi, Aristide; Roberti, Roberto; Toth, Paolo 📂 Article 📅 2013 🏛 Operations Research Society of America 🌐 English ⚖ 317 KB

Two exact algorithms for the distance-co

Two exact algorithms for the distance-constrained vehicle routing problem

✍ Gilbert Laporte; Martin Desrochers; Yves Nobert 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 530 KB

An exact algorithm for the asymmetrical

An exact algorithm for the asymmetrical capacitated vehicle routing problem

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

An exact algorithm for the asymmetrical

An exact algorithm for the asymmetrical capacitated vehicle routing problem

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr