✦ LIBER ✦

Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem

✍ Scribed by Marta Mesquita; Ana Paias

Book ID: 118435278
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 227 KB
Volume: 35
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2006.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branching approaches for integrated vehi

Branching approaches for integrated vehicle and crew scheduling

✍ Marta Mesquita; Ana Paias; Ana Respício 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 293 KB

A set-partitioning-based exact algorithm

A set-partitioning-based exact algorithm for the vehicle routing problem

✍ Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 899 KB

On the Set-Covering Problem: II. An Algo

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

✍ Egon Balas and Manfred Padberg 📂 Article 📅 1975 🏛 INFORMS 🌐 English ⚖ 511 KB

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

The Vehicle Routing Problem || 4. Set-Co

The Vehicle Routing Problem || 4. Set-Covering-Based Algorithms for the Capacitated VRP

✍ Toth, Paolo; Vigo, Daniele 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB

In The Field Of Combinatorial Optimization Problems, The Vehicle Routing Problem (vrp) Is One Of The Most Challenging. Defined More Than 40 Years Ago, The Problem Involves Designing The Optimal Set Of Routes For Fleets Of Vehicles For The Purpose Of Serving A Given Set Of Customers. Interest In Vrp

A decomposition approach for the integra

A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern

✍ Mesquita, Marta; Moz, Margarida; Paias, Ana; Pato, Margarida 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 328 KB