The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem

DOI10.1016/0377-2217(94)90011-6zbMath0806.90035OpenAlexW2069435696MaRDI QIDQ1331556

G. Brent Hall, Robert L. Bowerman, Paul H. Calamai

Publication date: 19 February 1995

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90011-6

zbMATH Keywords

vehicle routingoptimal partitioningheuristic strategyspacefilling curve

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (3)

A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows ⋮ Routing problems: A bibliography ⋮ A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

Cites Work

• The vehicle routing problem with backhauls
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem