Heuristic sequencing methods for time optimal tracking of nested, open and closed paths

DOI10.1007/s11044-023-09922-8OpenAlexW4384204556MaRDI QIDQ6084144

Matthias Jörgl, Hubert Gattringer, Christian Zauner, Andreas Müller

Publication date: 31 October 2023

Published in: Multibody System Dynamics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11044-023-09922-8

zbMATH Keywords

path planningtraveling salesman problemheuristic schedulinglaser cutting machine

Mathematics Subject Classification ID

Dynamics of multibody systems (70E55)

Cites Work

• Unnamed Item
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Worst-case analysis of a new heuristic for the travelling salesman problem
• Efficient algorithms for finding maximum matching in graphs
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• The point of polygon problem for arbitrary polygons

This page was built for publication: Heuristic sequencing methods for time optimal tracking of nested, open and closed paths