An O(N log N) planar travelling salesman heuristic based on spacefilling curves
From MaRDI portal
Publication:1166433
DOI10.1016/0167-6377(82)90012-8zbMath0488.90072OpenAlexW2007147155MaRDI QIDQ1166433
L. K. Platzman, John J. III Bartholdi
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90012-8
Programming involving graphs or networks (90C35) Searching and sorting (68P10) Numerical mathematical programming methods (65K05)
Related Items
Law of large numbers for the drift of the two-dimensional wreath product ⋮ Further results on the probabilistic traveling salesman problem ⋮ Genetically improved presequences for Euclidean traveling salesman problems ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ Routing problems: A bibliography ⋮ The vehicle routing problem with backhauls ⋮ A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls ⋮ Assouad-Nagata dimension and gap for ordered metric spaces ⋮ Spaces that can be ordered effectively: virtually free groups and hyperbolicity ⋮ Hope: A genetic algorithm for the unequal area facility layout problem. ⋮ FACOPT: A user friendly FACility layout OPTimization system. ⋮ An O(N log N) planar travelling salesman heuristic based on spacefilling curves ⋮ Algorithms for the universal and a priori TSP ⋮ The complete set of homogeneous Hilbert curves in two dimensions ⋮ Solving inequalities by α‐dense curves. Application to global optimization ⋮ Routing a Heterogeneous Fleet of Vehicles ⋮ Challenges and Advances in A Priori Routing ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Stochastic vehicle routing ⋮ TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer ⋮ Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
Cites Work
