A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
From MaRDI portal
Publication:3154414
DOI10.1057/palgrave.jors.2600808zbMath1054.90523OpenAlexW4378195500MaRDI QIDQ3154414
Publication date: 13 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600808
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (52)
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 ⋮ Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers ⋮ A survey of variants and extensions of the location-routing problem ⋮ A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ 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 ⋮ AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ A methodology to exploit profit allocation in logistics joint distribution network optimization ⋮ Multiobjective vehicle routing problem with fixed delivery and optional collections ⋮ Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ Variable neighborhood search algorithms for pickup and delivery problems with loading constraints ⋮ New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls ⋮ Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery ⋮ Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries ⋮ Multi-trip pickup and delivery problem with time windows and synchronization ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ A survey of the standard location-routing problem ⋮ A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ 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 ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery ⋮ 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 ⋮ Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries ⋮ Validating vehicle routing zone construction using Monte Carlo simulation ⋮ A new tabu search algorithm for the vehicle routing problem with backhauls ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads ⋮ Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain ⋮ GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery ⋮ 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 ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
This page was built for publication: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
