𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

✍ Scribed by Christian H. Christiansen; Jens Lysgaard; Sanne Wøhlk

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
966 KB
Volume
37
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-price algorithm for the cap
A branch-and-price algorithm for the capacitated p-median problem
✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We

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

An approximation algorithm for a facilit
An approximation algorithm for a facility location problem with stochastic demands and inventories
✍ A.F. Gabor; J.C.W. van Ommeren 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 176 KB

We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating