Hub Covering Location Problem under Gradual Decay Function

This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not covered. Between these two given service times, the coverage is linear for the routes. A tabu search has been used to solve some problems such as CAB and AP. The quality of solutions obtained using TS have been compared with the achieved one using CPLEX solver. Plenty of experimental study evaluated the performance of the gradual decay function.