A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
From MaRDI portal
Publication:2630092
DOI10.1016/j.ejor.2014.10.010zbMath1341.90018OpenAlexW2021621713MaRDI QIDQ2630092
Osman Kulak, Can B. Kalayci, Olcay Polat, Hans-Otto Günther
Publication date: 25 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.10.010
meta-heuristicsperturbation based neighborhood searchvehicle routing with simultaneous pickup and delivery
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (21)
Collection of different types of milk with multi-tank tankers under uncertainty: a real case study ⋮ A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains ⋮ Modelling and solving the milk collection problem with realistic constraints ⋮ Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands ⋮ Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Heterogeneous instant delivery orders scheduling and routing problem ⋮ A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey ⋮ A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm ⋮ The multi-vehicle probabilistic covering tour problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm ⋮ A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem ⋮ Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery
Uses Software
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- 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
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- Variable neighbourhood search: methods and applications
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Variable neighborhood search
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- 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
- A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
- A Method for Solving Traveling-Salesman Problems
- Vehicle routing problem with simultaneous deliveries and pickups
- Computer Solutions of the Traveling Salesman Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
