The multi-pickup and delivery problem with time windows
From MaRDI portal
Publication:1744529
DOI10.1016/j.ejor.2018.01.035zbMath1431.90021OpenAlexW2790850281MaRDI QIDQ1744529
Salma Naccache, Jean-François Côté, Leandro C. Coelho
Publication date: 23 April 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.035
Related Items
The pickup and delivery problem with alternative locations and overlapping time windows ⋮ Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach ⋮ Models and algorithms for the delivery and installation routing problem ⋮ A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A hybrid method for the probabilistic maximal covering location-allocation problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Load-dependent and precedence-based models for pickup and delivery problems
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A general heuristic for vehicle routing problems
- An efficient implementation of local search algorithms for constrained routing problems
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- An inexact algorithm for the sequential ordering problem
- Local search procedures for improving feasible solutions to the sequential ordering problem
- On dual based lower bounds for the sequential ordering problem with precedences and due dates
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- The inventory-routing problem with transshipment
- The precedence-constrained asymmetric traveling salesman polytope
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Vehicle Routing
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
