A genetic algorithm for integrated hub covering-routing problem considering forbidden paths Online publication date: Fri, 07-Oct-2022
by Ashkan Ayough; Behrooz Khorshidvand; Fatemeh Adibrad
International Journal of Logistics Systems and Management (IJLSM), Vol. 43, No. 2, 2022
Abstract: In this study, a new mathematical model is provided for the hub covering-routing problem (HCRP) through an extension of the travelling salesman problem (TSP). The objective of HCRP is to minimise the total related costs. This model assumes that if existence nodes are at a certain distance from a given node, they will be covered. The problem is a complete graph, so the seller must enter and leave once on each node. The main decision variables are to determine the tours and how to use the hubs in the way that total cost can be minimised. Since the proposed model is NP-hard, a genetic algorithm (GA) is developed for solving the model in real-world sizes. The results show that the proposed model and solution method are useful for dealing with real-world problems. The computational results show that in large-scale instances, GA solves the problem in a reasonable CPU time where GAMS is unable to find even a feasible solution. The average running time of GA is 62.69 seconds for large scale instances.
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 Logistics Systems and Management (IJLSM):
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