A bi-level optimization model for aid distribution after the occurrence of a disaster

Camacho‐Vallejo, José‐Fernando; González-Rodríguez, Edna; Almaguer, F-Javier; González-Ramírez, Rosa G.

doi:10.1016/j.jclepro.2014.09.069

Cited by 100 publications

(59 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To the best of our knowledge, such test problems are not available, thus we will use existing dynamic functions for the upper level and lower level subproblems. 1 Apply exclusion principle; 2 Detect changes in the environment; 3 if not change is detected then 4 for each subpopulation k do 5 Evolve conventional individuals according the steps of differential evolution metaheuristic; In this sense, one suitable candidate is the well-known Moving Peaks Benchmark (MPB) [4], specially the so-called Scenario 2 which offers a multimodal objective function composed of several peaks.…”

Section: Computational Experiments and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Hybrid Approach for Solving Dynamic Bi-level Optimization Problems

Samaniego¹,

Novoa-Hernández²

2018

CyS

View full text Add to dashboard Cite

Several real-life decision scenarios are hierarchical, which are commonly modeled as bi-level optimization problems (BOPs).As other decision scenarios, these problems can be dynamic, that is, some elements of their mathematical model can change over time. This kind of uncertainty imposes an extra level of complexity on the model, since the algorithm needs to find the best bi-level solution over time. Despite the importance of studying these problems, the literature reflects just a few works on dynamic bi-level optimization problems (DBOPs). In this context, this work addresses the solution of DBOPs from the viewpoint of metaheuristic methods. Our hypothesis is that, by hybridizing successful solving approaches from both bi-level and dynamic optimization fields, an effective method for DBOPs can be obtained. In this regard, we propose a hybrid method that combines a coevolutionary approach and a self-adaptive, multipopulation algorithm. Experimental results assert our hypothesis, specially for certain information exchange mechanisms.

show abstract

Section: Computational Experiments and Resultsmentioning

confidence: 99%

“…BOPs have been extensively studied in the past (e.g. location routing problems [19], relief operations after a disaster [5], Stackelberg games [27], engineering problems [14], among others). Even in more simple cases (e.g.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Approach for Solving Dynamic Bi-level Optimization Problems

Samaniego¹,

Novoa-Hernández²

2018

CyS

View full text Add to dashboard Cite

show abstract

“…Additionally, a mathematical model for Bienestarina warehouse evaluation should involve the freight flows allocation between the three echelons in the supply chain. Such characteristic is also common in a facility location and distribution problem, and some examples could be consulted in the studies by Jaimes et al (2011), Camacho-Vallejo et al (2014, and Chaabane and Geramianfar (2015).…”

Section: (Ii) Network Structurementioning

confidence: 99%

Evaluation of a facility location for a food assistance supply chain. The case of Bienestarina in Colombia

et al. 2020

View full text Add to dashboard Cite

The evaluation of the strategic supply chain configuration is considered one of the strategic logistics decisions, especially in food assistance supply chains focused on generating better nutritional conditions in vulnerable populations. In Colombia, there is a social program called Bienestarina, which aims to promote food and nutritional security in a vulnerable population. Although the government supports the program for improving nutritional support, there are currently inconsistencies in freight flows, lack of coverage in some areas, and delivery delays. Therefore, this work aims to evaluate the current configuration of the supply chain and propose improvements related to the facility location. Such advances would enable the increase in the efficacy of the network and the reduction of malnutrition in the country. For this purpose, a mixed-integer mathematical programming model is presented, which considers the weighted distance criterion for different demand scenarios and supports the location-allocation decision in a social assistance supply chain. The current network configuration was compared with the optimal proposed structure. The comparisons show highly potential improvements in freight flow allocation, suggests several variations in the existing warehouses emplacement, and generates public policy implications to reduce the logistic cost in the system, prioritizing in turn the demand covering.

show abstract

“…People put forward higher requirements on the quality of delivery. Logistics and distribution vehicle optimization scheduling problem called vehicle routing problem (VRP) [2]. The problem is defined as: for some established customers, the right vehicle routing is selected.…”

Section: Introductionmentioning

confidence: 99%

Research on Logistics Delivery Model Based on Optimization Algorithm

Yuan¹

2018

Proceedings of the 2017 4th International Conference on Machinery, Materials and Computer (MACMC 2017)

View full text Add to dashboard Cite

Abstract:In order to save the cost of logistics distribution company, the route optimization of logistics distribution vehicle scheduling and the time optimization problem in distribution processing are studied. The workflow of logistics distribution company is mainly divided into four parts: order transportation, warehousing processing, distribution processing and distribution transportation. First of all, the background and current situation of logistics distribution are briefly introduced. Then, the basic algorithm of route optimization in distribution transportation process is summarized. The model of vehicle delivery route optimization based on time window constraint is given. At the same time, the model is verified by saving algorithm, sweeping algorithm and neighbor algorithm. Finally, the advantages and disadvantages of various schemes are compared. The three methods proposed in this paper can save costs in varying degrees. By comparing the three methods, the results show that the saving algorithm is superior.

show abstract

A bi-level optimization model for aid distribution after the occurrence of a disaster

Cited by 100 publications

References 36 publications

A Hybrid Approach for Solving Dynamic Bi-level Optimization Problems

A Hybrid Approach for Solving Dynamic Bi-level Optimization Problems

Evaluation of a facility location for a food assistance supply chain. The case of Bienestarina in Colombia

Research on Logistics Delivery Model Based on Optimization Algorithm

Contact Info

Product

Resources

About