scholarly journals Bi-Objective Optimization for Vehicle Routing Problems with a Mixed Fleet of Conventional and Electric Vehicles and Soft Time Windows

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Peixin Zhao ◽  
Fanfan Liu ◽  
Yuanyuan Guo ◽  
Xiaoyang Duan ◽  
Yunshu Zhang

With the growing interest in environmental protection and congestion, electric vehicles are increasingly becoming the important transportation means. However, electric vehicles currently face several adoption barriers including high purchasing price and limited travelling range, so the fleets where electric vehicles and conventional vehicles coexist are closer to the current fleet management status. Considering the impact of charging facilities and carbon emission, this paper proposes a vehicle routing problem with a mixed fleet of conventional and electric vehicles and soft time windows. A bi-objective programming model is established to minimize total operational cost and time penalty cost. Finally, the nondominated sorting genetic algorithm II (NSGA-II) is employed to deal with this problem. Furthermore, single-objective optimization is carried out for the two objectives, respectively, and the linear weighting method is also used to solve the problem. Through the contrast of these results and the NSGA-II results, the effectiveness of the algorithm in this paper is further verified. The results indicate that two objectives are contradictory to some extent and decision-makers need a trade-off between two objectives.

2021 ◽  
Vol 15 (4/5) ◽  
pp. 444
Author(s):  
Zhenping Li ◽  
Guohua Wu ◽  
Ke Zhang ◽  
Shuxuan Li ◽  
Chenglin Xiao ◽  
...  

2014 ◽  
Vol 1061-1062 ◽  
pp. 1108-1117
Author(s):  
Ya Lian Tang ◽  
Yan Guang Cai ◽  
Qi Jiang Yang

Aiming at vehicle routing problem (VRP) with many extended features is widely used in actual life, multi-depot heterogeneous vehicle routing problem with soft time windows (MDHIVRPSTW) mathematical model is established. An improved ant colony optimization (IACO) is proposed for solving this model. Firstly, MDHIVRPSTW was transferred into different groups according to nearest depot method, then constructing the initial route by scanning algorithm (SA). Secondly, genetic operators were introduced, and then adjusting crossover probability and mutation probability adaptively in order to improve the global search ability of the algorithm. Moreover, smooth mechanism was used to improve the performance of ant colony optimization (ACO). Finally, 3-opt strategy was used to improve the local search ability. The proposed IACO has been tested on a 32-customer instance which was generated randomly. The experimental results show that IACO is superior to other three algorithms in terms of convergence speed and solution quality, thus the proposed method is effective and feasible, and the proposed model is better than conventional model.


Sign in / Sign up

Export Citation Format

Share Document