 A genetic algorithm for integrated hub covering-routing problem considering forbidden pathsAshkan Ayough, Behrooz Khorshidvand and Fatemeh Adibrad International Journal of Logistics Systems and Management, 2022, vol. 43, issue 2, 177-192 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. Keywords: hub covering problem; HCP; travelling salesman problem; forbidden paths; GA. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:43:y:2022:i:2:p:177-192 Access Statistics for this article More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.