The vehicle routing problem with simultaneous pickup and delivery and handling costs
From MaRDI portal
Publication:2289929
DOI10.1016/j.cor.2019.104858zbMath1458.90101OpenAlexW2991372427MaRDI QIDQ2289929
Leandro C. Coelho, Richard P. Hornstra, Allyson Silva, Kees Jan Roodbergen
Publication date: 27 January 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.rug.nl/en/publications/the-vehicle-routing-problem-with-simultaneous-pickup-and-delivery-and-handling-costs(51eef36e-b80f-49b9-98a9-fa7277efca96).html
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Study on the optimization of urban emergency supplies distribution paths for epidemic outbreaks ⋮ Delivery route optimization with automated vehicle in smart urban environment ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ Unnamed Item ⋮ An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints
Cites Work
- The multiple vehicle pickup and delivery problem with LIFO constraints
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Heuristics for the traveling salesman problem with pickup and delivery
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- Vehicle routing with backhauls: review and research perspectives
- The pickup and delivery traveling salesman problem with handling costs
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: The vehicle routing problem with simultaneous pickup and delivery and handling costs
