Heuristic Algorithms for The Hub Location Routing Problem

Abstract

In this thesis, we propose three algorithms to solve the Hub Location Routing Problem: Simple Local Search, Tabu Search and Neighborhood search with Random Selection. In this problem, the goal is to select a subset of hubs from a set of candidate ones, to construct local routes that start and end at the same hub to serve not-hub nodes and to create an inter-hub route. The objective is to minimize the total transportation cost, including transportation cost of the local routes and the transportation cost of the inter-hubs route. Mainly, the proposed algorithms start with an initial random solution and keep improve it by exploring neighborhood solutions until the stopping criterion is met. The experiments showed that the three proposed methods obtained promising and competitive results comparing to the literature