Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries

From MaRDI portal
Revision as of 09:56, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:707138

DOI10.1016/j.ejor.2002.11.003zbMath1132.90380OpenAlexW2059810217MaRDI QIDQ707138

Gábor Nagy, Said Salhi

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/9936/1/Nagy%26Salhi_working_paper_PDF.pdf


zbMATH Keywords

HeuristicsVehicle routingMultiple depotsPickups and deliveries


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)


Related Items (49)

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 ⋮ A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ Route planning for a seaplane service: the case of the Greek islands ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Inventory routing with continuous moves ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ A methodology to exploit profit allocation in logistics joint distribution network optimization ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ Variable neighbourhood structures for cycle location problems ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Multi-trip pickup and delivery problem with time windows and synchronization ⋮ Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles ⋮ Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence ⋮ Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing ⋮ A Lagrangian relaxation-based heuristic for the vehicle routing with full container load ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems ⋮ Unnamed Item ⋮ A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries ⋮ Optimization of vehicle routing with pickup based on multibatch production ⋮ Single vehicle routing with a predefined customer sequence and multiple depot returns ⋮ A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery ⋮ Methods for strategic liner shipping network design ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ 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 ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ A local search heuristic for the pre- and end-haulage of intermodal container terminals ⋮ 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 ⋮ Shipper collaboration in forward and reverse logistics ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service ⋮ Heuristic optimization for multi-depot vehicle routing problem in ATM network model ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery


Uses Software


Cites Work


This page was built for publication: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:707138&oldid=12614699"
Powered by MediaWiki