A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAVADIAN N.; MODARRES S.; BOZORGI A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2017 | Volume:30 | Issue:10 (TRANSACTIONS A: Basics) Page(s): 1526-1537

Download Full-Text

View:

151

Download:

Cites:

Information Journal Paper

Title

A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms

Author(s)

JAVADIAN N. | MODARRES S. | BOZORGI A. | Issue Writer Certificate

Keywords

Lines of Code

Uncertainty

ɛ-constraint Method

Emergency Logistics

Humanitarian Relief Chain

Evolutionary Algorithms

Abstract

Due to the increasing amount of natural disasters such as earthquakes and floods and unnatural disasters such as war and terrorist attacks, Humanitarian Relief Chain (HRC) is taken into consideration of most countries. Besides, this paper aims to contribute Humanitarian Relief Chains under Uncertainty. In this paper, we address a humanitarian logistics network design problem including local distribution centers (LDCs) and multiple central warehouses (CWs) and develop a scenario-based stochastic programming (SBSP) approach. Also, the Uncertainty associated with demand and supply information as well as the availability of the transportation network's routes level after an earthquake are considered by employing stochastic optimization. While the proposed model attempts to minimize the total costs of the relief chain, it implicitly minimize the maximum travel time between each pair of facility and the demand point of the items. Additionally, a data set derived from a real disaster case study in the Iran area, and to solve the proposed model a exact method called ɛ-constraint in low dimension along with some well-known Evolutionary Algorithms are applied. Also, to achieve good performance, the parameters of these algorithms are tuned by using Taguchi method. In addition, the proposed algorithms are compared via four multi-objective metrics and statistically method. Based on the results, it was shown that: NSGA-II shows better performances in terms of SNS and CPU time, meanwhile, for NPS and MID, MRGA has better performances. Finally, some comments for future researches are suggested.

Cites

No record.

References

No record.

Cite

APA: Copy

JAVADIAN, N., MODARRES, S., & BOZORGI, A.. (2017). A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms. INTERNATIONAL JOURNAL OF ENGINEERING, 30(10 (TRANSACTIONS A: Basics)), 1526-1537. SID. https://sid.ir/paper/725158/en

Vancouver: Copy

JAVADIAN N., MODARRES S., BOZORGI A.. A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2017;30(10 (TRANSACTIONS A: Basics)):1526-1537. Available from: https://sid.ir/paper/725158/en

IEEE: Copy

N. JAVADIAN, S. MODARRES, and A. BOZORGI, “A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 30, no. 10 (TRANSACTIONS A: Basics), pp. 1526–1537, 2017, [Online]. Available: https://sid.ir/paper/725158/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops