General solutions to the single vehicle routing problem with pickups and deliveries
From MaRDI portal
Publication:869591
DOI10.1016/j.ejor.2006.05.009zbMath1124.90027OpenAlexW2090118375MaRDI QIDQ869591
Øyvind sen. Halskau, Martin Vlček, Irina Gribkovskaia, Gilbert Laporte
Publication date: 8 March 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.05.009
Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy, 2-Trees: Structural insights and the study of Hamiltonian paths, A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases, Hamiltonicity in Split Graphs - A Dichotomy, Analysis of the selective traveling salesman problem with time-dependent profits, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, The single vehicle routing problem with deliveries and selective pickups, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, Adaptive large neighborhood search for the commodity constrained split delivery VRP, The paired many-to-many pickup and delivery problem: an application, Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
- The many-to-many location-routing problem
- Heuristics for the traveling salesman problem with pickup and delivery
- The travelling salesman problem with pick-up and delivery
- Future paths for integer programming and links to artificial intelligence
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Vehicle routing problems with simultaneous pick-up and delivery service.
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Solving a vehicle-routing problem arising in soft-drink distribution
- Tabu Search—Part I
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Parallel iterative search methods for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
