✦ LIBER ✦

Local search heuristics for the probabilistic dial-a-ride problem

✍ Scribed by Ho, Sin C. (author);Haugland, Dag (author)

Publisher: Springer
Year: 2009
Tongue: German
Weight: 385 KB
Volume: 33
Category: Article
ISSN: 0171-6468
DOI: 10.1007/s00291-009-0175-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search heuristics for the probabil

Local search heuristics for the probabilistic dial-a-ride problem

✍ Ho, Sin C. (author);Haugland, Dag (author) 📂 Article 📅 2009 🏛 Springer 🌐 German ⚖ 385 KB

Parallel Tabu search heuristics for the

Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

✍ Andrea Attanasio; Jean-François Cordeau; Gianpaolo Ghiani; Gilbert Laporte 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

An effective and fast heuristic for the

An effective and fast heuristic for the Dial-a-Ride problem

✍ Roberto Wolfler Calvo; Alberto Colorni 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 162 KB

A heuristic two-phase solution approach

A heuristic two-phase solution approach for the multi-objective dial-a-ride problem

✍ Sophie N. Parragh; Karl F. Doerner; Richard F. Hartl; Xavier Gandibleux 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB

Analysis of a Local Search Heuristic for

Analysis of a Local Search Heuristic for Facility Location Problems

✍ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati

Note: A local-search heuristic for large

Note: A local-search heuristic for large set-covering problems

✍ Larry W. Jacobs; Michael J. Brusco 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB