2013
DOI: 10.5829/idosi.ije.2013.26.06c.06
|View full text |Cite
|
Sign up to set email alerts
|

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 39 publications
0
3
0
Order By: Relevance
“…A variety of are reviewed in articles. Some of the most attractive solving methods are as follows: Tavakkoli-Moghadam et al [16] developed a multiobjective mathematical model for a capacitated single hub location problem to determine the location and the capacity of hub node. The model is solved by a multiobjective imperialist competitive algorithm.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…A variety of are reviewed in articles. Some of the most attractive solving methods are as follows: Tavakkoli-Moghadam et al [16] developed a multiobjective mathematical model for a capacitated single hub location problem to determine the location and the capacity of hub node. The model is solved by a multiobjective imperialist competitive algorithm.…”
Section: Literature Reviewmentioning
confidence: 99%
“…( 1 , 1 , ⋯ , ) = ∑ .1≤ (16) where = ( 1 , ⋯ , ) and ∑ =1 = 1. In order to uniquely determine , we require = ( + ) independent points in Equation (17).…”
Section: Determining the Importance Of Travel Time Travel Cost And Smentioning
confidence: 99%
“…They may appear after the schedule has been prepared, which necessitates corrections. All this makes it difficult to coordinate production in time [1][2][3][4][5].…”
Section: Introductionmentioning
confidence: 99%