Metaheuristic Algorithms for Multiagent Routing Problems

The problem of modeling real logistics systems arranged in a hierarchical manner is considered. Clusters of lower level consumers are formed that meet the time window (TW) constraints for each consumer and the cluster as a whole. In each such cluster, a traveling salesman’s route is constructed and the vertex closest to the central node, which is the vertex of reloading goods from heavy vehicles (Vs) to light Vs serving consumer clusters, is selected. The transshipment vertices, in turn, are combined into higher level traveling salesmen’s routes, taking into account TWs for routes of this level. The software implementation is tested on well-known networks. The technique is applicable for the synthesis of the central distribution center and system distribution centers of the lower level, as well as for calculating the required number of vehicles (agents).

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Metaheuristic Algorithms for Multiagent Routing Problems

Cited by 2 publications

References 17 publications

Models and Algorithms for Multiagent Hierarchical Routing with Time Windows

Models and Algorithms for Multiagent Hierarchical Routing with Time Windows

Models and Algorithms for Multiagent Hierarchical Routing with Time Windows

Contact Info

Product

Resources

About