✦ LIBER ✦

Parallel Savings Based Heuristics for the Delivery Problem

✍ Scribed by Kemal Altinkemer and Bezalel Gavish

Book ID: 123687469
Publisher: INFORMS
Year: 1991
Tongue: English
Weight: 513 KB
Volume: 39
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171399

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics Based on Partial Enumeration

Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem

✍ E. Mokotoff; J.L. Jimeno 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 116 KB

heuristics for parallel machine scheduli

heuristics for parallel machine scheduling with delivery times

✍ Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 568 KB

An Optimization-Based Heuristic for the

An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

✍ Archetti, Claudia; Speranza, M. Grazia; Savelsbergh, Martin W. P. 📂 Article 📅 2008 🏛 INFORMS 🌐 English ⚖ 231 KB

Parallel hybrid heuristics for the permu

Parallel hybrid heuristics for the permutation flow shop problem

✍ Martín Gómez Ravetti, Carlos Riveros, Alexandre Mendes, Mauricio G. C. Resende, 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 585 KB

Double-horizon based heuristics for the

Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows

✍ Snežana Mitrović-Minić; Ramesh Krishnamurti; Gilbert Laporte 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Parallel and serial heuristics for the m

Parallel and serial heuristics for the minimum set cover problem

✍ Sreejit Chakravarty; Ajay Shekhawat 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 695 KB

We present a theoretical analysis and an experimental evaluation of four serial heuristics and four parallel heuristics for the minimum set cover problem. The serial heuristics trade off run time with the quality of the solution. The parallel heuristics are derived from one of the serial heuristics.