CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up

DOI10.1016/j.ejor.2006.01.037zbMath1148.90303MaRDI QIDQ859684

T. T. Narendran, K. Ganesh

Publication date: 16 January 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.01.037

zbMATH Keywords

distribution; clustering; genetic algorithm; vehicle routing problem; logistics

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain, CLOVES, An adaptive large neighborhood search for an E-grocery delivery routing problem, A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure, An algorithm for the capacitated vehicle routing problem with route balancing, Single-commodity vehicle routing problem with pickup and delivery service, Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem, Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots, Optimization problems for machine learning: a survey, Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking, Genetic algorithms in supply chain management: a critical analysis of the literature, A new VRPPD model and a hybrid heuristic solution approach for e-tailing

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• The vehicle routing problem with backhauls
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• The traveling salesman problem with delivery and backhauls
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• Heuristic approaches to vehicle routing with backhauls and time windows
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• On general routing problems
• An Exact Algorithm for the Vehicle Routing Problem with Backhauls
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• Tabu search variants for the mix fleet vehicle routing problem
• The vehicle-routing problem with delivery and back-haul options
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up