Competition and Cooperation in Pickup and Multiple Delivery Problems
From MaRDI portal
Publication:2980177
DOI10.1007/978-3-319-53982-9_9zbMath1360.90035OpenAlexW2588283631MaRDI QIDQ2980177
Martin Robinson, Philip Mourdjis, Fiona Polack, Yu-Jie Chen, Peter I. Cowling
Publication date: 28 April 2017
Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53982-9_9
Uses Software
Cites Work
- Unnamed Item
- A review of recent research on green road freight transportation
- The multiple vehicle pickup and delivery problem with LIFO constraints
- The dynamic multiperiod vehicle routing problem with probabilistic information
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- Dynamic pickup and delivery problems
- The pickup and delivery problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
This page was built for publication: Competition and Cooperation in Pickup and Multiple Delivery Problems