Vehicle routing with a sparse feasibility graph

DOI10.1016/S0377-2217(96)00048-3zbMath0930.90008MaRDI QIDQ1278726

John E. Beasley, Nicos Christofides

Publication date: 22 February 1999

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

zbMATH Keywords

vehicle routingheuristicVoronoiDelaunayfixed routesfeasibility graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (6)

SQBC: an efficient subgraph matching method over large and dense graphs ⋮ Challenges and Advances in A Priori Routing ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Heuristics for the rural postman problem

Uses Software

• OR-Library
• VRP

Cites Work

• A note on two problems in connexion with graphs
• A sweepline algorithm for Voronoi diagrams
• Fixed Routes
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Vehicle routing with a sparse feasibility graph