✦ LIBER ✦

A Lagrangian relaxation-based heuristic for the vehicle routing with full container load

✍ Scribed by Akio Imai; Etsuko Nishimura; John Current

Book ID: 108117020
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 210 KB
Volume: 176
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.06.044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A GA Based Heuristic for the Vehicle Rou

A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips

✍ S. Salhi; R. J. Petch 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 881 KB

Packing first, routing second—a heuristi

Packing first, routing second—a heuristic for the vehicle routing and loading problem

✍ Bortfeldt, Andreas; Homberger, Jörg 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 463 KB

A sweep-heuristic based formulation for

A sweep-heuristic based formulation for the vehicle routing problem with cross-docking

✍ Rodolfo Dondo; Jaime Cerdá 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A Heuristic for the Vehicle Routing Prob

A Heuristic for the Vehicle Routing Problem with Time Windows

✍ Roberto Cordone; Roberto Wolfler Calvo 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 99 KB

A Tabu search heuristic for the vehicle

A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvaro Martello 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive

A set-covering based heuristic algorithm

A set-covering based heuristic algorithm for the periodic vehicle routing problem

✍ Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 239 KB