A generalized exchange heuristic for the capacitated vehicle routing problem

DOI10.1080/00207729408949321zbMath0819.90031OpenAlexW2135298308MaRDI QIDQ4697853

Farid Harche, Parthasarathi Raghavan

Publication date: 5 September 1995

Published in: International Journal of Systems Science (Search for Journal in Brave)

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

zbMATH Keywords

vehicle routingtotal distancecentral depotgeneralized edge-exchange search procedures

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A TSSP+1 decomposition strategy for the vehicle routing problem ⋮ A mathematical framework for critical transitions: normal forms, variance and applications ⋮ A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem

Cites Work

• Unnamed Item
• A Lagrangean relaxation heuristic for vehicle routing
• Polyhedral study of the capacitated vehicle routing problem
• Fast algorithms for bin packing
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Optimal Routing under Capacity and Distance Restrictions
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A generalized exchange heuristic for the capacitated vehicle routing problem