Competition and cooperation in pickup and multiple delivery problems
From MaRDI portal
Recommendations
Cites work
- 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
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A review of recent research on green road freight transportation
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Dynamic pickup and delivery problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- scientific article; zbMATH DE number 1749228 (Why is no real title available?)
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The dynamic multiperiod vehicle routing problem with probabilistic information
- The multiple vehicle pickup and delivery problem with LIFO constraints
- The pickup and delivery problem with time windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
Cited in
(4)
This page was built for publication: Competition and cooperation in pickup and multiple delivery problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980177)