Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
From MaRDI portal
Publication:3780762
DOI10.1287/mnsc.34.3.291zbMath0639.90068OpenAlexW2025841116MaRDI QIDQ3780762
John J. III Bartholdi, L. K. Platzman
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.3.291
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, Vertex-labeling algorithms for the Hilbert spacefilling curve, A projection method for \(l_ p\) norm location-allocation problems, Genetically improved presequences for Euclidean traveling salesman problems, A comparison of \(p\)-dispersion heuristics, Novel concave hull-based heuristic algorithm for TSP, Routing problems: A bibliography, The vehicle routing problem with backhauls, Two queues with non-stochastic arrivals, Cost of sequential connection for points in space, A hybrid scatter search for the probabilistic traveling salesman problem, The traveling salesman problem with flexible coloring, Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem, On the long edges in the shortest tour through \(n\) random points, Sorting methods and convergence rates for Array-RQMC: some empirical comparisons, On solving unreliable planar location problems, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands, A new method of estimation of the box-counting dimension of multivariate objects using space-filling curves, Efficacy of spacefilling heuristics in Euclidean combinatorial optimization, Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem, Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study, A comparison of heuristics for the problem of batching orders for warehouse selection, Heuristic solutions to multi-depot location-routing problems
