General solutions to the single vehicle routing problem with pickups and deliveries
From MaRDI portal
Publication:869591
DOI10.1016/J.EJOR.2006.05.009zbMATH Open1124.90027OpenAlexW2090118375MaRDI QIDQ869591FDOQ869591
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
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
Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- Solution of a Large-Scale Traveling-Salesman Problem
- The many-to-many location-routing problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Parallel iterative search methods for vehicle routing problems
- The travelling salesman problem with pick-up and delivery
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Title not available (Why is that?)
- Solving a vehicle-routing problem arising in soft-drink distribution
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
- Heuristics for the traveling salesman problem with pickup and delivery
- Vehicle routing problems with simultaneous pick-up and delivery service.
- Title not available (Why is that?)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
Cited In (26)
- 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
- One-to-many-to-one single vehicle pickup and delivery problems
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
- Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain
- A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
- 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
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
- An ILP-based local search procedure for the VRP with pickups and deliveries
- 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
- 2-Trees: Structural insights and the study of Hamiltonian paths
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)
