scientific article; zbMATH DE number 432754

MaRDI QIDQ3138882zbMATH OpenFDO

Authors Jon Bentley

Publication date 20 September 1994

zbMATH Keywords

combinatorial optimizationtraveling salesman heuristics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited in

(14)

• An empirical study of a new metaheuristic for the traveling salesman problem
• Not all insertion methods yield constant approximate tours in the Euclidean plane
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• A new extension of local search applied to the Dial-A-Ride problem
• The Euclidean traveling salesman problem and a space-filling curve
• An efficient implementation of a static move descriptor-based local search heuristic
• The multiagent planning problem
• Lexicographically minimizing axial motions for the Euclidean TSP
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs
• Global strategies for augmenting the efficiency of TSP heuristics
• Genetic algorithm for combinatorial path planning: the subtour problem
• Heuristic and exact algorithms for a min-max selective vehicle routing problem
• Parallelization strategies for rollout algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138882)