A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (Q3770308): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Traveling Salesman Problem: A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank | |||
Normal rank | |||
Latest revision as of 12:41, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows |
scientific article |
Statements
A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (English)
0 references
1986
0 references
routing
0 references
scheduling
0 references
single-vehicle dial-a-ride problem
0 references
time window constraints
0 references
precedence and capacity constraints
0 references
forward dynamic programming
0 references
