✦ LIBER ✦

A multiple-neighborhood-based parallel composite local search algorithm for timetable problem

✍ Scribed by He Yan; Song-nian D. Yu

Book ID: 107482205
Publisher: Chinese Electronic Periodical Services
Year: 2004
Tongue: English
Weight: 619 KB
Volume: 8
Category: Article
ISSN: 1007-6417
DOI: 10.1007/s11741-004-0069-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel hybrid local search algorithm

A parallel hybrid local search algorithm for the container loading problem

✍ D. Mack; A. Bortfeldt; H. Gehring 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 231 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 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

A Note on the Local Convergence of a Pre

A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction

✍ Lu, Zhaosong; Monteiro, Renato D. C. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 130 KB