:: Volume 8, Issue 1 (4-2017) ::
IJOR 2017, 8(1): 61-77 Back to browse issues page
A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
Nader Ghaffarinasab Dr. , Y. Jabarzadeh Dr., A. Motallebzadeh Mr.
University of Tabriz , ngnasab@tabrizu.ac.ir
Abstract:   (1232 Views)
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader) is operating an existing hub network in a market and an entrant firm (the follower) tries to enter the market by locating its own hubs aiming at capturing as much flow as possible from the leader. The customers choose one firm based on the service level (cost, time, distance, etc.) provided by the firm. We formulate the problem from the entrant firm’s point of view and propose an efficient tabu search based solution algorithm to solve it. Computational experiments show the capability of the proposed solution algorithm to obtain the optimal solutions in short computing times.
Keywords: Hub location, Competitive models, Mathematical formulation, Tabu search.
Full-Text [PDF 797 kb]   (867 Downloads)    
Type of Study: Original | Subject: Production/Inventory
Received: 2018/04/3 | Accepted: 2018/04/3 | Published: 2018/04/3

XML     Print

Volume 8, Issue 1 (4-2017) Back to browse issues page