An unpaired pickup and delivery vehicle routing problem with multi-visit

Author(s):  
Dongyang Xu ◽  
Kunpeng Li ◽  
Xuxia Zou ◽  
Ling Liu

2019 ◽  
Vol 119 (9) ◽  
pp. 2055-2071 ◽  
Author(s):  
Gaoyuan Qin ◽  
Fengming Tao ◽  
Lixia Li ◽  
Zhenyu Chen

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.



2010 ◽  
Vol 6 (2) ◽  
pp. 435-451 ◽  
Author(s):  
Ming-Yong Lai ◽  
◽  
Chang-Shi Liu ◽  
Xiao-Jiao Tong ◽  
◽  
...  




Author(s):  
Tsukasa Izuno ◽  
Tatsushi Nishi ◽  
Sisi Yin

The pickup and delivery crude oil transportation scheduling problem is to find an optimal assignment of requests to a fleet of tankers, sequence of visiting places, and loading and unloading volume of demand simultaneously in order to minimize the total cost with the capacity of the tankers. The problem can be formulated as a split pickup and delivery vehicle routing problem. We apply a column generation algorithm to solve the problem efficiently. In order to obtain a feasible solution by column generation, we propose an effective algorithm to generate a feasible solution satisfying the set partitioning constraints. Computational results demonstrate the effectiveness of the proposed method.



2021 ◽  
pp. 107412
Author(s):  
Yong Wang ◽  
Qin Li ◽  
Xiangyang Guan ◽  
Jianxin Fan ◽  
Maozeng Xu ◽  
...  


Sign in / Sign up

Export Citation Format

Share Document