Modeling a novel heuristic model for handling vehicle routing using multiobjective optimization

被引:0
作者
Velusamy, Praveen [1 ]
Periasamy, Keerthika [2 ]
Gurusamy, Sivapriya [3 ]
Kuppusamy, Sangeetha [3 ,4 ]
机构
[1] Bannari Amman Inst Technol, Dept Comp Sci & Engn, Tamil Nadu, Erode, India
[2] Vellore Inst Technol, Sch Comp Sci & Engn, Vellore, India
[3] Kongu Engn Coll, Dept Elect & Commun Engn, Tamil Nadu, Erode, India
[4] Kongu Engn Coll, Dept Comp Sci & Engn, Perundurai, India
关键词
electric vehicles; heuristic model; probabilistic model; rechargeable; stability; time windows; vehicle routing problem; ALGORITHM;
D O I
10.1002/cpe.7694
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Electric vehicles (EVs) are drastically growing, and their emergence is more popular. Moreover, with the constraint driving range, the batteries of these vehicles are rechargeable throughout the routes in various situations. Here, a new problem is formulated with the inclusion of both battery swapping and partial recharging decisions. The energy level and the routing directions are more important, and the investigators intend to handle these issues effectually. However, the major constraint is routing and time window. Here, a heuristic model (LTS-RSS) is designed to find the best matching solution. A novel Random Sub-Space (RSS) and local Tabu search (LTS) are modeled to handle these issues. The probabilistic model of RSS is anticipated by integrating the consequences of time windows and distances. The experimentation is done with an online database and used for performance validation. The outcomes show that the newly modeled (LTS-RSS) approach enhances the significance of the model. The outcomes of all the instances with diverse strategies enhance the model's robustness and stability for resolving these issues. The empirical analysis is done with MATLAB 2020b simulator, and metrics like optimization of routing solution, the best vehicle, best distance, and numbers of vehicles are evaluated, and the outcomes are compared with various other approaches.
引用
收藏
页数:13
相关论文
共 28 条
  • [1] An improved hybrid firefly algorithm for capacitated vehicle routing problem
    Altabeeb, Asma M.
    Mohsen, Abdulqader M.
    Ghallab, Abdullatif
    [J]. APPLIED SOFT COMPUTING, 2019, 84
  • [2] Modified artificial bee colony for the vehicle routing problems with time windows
    Alzaqebah, Malek
    Abdullah, Salwani
    Jawarneh, Sana
    [J]. SPRINGERPLUS, 2016, 5
  • [3] [Anonymous], 2019, International Journal of Innovative Technology and Exploring Engineering (IJITEE), V8, P2278
  • [4] A new tabu search algorithm for the vehicle routing problem with backhauls
    Brandao, J
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) : 540 - 555
  • [5] A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
    Contardo, Claudio
    Martinelli, Rafael
    [J]. DISCRETE OPTIMIZATION, 2014, 12 : 129 - 146
  • [6] An Effective Order-Aware Hybrid Genetic Algorithm for Capacitated Vehicle Routing Problems in Internet of Things
    Lin, Na
    Shi, Yanjun
    Zhang, Tongliang
    Wang, Xuping
    [J]. IEEE ACCESS, 2019, 7 : 86102 - 86114
  • [7] Lu H., 2019, P INT C LEARN REPR N
  • [8] Mishra A., 2017, Sol-gel based nanoceramic materials: Preparation, properties and applications, DOI [10.2118/188407-MS, DOI 10.1007/978-3-319-49512-5, DOI 10.2118/188407-MS]
  • [9] Mishra A., 2017, 7 IEEE INT ADV COMP
  • [10] Mishra A., 2017, INT J CONTROL THEOR, V9, P39