Determination of optimal path under approach and exit constraints

DOI10.1016/S0377-2217(98)00263-XzbMath0998.90512OpenAlexW2053729728MaRDI QIDQ1847171

Yanyan Li

Publication date: 17 November 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00263-x

zbMATH Keywords

productiontraveling salesmancombinatorial analysisroutingprobabilistic programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Drilling path optimization by the particle swarm optimization algorithm with global convergence characteristics

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Convergence of an annealing algorithm
• Approximate Traveling Salesman Algorithms
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Equation of State Calculations by Fast Computing Machines
• Solution of a Large-Scale Traveling-Salesman Problem
• The Traveling Salesman Problem: A Survey