Name
Title | ||
|---|---|---|
Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem. |
Abstract | ||
|---|---|---|
•We model a novel Profit-Maximizing Pickup and Delivery Selection Problem (PPDSP).•PPDSP is solved optimally by our graph search, which is faster than GUROBI.•We identify factors that influence computation time and optimal profit of PPDSP.•We develop two efficient heuristics: a randomized search and a greedy heuristic.•Homogeneous fleets are modeled as Maximum Set Packing for faster optimization. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2016.10.010 | European Journal of Operational Research |
Keywords | Field | DocType |
Decision support systems,Transportation,Logistics,Branch and bound,Heuristics | Graph,Mathematical optimization,Branch and bound,Heuristic,Decision support system,Greedy algorithm,Heuristics,Set packing,Pickup,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
259 | 1 | 0377-2217 |
Citations | PageRank | References |
3 | 0.39 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoqiu Qiu | 1 | 5 | 1.43 |
| Stefan Feuerriegel | 2 | 219 | 31.91 |
| Dirk Neumann | 3 | 294 | 37.29 |