An efficient metaheuristic for dynamic network design and message routing Online publication date: Tue, 04-Jan-2022
by Robert B. Hartlage; Jeremy D. Jordan
International Journal of Operational Research (IJOR), Vol. 42, No. 4, 2021
Abstract: As information requirements continue to increase, faster algorithms are necessary to effectively and efficiently deliver critical information across the global information grid. Given a list of required message traffic, to include source, destination, size and priority, the idea is to design networks to maximise the delivery of message traffic based on message priority and quality of service, and then route the messages efficiently. Due to the dynamic nature of the problem and the combinatorial explosion in size as new network nodes are added, a quick-running heuristic approach is needed. In this research, a metaheuristic is developed to dynamically design the network based on the projected message traffic requirements and efficiently route the required messages on the network, based on priority, maximising the number of messages successfully delivered and the quality of service of the delivery. The metaheuristic is tested and generates high quality solutions quickly relative to current methods.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook