A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity
Yuan Qu; Jonathan F. Bard
| Year of publication: |
2015
|
|---|---|
| Authors: | Qu, Yuan ; Bard, Jonathan F. |
| Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 49.2015, 2, p. 254-270
|
| Subject: | pickup and delivery problem | heterogeneous vehicles | branch and price and cut | configurable vehicle capacity | dial-a-ride problem | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Theorie | Theory | Kapazitätsplanung | Capacity planning | Algorithmus | Algorithm | Logistikunternehmen | Logistics provider |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011287512