Generalised formulations for minimum distance trajectory in patrolling problems

DOI10.1049/IET-CTA.2019.0281zbMATH Open1544.93542MaRDI QIDQ6598761

Jalal Habibi, Amir G. Aghdam, Walaaeldin Ghadiry, Youmin Zhang

Publication date: 5 September 2024

Published in: IET Control Theory \& Applications (Search for Journal in Brave)

zbMATH Keywords

mobile robotstrajectory optimisationtravelling salesman problemsgeneral formulationsgeneralised formulationsminimum distance trajectorymultidepot multiple travelling salesman problempatrolling problemstarting depotstotal travel distance

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• A variable iterated greedy algorithm for the traveling salesman problem with time windows
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Integer linear programming formulations of multiple salesman problems and its variations

This page was built for publication: Generalised formulations for minimum distance trajectory in patrolling problems

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