The choice of algorithms for solving a multi-agent routing problem based on solving related problems

DOI10.35634/vm240309MaRDI QIDQ6646145

V. A. Luk'yanenko, M. G. Kozlova, O. O. Makarov

Publication date: 29 November 2024

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

zbMATH Keywords

metaheuristicstime windowsapplied routing problemmulti-agent traveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-agent systems (93A16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A metric approach for scheduling problems with minimizing the maximum penalty
• Adaptive stability in combinatorial optimization problems
• Homotopy of extremal problems
• Geometry of cuts and metrics
• Models and algorithms for multiagent hierarchical routing with time windows

This page was built for publication: The choice of algorithms for solving a multi-agent routing problem based on solving related problems

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