Name
Title | ||
|---|---|---|
Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. |
Abstract | ||
|---|---|---|
•A new vehicle routing problem is modeled.•This paper solves core sub-problem that appeared in carrier collaboration.•An adaptive large neighborhood search is applied to a vehicle routing problem with profits.•Request selection and routing decision are handled simultaneously by a new mechanism. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ejor.2015.12.032 | European Journal of Operational Research |
Keywords | Field | DocType |
Vehicle routing problem,Pickup and delivery problem,Time window,Profit,Adaptive large neighborhood search | Vehicle routing problem,Mathematical optimization,CPU time,Combinatorial auction,Linear programming,Operator (computer programming),Solver,Local search (optimization),Pickup,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
252 | 1 | 0377-2217 |
Citations | PageRank | References |
11 | 0.48 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuan Li | 1 | 11 | 0.48 |
| Haoxun Chen | 2 | 773 | 60.23 |
| C. Prins | 3 | 227 | 17.02 |