Asset Details
Do you wish to reserve the book?
Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability
Do you wish to request the book?
Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability
2021
Overview
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.
Publisher
Springer Nature B.V
