Multiobjective location-routing problem of relief commodities with reliability

Beiki, Hossein; Seyedhosseini, Seyed Mohammad; Mihardjo, Leonardus W.W.; Seyedaliakbar, Seyed Mohsen

doi:10.1007/s11356-020-11891-w

Cited by 12 publications

(9 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Building upon this foundation, scholars have made substantial progress and refinements to the original LRP model over time. These advancements in location routing for logistics systems involved the incorporation of realistic constraints, including limitations on the number of vehicles (Dukkanci et al, 2019), vehicle capacity (Perl et al, 1984), and time windows (Beiki et al, 2021). Moreover, scholars expanded the scope of objectives to encompass factors such as cost (Leng et al, 2020), carbon emissions (Zhou et al, 2023), and time (Schmidt et al, 2019) within the objective function.…”

Section: Review Of the Literaturementioning

confidence: 99%

Research on location-routing optimization of distribution center for emergency supplies based on IMOCS-LNS hybrid algorithm

Ren,

Meng,

Liu

et al. 2024

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper establishes a location-routing optimization model of the distribution center for emergency supplies with the goals of system reaction time, total cost of consumption, psychological fear of the populace in disaster-affected locations, and material usage rate. Where the excess time, demand, and penalty coefficient are the components of the penalty cost in the total consumption cost, and where the psychological panic of those in the affected area is represented by the psychological perception function of panic developed in accordance with the prospect theory. An improved hybrid multi-objective cuckoo-large-neighborhood search algorithm was then designed to introduce tent mapping, nonlinear inertia weights, elite strategies, congestion operators, and dynamically adjusted discovery probabilities into the standard multi-objective cuckoo optimization algorithm, which generates a new solution using a large-neighborhood search algorithm after discarding part of the solution with the discovery probability, and then accepts the current nondominated solution with dynamic probabilities. The paper uses the improved algorithm to solve Christofides69, an arithmetic example from the standard dataset of the LRP problem, and the results show that the solution provided by the improved algorithm outperforms the solutions provided by the standard multi-objective cuckoo search algorithm and the NSGA-II algorithm in terms of the total cost of dissipation, the level of psychological panic of the people in the affected area, the rate of utilization of the supplies, and the number of distribution centers open. Finally, the improved algorithm was used to analyze cases of different sizes separately, and it was found that the algorithm yielded better results and was therefore able to demonstrate its effectiveness.

show abstract

Section: Review Of the Literaturementioning

confidence: 99%

Research on location-routing optimization of distribution center for emergency supplies based on IMOCS-LNS hybrid algorithm

Ren,

Meng,

Liu

et al. 2024

10.5267/j.ijiec

View full text Add to dashboard Cite

show abstract

“…Their model's objective functions minimized response time, minimized operational costs, and maximized the transportation network's reliability. Eventually, they used ɛ -constraint approach to deal with the multi-objectivity of their proposed model [25]. With multiple trips taken into account for disaster response operations, Maghfiroh and Hanaoka presented a multi-modal relief distribution model using a three-level chain made up of (1) supply nodes, (2) logistics operational areas, and (3) affected areas [26].…”

Section: Related Studiesmentioning

confidence: 99%

An extended version of adaptive large neighborhood search for a relief commodities distribution network design under uncertainty

2022

View full text Add to dashboard Cite

Natural and technology-induced disasters have posed significant threats to human life all around the world and caused many damages and losses so far. The current study addresses a location-routing problem to make an efficient and timely distribution plan in response to a possible earthquake. This problem considers uncertainty in such parameters as demand, access to routes, travel time, and the number of available vehicles. To deal with these uncertainties, stochastic programming (SP) is performed while the objective function is to minimize the time of carrying relief commodities (RCs) to affected areas. The problem is coded in the CPLEX solver to obtain optimal solutions to small-scale problems, and an adaptive large neighborhood search (ALNS) is proposed to solve mixed-integer linear formulas for large-scale problems. To validate the formulation and evaluate the performance of the proposed ALNS, several types of tests are devised. To shows the efficiency of the proposed ALNS, two other metaheuristic algorithms, the Genetic algorithm (GA) and simulated annealing algorithm (SA), are used as well. The results of the calculations suggest the satisfactory performance of the suggested algorithm and the effectiveness of the model for the desirable delivery of humanitarian aids to affected areas.

show abstract

“…There are several other models and algorithms designed to address resource allocation and site selection problems. Beiki developed a multi-objective mixed integer model for the location-path problem of medical relief during a disaster [16], with the objectives of minimizing response time, minimizing operational costs, and maximizing the reliability of the transportation network. The variable neighborhood search heuristic algorithm has been utilized to solve the central problem model for emergency warehouse location, taking into account constraints such as economic conditions, traffic conditions, and population distribution [17].…”

Section: Introductionmentioning

confidence: 99%

Research on the Deployment of Professional Rescue Ships for Maritime Traffic Safety under Limited Conditions

Shao,

Wu,

et al. 2024

JMSE

View full text Add to dashboard Cite

This paper focuses on optimizing the deployment plan for standby points of professional rescue vessels based on the data of maritime incidents in the Beihai area of China. The primary objective is to achieve multi-level and multiple coverage of the jurisdictional waters of the Beihai Rescue Bureau. Models including the coverage quality of the jurisdictional waters, the coverage quality in high-risk areas, the maximum coverage of jurisdictional areas, and the maximum coverage of high-risk areas are constructed and solved using 0–1 integer programming. The optimal plan for eight standby points and their corresponding deployment plans for rescue vessels are obtained. A comparison with the current site selection plan of the Beihai Rescue Bureau validates the superiority of the proposed deployment plan for rescue vessel standby points in this paper.

show abstract

Multiobjective location-routing problem of relief commodities with reliability

Cited by 12 publications

References 47 publications

Research on location-routing optimization of distribution center for emergency supplies based on IMOCS-LNS hybrid algorithm

Research on location-routing optimization of distribution center for emergency supplies based on IMOCS-LNS hybrid algorithm

An extended version of adaptive large neighborhood search for a relief commodities distribution network design under uncertainty

Research on the Deployment of Professional Rescue Ships for Maritime Traffic Safety under Limited Conditions

Contact Info

Product

Resources

About