Tour splitting algorithms for vehicle routing problems

DOI10.1080/00207540802426599zbMath1231.90388OpenAlexW1963643500MaRDI QIDQ3114307

Mohamed Reghioui, Christian Prins, Nacima Labadi

Publication date: 4 February 2012

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802426599

zbMATH Keywords

vehicle routing problemiterated local searchcapacitated arc routing problemgreedy randomized adaptive search procedureroute-first cluster-second heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

An efficiency-based path-scanning heuristic for the capacitated arc routing problem, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, Solving the multi-vehicle multi-covering tour problem, Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs, The commodity-split multi-compartment capacitated arc routing problem, Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, The multi‐purpose K‐drones general routing problem, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem, Recent results on Arc Routing Problems: An annotated bibliography, A memetic algorithm for the multi trip vehicle routing problem, Implicit depot assignments and rotations in vehicle routing heuristics, Industrial and tramp ship routing problems: closing the gap for real-scale instances, Shipper collaboration in forward and reverse logistics, An effective PSO-inspired algorithm for the team orienteering problem

Cites Work

• Competitive memetic algorithms for arc routing problems
• A deterministic tabu search algorithm for the capacitated arc routing problem
• The fleet size and mix problem for capacitated arc routing
• The fleet size and mix vehicle routing problem
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A scatter search for the periodic capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• The Vehicle Routing Problem
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Capacitated arc routing problems
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem