✦ LIBER ✦

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem

✍ Scribed by Mutsunori Yagiura; Shinji Iwasaki; Toshihide Ibaraki; Fred Glover

Book ID: 108114329
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 279 KB
Volume: 1
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2004.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Very large-scale neighborhood search alg

Very large-scale neighborhood search algorithms for the design of

✍ Jocelyne Elias; Fabio Martignon; Giuliana Carello 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 679 KB

Iterated local search algorithm based on

Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem

✍ Lixin Tang; Xianpeng Wang 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 603 KB

A genetic algorithm with neighborhood se

A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem

✍ Sepehr Proon; Mingzhou Jin 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

A dynamic programming methodology in ver

A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem

✍ Özlem Ergun; James B. Orlin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 215 KB

An optimal column-generation-with-rankin

An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment

✍ Celso Carneiro Ribeiro; Michel Minoux; Manoel Camillo Penna 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 633 KB

A branch-and-price-based large neighborh

A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr