✦ LIBER ✦

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

✍ Scribed by Miao, Lixin (author);Ruan, Qingfang (author);Woghiren, Kevin (author);Ruo, Qi (author)

Book ID: 120517266
Publisher: EDP Sciences
Year: 2012
Tongue: French
Weight: 403 KB
Volume: 46
Category: Article
ISSN: 0399-0559
DOI: 10.1051/ro/2012008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid genetic algorithm for the vehic

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

✍ Miao, Lixin (author);Ruan, Qingfang (author);Woghiren, Kevin (author);Ruo, Qi (a 📂 Article 📅 2012 🏛 EDP Sciences 🌐 French ⚖ 403 KB

A hybrid algorithm for the capacitated v

A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints

✍ Andreas Bortfeldt 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 306 KB

A Hybrid Metaheuristic Algorithm for the

A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem

✍ Tarantilis, C.D.; Zachariadis, E.E.; Kiranoudis, C.T. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 872 KB

Metaheuristics for vehicle routing probl

Metaheuristics for vehicle routing problems with three-dimensional loading constraints

✍ Guenther Fuellerer; Karl F. Doerner; Richard F. Hartl; Manuel Iori 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Metaheuristics for the vehicle routing p

Metaheuristics for the vehicle routing problem with loading constraints

✍ Karl F. Doerner; Guenther Fuellerer; Richard F. Hartl; Manfred Gronalt; Manuel I 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 220 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