scholarly journals A Study on the Taboo Search Algorithm for the Open Vehicle Routing Problem with Hard Time Windows

Author(s):  
Shuxia Wang ◽  
Ying Xiong ◽  
Zengqiang Wang
2016 ◽  
Vol 29 (10) ◽  
pp. 955-968 ◽  
Author(s):  
Ali Asghar Rahmani Hosseinabadi ◽  
Javad Vahidi ◽  
Valentina Emilia Balas ◽  
Seyed Saeid Mirkamali

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Yunyun Niu ◽  
Zehua Yang ◽  
Ping Chen ◽  
Jianhua Xiao

Outsourcing logistics operation to third-party logistics has attracted more attention in the past several years. However, very few papers analyzed fuel consumption model in the context of outsourcing logistics. This problem involves more complexity than traditional open vehicle routing problem (OVRP), because the calculation of fuel emissions depends on many factors, such as the speed of vehicles, the road angle, the total load, the engine friction, and the engine displacement. Our paper proposed a green open vehicle routing problem (GOVRP) model with fuel consumption constraints for outsourcing logistics operations. Moreover, a hybrid tabu search algorithm was presented to deal with this problem. Experiments were conducted on instances based on realistic road data of Beijing, China, considering that outsourcing logistics plays an increasingly important role in China’s freight transportation. Open routes were compared with closed routes through statistical analysis of the cost components. Compared with closed routes, open routes reduce the total cost by 18.5% with the fuel emissions cost down by nearly 29.1% and the diver cost down by 13.8%. The effect of different vehicle types was also studied. Over all the 60- and 120-node instances, the mean total cost by using the light-duty vehicles is the lowest.


Author(s):  
Ling Shen ◽  
Fengming Tao ◽  
Songyi Wang

In order to cut the costs of third-party logistics companies and respond to the Chinese government’s low-carbon economy plans, this paper studies the more practical and complex open vehicle routing problem, which considers low-carbon trading policies. A low-carbon multi-depot open vehicle routing problem with time windows (MDOVRPTW) model is constructed with minimum total costs, which include the driver’s salary, penalty costs, fuel costs and carbon emissions trading costs. Then, a two-phase algorithm is proposed to handle the model. In the first phase, the initial local solution is obtained with particle swarm optimization (PSO); in the second phase, we can obtain a global optimal solution through a further tabu search (TS). Experiments proved that the proposed algorithm is more suitable for small-scale cases. Furthermore, a series of experiments with different values of carbon prices and carbon quotas are conducted. The results of the study indicate that, as carbon trading prices and carbon quotas change, total costs, carbon emission trading costs and carbon emissions are affected accordingly. Based on these academic results, this paper presents some effective proposals for the government’s carbon trading policy-making and also for logistics companies to have better route planning under carbon emission constraints.


Sign in / Sign up

Export Citation Format

Share Document