Title: A genetic algorithm for integrated hub covering-routing problem considering forbidden paths

Authors: Ashkan Ayough; Behrooz Khorshidvand; Fatemeh Adibrad

Addresses: Department of Industrial Management and Information Technology, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran ' Iran Centre for Management Studies (ICMS), Tehran, Iran ' Iran Centre for Management Studies (ICMS), Tehran, Iran

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.

DOI: 10.1504/IJLSM.2022.126014

International Journal of Logistics Systems and Management, 2022 Vol.43 No.2, pp.177 - 192

Received: 30 Apr 2020
Accepted: 09 Jul 2020

Published online: 07 Oct 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article