Abstract
The paper considers the problem of reducing the complexity of $NP$-hard problems by using related problems for which an optimal or acceptable solution is already known. For multi-agent routing tasks, a technique is used based on network clustering consistent with traveling salesman routes on each cluster and constructing routes that take into account the limitation of delivery time windows. A mathematical model is presented that corresponds to a block of pseudo-Boolean conditional optimization with constraints in the form of disjunctive normal forms that allows polynomial solvability and a block of time constraints. The results of choosing metaheuristics based on related problems are used in a program for the delivery of goods by many agents to consumers located at the vertices of the regional infrastructure road network.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.