General solutions to the single vehicle routing problem with pickups and deliveries

DOI10.1016/J.EJOR.2006.05.009MaRDI QIDQ869591zbMATH OpenOpenAlexFDO

Authors Irina Gribkovskaia, Øyvind sen. Halskau, G. Laporte, Martin Vlček

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

zbMATH Keywords

heuristicscombinatorial optimizationmetaheuristicstabu search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• The single vehicle routing problem with deliveries and selective pickups
• Non-elementary formulations for single vehicle routing problems with pickups and deliveries
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• One-to-many-to-one single vehicle pickup and delivery problems

Cites work

• scientific article; zbMATH DE number 1816805 (Why is no real title available?)
• scientific article; zbMATH DE number 2144502 (Why is no real title available?)
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A unified tabu search heuristic for vehicle routing problems with time windows
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
• Future paths for integer programming and links to artificial intelligence
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Heuristics for the traveling salesman problem with pickup and delivery
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Parallel iterative search methods for vehicle routing problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving a vehicle-routing problem arising in soft-drink distribution
• Tabu Search—Part I
• The many-to-many location-routing problem
• The travelling salesman problem with pick-up and delivery
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
• Vehicle routing problems with simultaneous pick-up and delivery service.

Cited in

(26)

• 2-Trees: Structural insights and the study of Hamiltonian paths
• Adaptive large neighborhood search for the commodity constrained split delivery VRP
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• Models for the single-vehicle preemptive pickup and delivery problem
• Hamiltonicity in Split Graphs - A Dichotomy
• A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
• The vehicle routing problem with pickups and deliveries on some special graphs
• Non-elementary formulations for single vehicle routing problems with pickups and deliveries
• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
• One-to-many-to-one single vehicle pickup and delivery problems
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
• Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Single-commodity vehicle routing problem with pickup and delivery service
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• An ILP-based local search procedure for the VRP with pickups and deliveries
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Analysis of the selective traveling salesman problem with time-dependent profits
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
• The single vehicle routing problem with deliveries and selective pickups
• The paired many-to-many pickup and delivery problem: an application

This page was built for publication: General solutions to the single vehicle routing problem with pickups and deliveries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869591)