✦ LIBER ✦

New optimality cuts for a single‐vehicle stochastic routing problem

✍ Scribed by C. Hjorring; J. Holt

Book ID: 110380674
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 160 KB
Volume: 86
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018995927636

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new branch-and-cut algorithm for the c

A new branch-and-cut algorithm for the capacitated vehicle routing problem

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB

A new hybrid ant colony optimization alg

A new hybrid ant colony optimization algorithm for the vehicle routing problem

✍ Xiaoxia Zhang; Lixin Tang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 251 KB

This paper presents a novel hybrid ant colony optimization approach called SS\_ACO algorithm to solve the vehicle routing problem. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with scatter search (SS). In our hybrid

A new subtour elimination constraint for

A new subtour elimination constraint for the vehicle routing problem

✍ N.R. Achuthan; L. Caccetta; S.P. Hill 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 747 KB

Single vehicle routing problems with a p

Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands

✍ D.G. Pandelis; E.G. Kyriakidis; T.D. Dimitrakos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A branch-and-price algorithm for the cap

A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

✍ Christian H. Christiansen; Jens Lysgaard 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A branch-and-regret heuristic for stocha

A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems

✍ Lars Magnus Hvattum; Arne Løkketangen; Gilbert Laporte 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB