Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability

This article considers a biobjective location-routing problem to deliver relief resources to the victims affected by a disaster under uncertainty in demand, transportation infrastructure, and travel time. Since transportation networks are exposed to a considerable level of uncertainty, choosing the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:OR Spectrum 2021-06, Vol.43 (2), p.327-365
Hauptverfasser: Khorsi, Maliheh, Chaharsooghi, Seyed Kamal, Kashan, Ali Husseinzadeh, Bozorgi-Amiri, Ali
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 365
container_issue 2
container_start_page 327
container_title OR Spectrum
container_volume 43
creator Khorsi, Maliheh
Chaharsooghi, Seyed Kamal
Kashan, Ali Husseinzadeh
Bozorgi-Amiri, Ali
description This article considers a biobjective location-routing problem to deliver relief resources to the victims affected by a disaster under uncertainty in demand, transportation infrastructure, and travel time. Since transportation networks are exposed to a considerable level of uncertainty, choosing the reliable path for relief goods to be transmitted to the affected areas ensures the arrival of these supplies. For the first time, route reliability is calculated based on the multistate theory, and the universal generating function technique is used for network reliability assessment. The problem is formulated as a multiperiod robust biobjective mixed-integer programming model. Two objective functions are considered: (a) decreasing the sum of arrival times of relief vehicles at the demand nodes for delivering aids to the affected areas, and (b) increasing the minimum route reliability for all the serving vehicles. A novel multiobjective grouping algorithm is proposed to obtain the Pareto-optimal solutions of the problem. Then, its performance is compared with two other multiobjective grouping algorithms. To evaluate the solution method, the algorithms are implemented on various test problems and compared statistically. A case study is presented to illustrate the potential applicability of our model. Additionally, to determine the effect of the changes in the main parameters of the problem on the value of objective functions, the sensitivity analyses are performed and the managerial insights are given.
doi_str_mv 10.1007/s00291-021-00630-3
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2536113076</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2536113076</sourcerecordid><originalsourceid>FETCH-LOGICAL-c409t-f1951f3a785dd870bca6a401f2fd897779a9cbd36038292f5262cfa91461c46f3</originalsourceid><addsrcrecordid>eNp9kEtLxTAQhYMoeH38AVcB19FJ0ibNUsQXCLrQdchtk95o21yTFPHfG28Fdy6GYZjvnAMHoTMKFxRAXiYApigBVgYEB8L30IpWXJByVPtoBVRSIirRHKKjlN4Aail5s0L52USbA1mbZDvcxzBv_dTj0WZDNnaOPmXfYjP0Ifq8GbELEW_m0Uw-m-jNhKMdvHV4CP0OTfizcHich1xuky2ebP4M8X0HmrUffP46QQfODMme_u5j9Hp783J9Tx6f7h6urx5JW4HKxFFVU8eNbOquaySsWyNMBdQx1zVKSqmMatcdF8AbppirmWCtM4pWgraVcPwYnS--2xg-ZpuyfgtznEqkZjUXlHKQolBsodoYUorW6W30o4lfmoL-aVcv7erSrt61q3kR4UVk2zD59CeRghVCgSwIX5BUnlNv41_6P8bf9PCJ2w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2536113076</pqid></control><display><type>article</type><title>Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Khorsi, Maliheh ; Chaharsooghi, Seyed Kamal ; Kashan, Ali Husseinzadeh ; Bozorgi-Amiri, Ali</creator><creatorcontrib>Khorsi, Maliheh ; Chaharsooghi, Seyed Kamal ; Kashan, Ali Husseinzadeh ; Bozorgi-Amiri, Ali</creatorcontrib><description>This article considers a biobjective location-routing problem to deliver relief resources to the victims affected by a disaster under uncertainty in demand, transportation infrastructure, and travel time. Since transportation networks are exposed to a considerable level of uncertainty, choosing the reliable path for relief goods to be transmitted to the affected areas ensures the arrival of these supplies. For the first time, route reliability is calculated based on the multistate theory, and the universal generating function technique is used for network reliability assessment. The problem is formulated as a multiperiod robust biobjective mixed-integer programming model. Two objective functions are considered: (a) decreasing the sum of arrival times of relief vehicles at the demand nodes for delivering aids to the affected areas, and (b) increasing the minimum route reliability for all the serving vehicles. A novel multiobjective grouping algorithm is proposed to obtain the Pareto-optimal solutions of the problem. Then, its performance is compared with two other multiobjective grouping algorithms. To evaluate the solution method, the algorithms are implemented on various test problems and compared statistically. A case study is presented to illustrate the potential applicability of our model. Additionally, to determine the effect of the changes in the main parameters of the problem on the value of objective functions, the sensitivity analyses are performed and the managerial insights are given.</description><identifier>ISSN: 0171-6468</identifier><identifier>EISSN: 1436-6304</identifier><identifier>DOI: 10.1007/s00291-021-00630-3</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Business and Management ; Calculus of Variations and Optimal Control; Optimization ; Disaster relief ; Heuristic methods ; Integer programming ; Logistics ; Mixed integer ; Network reliability ; Operations Research/Decision Theory ; Original Article ; Parameter sensitivity ; Pareto optimum ; Reliability analysis ; System reliability ; Transportation engineering ; Transportation networks ; Travel time ; Uncertainty</subject><ispartof>OR Spectrum, 2021-06, Vol.43 (2), p.327-365</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c409t-f1951f3a785dd870bca6a401f2fd897779a9cbd36038292f5262cfa91461c46f3</citedby><cites>FETCH-LOGICAL-c409t-f1951f3a785dd870bca6a401f2fd897779a9cbd36038292f5262cfa91461c46f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00291-021-00630-3$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00291-021-00630-3$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,41487,42556,51318</link.rule.ids></links><search><creatorcontrib>Khorsi, Maliheh</creatorcontrib><creatorcontrib>Chaharsooghi, Seyed Kamal</creatorcontrib><creatorcontrib>Kashan, Ali Husseinzadeh</creatorcontrib><creatorcontrib>Bozorgi-Amiri, Ali</creatorcontrib><title>Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability</title><title>OR Spectrum</title><addtitle>OR Spectrum</addtitle><description>This article considers a biobjective location-routing problem to deliver relief resources to the victims affected by a disaster under uncertainty in demand, transportation infrastructure, and travel time. Since transportation networks are exposed to a considerable level of uncertainty, choosing the reliable path for relief goods to be transmitted to the affected areas ensures the arrival of these supplies. For the first time, route reliability is calculated based on the multistate theory, and the universal generating function technique is used for network reliability assessment. The problem is formulated as a multiperiod robust biobjective mixed-integer programming model. Two objective functions are considered: (a) decreasing the sum of arrival times of relief vehicles at the demand nodes for delivering aids to the affected areas, and (b) increasing the minimum route reliability for all the serving vehicles. A novel multiobjective grouping algorithm is proposed to obtain the Pareto-optimal solutions of the problem. Then, its performance is compared with two other multiobjective grouping algorithms. To evaluate the solution method, the algorithms are implemented on various test problems and compared statistically. A case study is presented to illustrate the potential applicability of our model. Additionally, to determine the effect of the changes in the main parameters of the problem on the value of objective functions, the sensitivity analyses are performed and the managerial insights are given.</description><subject>Algorithms</subject><subject>Business and Management</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Disaster relief</subject><subject>Heuristic methods</subject><subject>Integer programming</subject><subject>Logistics</subject><subject>Mixed integer</subject><subject>Network reliability</subject><subject>Operations Research/Decision Theory</subject><subject>Original Article</subject><subject>Parameter sensitivity</subject><subject>Pareto optimum</subject><subject>Reliability analysis</subject><subject>System reliability</subject><subject>Transportation engineering</subject><subject>Transportation networks</subject><subject>Travel time</subject><subject>Uncertainty</subject><issn>0171-6468</issn><issn>1436-6304</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kEtLxTAQhYMoeH38AVcB19FJ0ibNUsQXCLrQdchtk95o21yTFPHfG28Fdy6GYZjvnAMHoTMKFxRAXiYApigBVgYEB8L30IpWXJByVPtoBVRSIirRHKKjlN4Aail5s0L52USbA1mbZDvcxzBv_dTj0WZDNnaOPmXfYjP0Ifq8GbELEW_m0Uw-m-jNhKMdvHV4CP0OTfizcHich1xuky2ebP4M8X0HmrUffP46QQfODMme_u5j9Hp783J9Tx6f7h6urx5JW4HKxFFVU8eNbOquaySsWyNMBdQx1zVKSqmMatcdF8AbppirmWCtM4pWgraVcPwYnS--2xg-ZpuyfgtznEqkZjUXlHKQolBsodoYUorW6W30o4lfmoL-aVcv7erSrt61q3kR4UVk2zD59CeRghVCgSwIX5BUnlNv41_6P8bf9PCJ2w</recordid><startdate>20210601</startdate><enddate>20210601</enddate><creator>Khorsi, Maliheh</creator><creator>Chaharsooghi, Seyed Kamal</creator><creator>Kashan, Ali Husseinzadeh</creator><creator>Bozorgi-Amiri, Ali</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SP</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L7M</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20210601</creationdate><title>Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability</title><author>Khorsi, Maliheh ; Chaharsooghi, Seyed Kamal ; Kashan, Ali Husseinzadeh ; Bozorgi-Amiri, Ali</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c409t-f1951f3a785dd870bca6a401f2fd897779a9cbd36038292f5262cfa91461c46f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Business and Management</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Disaster relief</topic><topic>Heuristic methods</topic><topic>Integer programming</topic><topic>Logistics</topic><topic>Mixed integer</topic><topic>Network reliability</topic><topic>Operations Research/Decision Theory</topic><topic>Original Article</topic><topic>Parameter sensitivity</topic><topic>Pareto optimum</topic><topic>Reliability analysis</topic><topic>System reliability</topic><topic>Transportation engineering</topic><topic>Transportation networks</topic><topic>Travel time</topic><topic>Uncertainty</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Khorsi, Maliheh</creatorcontrib><creatorcontrib>Chaharsooghi, Seyed Kamal</creatorcontrib><creatorcontrib>Kashan, Ali Husseinzadeh</creatorcontrib><creatorcontrib>Bozorgi-Amiri, Ali</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>OR Spectrum</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khorsi, Maliheh</au><au>Chaharsooghi, Seyed Kamal</au><au>Kashan, Ali Husseinzadeh</au><au>Bozorgi-Amiri, Ali</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability</atitle><jtitle>OR Spectrum</jtitle><stitle>OR Spectrum</stitle><date>2021-06-01</date><risdate>2021</risdate><volume>43</volume><issue>2</issue><spage>327</spage><epage>365</epage><pages>327-365</pages><issn>0171-6468</issn><eissn>1436-6304</eissn><abstract>This article considers a biobjective location-routing problem to deliver relief resources to the victims affected by a disaster under uncertainty in demand, transportation infrastructure, and travel time. Since transportation networks are exposed to a considerable level of uncertainty, choosing the reliable path for relief goods to be transmitted to the affected areas ensures the arrival of these supplies. For the first time, route reliability is calculated based on the multistate theory, and the universal generating function technique is used for network reliability assessment. The problem is formulated as a multiperiod robust biobjective mixed-integer programming model. Two objective functions are considered: (a) decreasing the sum of arrival times of relief vehicles at the demand nodes for delivering aids to the affected areas, and (b) increasing the minimum route reliability for all the serving vehicles. A novel multiobjective grouping algorithm is proposed to obtain the Pareto-optimal solutions of the problem. Then, its performance is compared with two other multiobjective grouping algorithms. To evaluate the solution method, the algorithms are implemented on various test problems and compared statistically. A case study is presented to illustrate the potential applicability of our model. Additionally, to determine the effect of the changes in the main parameters of the problem on the value of objective functions, the sensitivity analyses are performed and the managerial insights are given.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00291-021-00630-3</doi><tpages>39</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0171-6468
ispartof OR Spectrum, 2021-06, Vol.43 (2), p.327-365
issn 0171-6468
1436-6304
language eng
recordid cdi_proquest_journals_2536113076
source Business Source Complete; SpringerLink Journals - AutoHoldings
subjects Algorithms
Business and Management
Calculus of Variations and Optimal Control
Optimization
Disaster relief
Heuristic methods
Integer programming
Logistics
Mixed integer
Network reliability
Operations Research/Decision Theory
Original Article
Parameter sensitivity
Pareto optimum
Reliability analysis
System reliability
Transportation engineering
Transportation networks
Travel time
Uncertainty
title Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T08%3A14%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Pareto-based%20grouping%20meta-heuristic%20algorithm%20for%20humanitarian%20relief%20logistics%20with%20multistate%20network%20reliability&rft.jtitle=OR%20Spectrum&rft.au=Khorsi,%20Maliheh&rft.date=2021-06-01&rft.volume=43&rft.issue=2&rft.spage=327&rft.epage=365&rft.pages=327-365&rft.issn=0171-6468&rft.eissn=1436-6304&rft_id=info:doi/10.1007/s00291-021-00630-3&rft_dat=%3Cproquest_cross%3E2536113076%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2536113076&rft_id=info:pmid/&rfr_iscdi=true