A Multi-Objective Imperialist Competitive Algorithm to Solve a New Multi-Modal Tree Hub Location Problem

被引：0

作者：

Tavakkoli-Moghaddam, Reza ^{[1
,2
]}

Sedehzadeh, Samaneh ^{[3
]}

机构：

[1] Univ Tehran, Sch Ind Engn, Tehran, Iran

[2] Univ Tehran, Res Inst Energy Management & Planning, Coll Engn, Tehran, Iran

[3] Islamic Azad Univ, South Tehran Branch, Sch Ind Engn, Tehran, Iran

来源：

2014 SIXTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC) | 2014年

关键词：

tree hub location; transportation mode; multi-objective optimization; imperialist competitive algorithm;

D O I：

暂无

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

A hub location problem is a main group of the transportation network, which is utilized as a connecting and switching point for demand between origins and destinations. Recently, a tree hub location problem has been introduced as an incomplete hub network with single assignment, in which hubs are connected by means of a tree. This paper presents a new bi-objective, multi-modal tree hub location problem with different capacity levels. Besides the location and allocation decisions in tree hub network, this model decides on transportation modes and capacity levels such that the total transportation cost and time are minimized. Additionally, a multi-objective imperialist competitive algorithm (MOICA) is proposed to solve the presented model and obtain Pareto-optimal solutions of the given problem. Finally, the performance of this algorithm is compared with a non-dominated sorting genetic algorithm (NSGA-II).

引用

页码：202 / 207

页数：6

共 50 条

[21] An improved multi-objective imperialist competitive algorithm for surgical case scheduling problem with switching and preparation times
Yu, Hui
Li, Jun-qing
Chen, Xiao-long
Niu, Wei
Sang, Hong-yan
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2022, 25 (05): : 3591 - 3616
[22] The Imperialist Competitive Algorithm for Optimal Multi-Objective Location and Sizing of DSTATCOM in Distribution Systems Considering Loads Uncertainty
Mostafa Sedighizadeh
Amir Eisapour-Moarref
INAE Letters, 2017, 2 (3): : 83 - 95
[23] Parallel Multi-objective Memetic Algorithm for Competitive Facility Location
Lancinskas, Algirdas
Zilinskas, Julius
PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2013), PT II, 2014, 8385 : 354 - 363
[24] A Decomposition-based Hybrid Evolutionary Algorithm for Multi-modal Multi-objective Optimization
Peng, Yiming
Ishibuchi, Hisao
2021 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2021, : 160 - 167
[25] New Imperialist Competitive Algorithm to solve the travelling salesman problem
Yousefikhoshbakht, Majid
Sedighpour, Mohammad
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (07) : 1495 - 1505
[26] Multi-objective Flexible Job Shop Scheduling Problem with Energy Consumption Constraint Using Imperialist Competitive Algorithm
Guo, Chengzhi
Lei, Deming
INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I, 2018, 10954 : 659 - 669
[27] Application of Imperialist Competitive Algorithm with its Enhanced Approaches for Multi-objective Optimal Reactive Power Dispatch Problem
Chen, Gonggui
Cao, Jia
Zhang, Zhizhong
Sun, Zhi
ENGINEERING LETTERS, 2019, 27 (03) : 579 - 592
[28] Multi-Modal Summary Generation using Multi-Objective Optimization
Jangra, Anubhav
Saha, Sriparna
Jatowt, Adam
Hasanuzzaman, Mohammad
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, : 1745 - 1748
[29] An imperialist competitive algorithm for multi-objective U-type assembly line design
Nourmohammadi, A.
Zandieh, M.
Tavakkoli-Moghaddam, R.
JOURNAL OF COMPUTATIONAL SCIENCE, 2013, 4 (05) : 393 - 400
[30] A new modified bat algorithm to solve optimal management of multi-objective reconfiguration problem
Golmaryami, Marjan
Saleh, Sadreddin
Ardekani, Abbas Bahaodini
Kavousi-Fard, Farzaneh
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2014, 27 (03) : 1567 - 1573

← 1 2 3 4 5 →