Multi-depot vehicle routing problem for large scale disaster relief in drought scenarios: The case of the Brazilian northeast region

Vieira, Yesus Emmanuel Medeiros; Bandeira, Renata Albergaria de Mello; Júnior, Orivalde Soares da Silva

doi:10.1016/j.ijdrr.2021.102193

Cited by 20 publications

(11 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We set the largest serial number node as the destination. We set the moving delay between two areas is uniformly distributed in [10,20]…”

Section: Simulation Setupmentioning

confidence: 99%

“…Multiple space robots set out simultaneously from different starting areas to perform exploration tasks and assemble in a single destination after all areas have been explored. The most similar problem to this paper is the Multi-Depots Vehicle Routing Problem (MD-VRP) [20]. In MD-VRP, multiple vehicles start from different depots, serve a set of customers, and terminate their tours at the depots.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint Task Allocation and Path Planning for Space Robot

Sun

Zhang

et al. 2022

Preprint

View full text Add to dashboard Cite

Space robots have a wide application prospect in the aerospace industry. Due to the limited fuel for the space robots, which cannot support the space robots to run for a long time. In addition, the special working environment makes it impossible to replenish the fuel for the robot at any time. Therefore, a proper path is crucial for the operation of space robots. In order to ensure the operation of space robots, we optimize the allocation of exploration tasks and the selection of space robot paths, jointly. We propose two combination algorithms named Parallel Search and Task Allocation (PS-TA) and Subbranch Insertion and Task Allocation (SI-TA) to optimize the path and the task allocation , intend to obtain the minimum completion latency. We also construct Random Path Planning and Task Allocation (RTA) as the baseline. At last, we provide extensive experiments to demonstrate that proposed algorithms can obtain lower completion latency compared with RTA. Furthermore, SI-TA is more energy-efficient than PS-TA.

show abstract

“…We set the largest serial number node as the destination. We set the moving delay between two areas is uniformly distributed in [10,20]…”

Section: Simulation Setupmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Joint Task Allocation and Path Planning for Space Robot

Sun

Zhang

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The characteristics of spread customer positions, and multiple distribution centers is not only related to the last mile distribution system. Also in the health-care context, especially from the perspective of the design and optimization of emergency logistic systems in the aftermath of a disaster, relevant problems have been often modeled as a multi-depot routing problem [40,43]. Disasters can be devastating to communities and governments, and decision-making, in this customer-centric setting, needs to be quick and efficient since it becomes crucial to plan life-saving relief plans.…”

Section: Introductionmentioning

confidence: 99%

The multi-depot k-traveling repairman problem

et al. 2022

View full text Add to dashboard Cite

In this paper, we study the multi-depot k-traveling repairman problem. This problem extends the traditional traveling repairman problem to the multi-depot case. Its objective, similar to the single depot variant, is the minimization of the sum of the arrival times to customers. We propose two distinct formulations to model the problem, obtained on layered graphs. In order to find feasible solutions for the largest instances, we propose a hybrid genetic algorithm where initial solutions are built using a splitting heuristic and a local search is embedded into the genetic algorithm. The efficiency of the mathematical formulations and of the solution approach are investigated through computational experiments. The proposed models are scalable enough to solve instances up to 240 customers.

show abstract

“…A stochastic VRP team of mobile police units in Brussels is considered such that the team acts on urgent conditions such as accidents, violence, or alarms [ 39 ]. Emergency water trucking (EWT) is an important problem for large-scale water distribution to drought-affected areas [ 47 ]. This problem is modeled as a CVRP.…”

Section: Introductionmentioning

confidence: 99%

“…This problem is modeled as a CVRP. It is solved by a new algorithm that hybridizes ant colony optimization metaheuristic with random variable neighborhood descent (MACS-RVND) [ 47 ]. The biomass supplies logistic problem [ 8 , 9 ] is critical for sustainable development.…”

Section: Introductionmentioning

confidence: 99%

Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period

Altınöz

2022

Neural Comput & Applic

View full text Add to dashboard Cite

This research is based on the capacitated vehicle routing problem with urgency where each vertex corresponds to a medical facility with a urgency level and the traveling vehicle could be contaminated. This contamination is defined as the infectiousness rate, which is defined for each vertex and each vehicle. At each visited vertex, this rate for the vehicle will be increased. Therefore time-total distance it is desired to react to vertex as fast as possible- and infectiousness rate are main issues in the problem. This problem is solved with multiobjective optimization algorithms in this research. As a multiobjective problem, two objectives are defined for this model: the time and the infectiousness, and will be solved using multiobjective optimization algorithms which are nondominated sorting genetic algorithm (NSGAII), grid-based evolutionary algorithm GrEA, hypervolume estimation algorithm HypE, strength Pareto evolutionary algorithm shift-based density estimation SPEA2-SDE, and reference points-based evolutionary algorithm.

show abstract

Multi-depot vehicle routing problem for large scale disaster relief in drought scenarios: The case of the Brazilian northeast region

Cited by 20 publications

References 26 publications

Joint Task Allocation and Path Planning for Space Robot

Joint Task Allocation and Path Planning for Space Robot

The multi-depot k-traveling repairman problem

Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period

Contact Info

Product

Resources

About