Heuristic reoptimization of time-extended multi-robot task allocation problems

DOI10.1002/NET.22217MaRDI QIDQ6566561zbMATH OpenFDO

Authors Esther Bischoff, Saskia Kohn, Daniela Hahn, Simon Rothfuß, Sören Hohmann

Publication date 3 July 2024

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/NET.22217

zbMATH Keywords

approximation ratioperformance guaranteesreoptimizationtask deletiontask insertiontime-extended multi-robot task allocation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Reoptimization of NP-Hard Problems
• Complexity and approximation in reoptimization
• Reoptimization in machine scheduling
• Analysis and experimental study of heuristics for job scheduling reoptimization problems
• Multitask n-vehicle exploration problem: complexity and algorithm

Cites work

• A note on the traveling salesman reoptimization problem under vertex insertion
• Approximation hardness of deadline-TSP reoptimization
• Complexity and approximation in reoptimization
• scientific article; zbMATH DE number 5859273 (Why is no real title available?)
• On the Hardness of Reoptimization
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Reoptimization of minimum and maximum traveling salesman's tours
• Reoptimization of the metric deadline TSP
• Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
• Reoptimizing the traveling salesman problem

This page was built for publication: Heuristic reoptimization of time-extended multi-robot task allocation problems

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