Vehicle routing problem for humanitarian relief distribution under hybrid uncertainty

Kybernetes ◽  
2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Sara Nodoust ◽  
Mir Saman Pishvaee ◽  
Seyed Mohammad Seyedhosseini
Keyword(s):  
Stochastic Programming ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
Programming Approach ◽  
Routing Problem ◽  
Content Type ◽  
Demand Rate ◽  
Stochastic Programming Model ◽  
Hybrid Uncertainty

PurposeGiven the importance of estimating the demand for relief items in earthquake disaster, this research studies the complex nature of demand uncertainty in a vehicle routing problem in order to distribute first aid relief items in the post disaster phase, where routes are subject to disruption.Design/methodology/approachTo cope with such kind of uncertainty, the demand rate of relief items is considered as a random fuzzy variable and a robust scenario-based possibilistic-stochastic programming model is elaborated. The results are presented and reported on a real case study of earthquake, along with sensitivity analysis through some important parameters.FindingsThe results show that the demand satisfaction level in the proposed model is significantly higher than the traditional scenario-based stochastic programming model.Originality/valueIn reality, in the occurrence of a disaster, demand rate has a mixture nature of objective and subjective and should be represented through possibility and probability theories simultaneously. But so far, in studies related to this domain, demand parameter is not considered in hybrid uncertainty. The worth of considering hybrid uncertainty in this study is clarified by supplementing the contribution with presenting a robust possibilistic programming approach and disruption assumption on roads.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

scholarly journals Multidepot Heterogeneous Vehicle Routing Problem for a Variety of Hazardous Materials with Risk Analysis

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Bochen Wang ◽  
Qiyuan Qian ◽  
Zheyi Tan ◽  
Peng Zhang ◽  
Aizhi Wu ◽  
...  
Keyword(s):  
Risk Analysis ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Programming Model ◽  
Hazardous Materials ◽  
Mixed Integer ◽  
Small Scale ◽  
Routing Problem ◽  
Heterogeneous Vehicle Routing Problem

This study investigates a multidepot heterogeneous vehicle routing problem for a variety of hazardous materials with risk analysis, which is a practical problem in the actual industrial field. The objective of the problem is to design a series of routes that minimize the total cost composed of transportation cost, risk cost, and overtime work cost. Comprehensive consideration of factors such as transportation costs, multiple depots, heterogeneous vehicles, risks, and multiple accident scenarios is involved in our study. The problem is defined as a mixed integer programming model. A bidirectional tuning heuristic algorithm and particle swarm optimization algorithm are developed to solve the problem of different scales of instances. Computational results are competitive such that our algorithm can obtain effective results in small-scale instances and show great efficiency in large-scale instances with 70 customers, 30 vehicles, and 3 types of hazardous materials.

Optimization of the simultaneous pickup and delivery vehicle routing problem based on carbon tax

2019 ◽  
Vol 119 (9) ◽  
pp. 2055-2071 ◽  
Author(s):  
Gaoyuan Qin ◽  
Fengming Tao ◽  
Lixia Li ◽  
Zhenyu Chen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Carbon Tax ◽  
Pickup And Delivery ◽  
Vehicle Speed ◽  
Low Carbon ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Content Type ◽  
Simultaneous Pickup And Delivery

Purpose In order to reduce logistics transportation costs and respond to low-carbon economy, the purpose of this paper is to study the more practical and common simultaneous pickup and delivery vehicle routing problem, which considers the carbon tax policy. A low-carbon simultaneous pickup and delivery vehicle routing problem model is constructed with the minimum total costs as the objective function. Design/methodology/approach This study develops a mathematical optimization model with the minimum total costs, including the carbon emissions costs as the objective function. An adaptive genetic hill-climbing algorithm is designed to solve the model. Findings First, the effectiveness of the algorithm is verified by numerical experiments. Second, the research results prove that carbon tax mechanism can effectively reduce carbon emissions within effective carbon tax interval. Finally, the research results also show that, under the carbon tax mechanism, the effect of vehicle speed on total costs will become more obvious with the increase of carbon tax. Research limitations/implications This paper only considers the weight of the cargo, but it does not consider the volume of the cargo. Originality/value Few studies focus on environmental issues in the simultaneous pickup and delivery problem. Thus, this paper constructs a green path optimization model, combining the carbon tax mechanism for the problem. This paper further analyzes the impact of carbon tax value on total costs and carbon emission; at the same time, the effect of vehicle speed on total cost is also analyzed.

Dynamic vehicle routing problem considering simultaneous dual services in the last mile delivery

Kybernetes ◽  
2019 ◽  
Vol 49 (4) ◽  
pp. 1267-1284 ◽  
Author(s):  
Yandong He ◽  
Xu Wang ◽  
Fuli Zhou ◽  
Yun Lin
Keyword(s):  
Vehicle Routing ◽  
Delivery System ◽  
Vehicle Routing Problem ◽  
Mixed Integer ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Content Type ◽  
Last Mile ◽  
Last Mile Delivery

Purpose This paper aims to study the vehicle routing problem with dynamic customers considering dual service (including home delivery [HD] and customer pickup [CP]) in the last mile delivery in which three decisions have to be made: determine routes that lie along the HD points and CP facilities; optimize routes in real time, which mode is better between simultaneous dual service (SDS, HD points and CP facilities are served simultaneously by the same vehicle); and respective dual service (RDS, HD points and CP facilities are served by different vehicles)? Design/methodology/approach This paper establishes a mixed integer linear programing model for the dynamic vehicle routing problem considering simultaneous dual services (DVRP-SDS). To increase the practical usefulness and solve large instances, the authors designed a two-phase matheuristic including construction-improvement heuristics to solve the deterministic model and dynamic programing to adjust routes to dynamic customers. Findings The computational experiments show that the CP facilities offer greater flexibility for adjusting routes to dynamic customers and that the SDS delivery system outperforms the RDS delivery system in terms of cost and number of vehicles used. Practical implications The results provide managerial insights for express enterprises from the perspective of operation research to make decisions. Originality/value This paper is among the first papers to study the DVRP-SDS. Moreover, this paper guides the managers to select better delivery mode in the last mile delivery.

Sign in / Sign up

Export Citation Format

Share Document