A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem
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 pa...
Main Authors: | M. Mohammadi, R. Tavakkoli-Moghaddam, H. Rostami |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2011-01-01
|
Series: | International Journal of Industrial Engineering Computations |
Subjects: | |
Online Access: | http://www.growingscience.com/ijiec/Vol2/IJIEC_2010_46.pdf |
Similar Items
-
Efficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes
by: N. Nekooghadirli, et al.
Published: (2014-07-01) -
Presenting a Model for Locating and Allocating Multi-Period Hubs and Comparing It With a Multi-Objective Imperialist Competitive Algorithm
by: Chen Tzu-Chia, et al.
Published: (2023-09-01) -
A multi-objective robust optimization model for the capacitated P-hub location problem under uncertainty
by: Ahmad Makui, et al.
Published: (2012-04-01) -
Design of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand
by: Firoozeh Kaveh, et al.
Published: (2016-12-01) -
INVESTIGATING THE APPLICABILITY OF THE IMPERIALIST COMPETITIVE ALGORITHM IN THE PROBLEM OF ALLOCATING TRUCKS TO AN OPEN PIT MINE
by: Ali Dabbagh, et al.
Published: (2019-01-01)