文章基本信息

标题：A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem
本地全文：下载
作者：Mohammadi, M. ; Mohammadi, M. ; Tavakkoli-Moghaddam, R. 等
期刊名称：International Journal of Industrial Engineering Computations
印刷版ISSN：1923-2926
电子版ISSN：1923-2934
出版年度：2011
卷号：2
期号：3
页码：671-688
DOI：10.5267/j.ijiec.2010.08.003
语种：English
出版社：Growing Science Publishing Company
摘要：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.
关键词：Capacitated single allocation; Hub covering location; Multi-objective problem; Service time