Abstract
In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.
| Original language | English |
|---|---|
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Number of pages | 23 |
| Publication status | Published - 1994 |
Publication series
| Name | Memorandum COSOR |
|---|---|
| Volume | 9422 |
| ISSN (Print) | 0926-4493 |
Fingerprint
Dive into the research topics of 'A branch-and-price algorithm for the pickup and delivery problem with time windows'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver