Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach

2018 ◽  
Vol 115 ◽  
pp. 1-16 ◽  
Author(s):  
Onder Belgin ◽  
Ismail Karaoglan ◽  
Fulya Altiparmak
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Heuristic Approach ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Simultaneous Pickup And Delivery

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery

2011 ◽  
Vol 39 (5) ◽  
pp. 338-341 ◽  
Author(s):  
Anand Subramanian ◽  
Eduardo Uchoa ◽  
Artur Alves Pessoa ◽  
Luiz Satoru Ochi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Cut ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Simultaneous Pickup And Delivery

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.

Ant Colony Optimisation Model for Vehicle Routing Problem With Simultaneous Pickup and Delivery

2016 ◽  
Author(s):  
Robin Scanlon ◽  
Qing Wang ◽  
Jie Wang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Complex Problem ◽  
Ant Colony ◽  
Benchmark Problems ◽  
Pickup And Delivery ◽  
Ant Colony Optimisation ◽  
Routing Problem ◽  
Route Length ◽  
Simultaneous Pickup And Delivery

Reverse logistics is an area that has come under increased scrutiny in recent years as legislators and companies try to increase the amount of goods that businesses reuse and recycle. The vehicle routing problem with simultaneous pickup and delivery arises when firms want to reduce handling costs by dealing with deliveries and returns in one operation. This is a complex problem for planners who aim to minimise the vehicle route length as the vehicle load rises and falls during a tour of facilities. This paper investigates the use of Ant Colony Optimisation to find solutions to this problem. An algorithm combining elements of three different studies is proposed. The algorithm finds results within 0.2% of the best known results and performs well for half of the benchmark problems, but needs further work to reach the same level on the other half. It is found that the proposed changes can have up to a 3.1% improvement in results when compared to previous methods run on this algorithm.

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

2012 ◽  
Vol 7 (7) ◽  
pp. 1569-1581 ◽  
Author(s):  
Anand Subramanian ◽  
Eduardo Uchoa ◽  
Artur Alves Pessoa ◽  
Luiz Satoru Ochi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Simultaneous Pickup And Delivery ◽  
Branch Cut
Sign in / Sign up

Export Citation Format

Share Document