A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem

By Reza Tavakkoli-Moghaddam, Hamideh Rostami. 2011

56 citations recorded by the source corpus.

Article history: Received 20 October 2010 Received in revised form 20 December 2010 Accepted 28 December 2010 Available online 28 December 2010 The hub location problem appears in a variety of applications, including airline systems, cargo delivery systems and telecommunication network design. Hub location problems deal with finding the location of hub facilities and the allocation of demand nodes to these located hub facilities. In this paper, a new model for the capacitated single allocation hub covering location problem is presented. Instead of using capacity constraints to limit the amount of flow received by the hubs, the second objective function is introduced to minimize service times in the hubs. The service time in the hubs includes the waiting time of received flows in a queue and the time to get services. Due to the NP-hardness of the problem, a new weight-based multi-objective imperialist competitive algorithm (MOICA) is designed to find near-optimal solutions. To validate the performance of the proposed algorithm, the solutions obtained by the MOICA are compared by the exact solutions of the mathematical programming model. © 2011 Growing Science Ltd. All rights reserved

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management

View Paper: https://www.semanticscholar.org/paper/0157d16039d370c12919c124809fa7d0cc0bf22c