A TIME-DEPENDENT VEHICLE ROUTING PROBLEM SOLVED BY IMPROVED SIMULATED ANNEALING

被引:0
|
作者
Norouzi, Narges [1 ]
Sadegh-Amalnick, Mohsen [1 ]
Tavakkoli-Moghaddam, Reza [1 ]
机构
[1] Univ Tehran, Coll Engn, Sch Ind Engn, Tehran, Iran
关键词
transportation; time dependent vehicle routing problem; improved meta-heuristic; simulated annealing; ANT COLONY SYSTEM; TRAVEL-TIMES; SCHEDULING PROBLEMS; ALGORITHMS; DELIVERY; SEARCH; PICKUP;
D O I
暂无
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In this paper a new multi-objective mathematical model for the vehicle routing problem is presented in which the total travel times and total travel distance are minimized in a time-dependent situation. Moreover, driver satisfaction is maximized based on balancing the distribution of goods in view of the limited vehicle capacities. Since the vehicle routing problems belong to the category of NP-hard problems and exact solutions are not practical in large scales, hence a new method based on the improved simulated annealing algorithm is proposed to obtain efficient solutions with reasonable computational time; and the related results are compared with the particle swarm optimization (PSO) algorithm.
引用
收藏
页码:458 / 465
页数:8
相关论文
共 50 条
  • [41] An Improved Artificial Bee Colony Algorithm for the Capacitated Vehicle Routing Problem with Time-dependent Travel Times
    Ji, Ping
    Wu, Yongzhong
    OPERATIONS RESEARCH AND ITS APPLICATIONS: IN ENGINEERING, TECHNOLOGY AND MANAGEMENT, 2011, 14 : 75 - 82
  • [42] Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows
    Wang, Chao
    Zhao, Fu
    Mu, Dong
    Sutherland, John W.
    ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS, APMS 2013, PT II, 2013, 415 : 170 - 177
  • [43] Simulated Annealing Approach for the Vehicle Routing Problem with Synchronized Visits
    Hadjadj, Seddik
    Kheddouci, Hamamache
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 297 - 303
  • [44] A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem
    Normasari, Nur Mayke Eka
    Yu, Vincent F.
    Bachtiyar, Candra
    Sukoyo
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
  • [45] Vehicle routing problem with cross docking: A simulated annealing approach
    Birim, Sule
    12TH INTERNATIONAL STRATEGIC MANAGEMENT CONFERENCE, ISMC 2016, 2016, 235 : 149 - 158
  • [46] A Simulated Annealing Algorithm for the Vehicle Routing Problem With Parcel Lockers
    Yu, Vincent F.
    Susanto, Hadi
    Jodiawan, Panca
    Ho, Tsai-Wei
    Lin, Shih-Wei
    Huang, Yu-Tsung
    IEEE ACCESS, 2022, 10 : 20764 - 20782
  • [47] SIMULATED ANNEALING WITH TIME-DEPENDENT ENERGY FUNCTION
    FRIGERIO, A
    GRILLO, G
    MATHEMATISCHE ZEITSCHRIFT, 1993, 213 (01) : 97 - 116
  • [48] Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows
    Wang, Yong
    Wei, Zikai
    Luo, Siyu
    Zhou, Jingxin
    Zhen, Lu
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2024, 192
  • [49] A way to optimally solve a green time-dependent vehicle routing problem with time windows
    Iman Kazemian
    Masoud Rabbani
    Hamed Farrokhi-Asl
    Computational and Applied Mathematics, 2018, 37 : 2766 - 2783
  • [50] Correction to the Paper "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows"
    Dabia, Said
    Ropke, Stefan
    van Woensel, Tom
    TRANSPORTATION SCIENCE, 2024, 58 (05)