Biased Random Key Genetic Algorithm with Insertion and Gender Selection for Capacitated Vehicle Routing Problem with Time Windows

被引:2
|
作者
Rochman, Auliya Noor [1 ]
Prasetyo, Hari [2 ]
Nugroho, Munajat Tri [2 ]
机构
[1] Univ Muhammadiyah Surakarta, Dept Ind Engn, Surakarta, Indonesia
[2] Univ Muhammadiyah Surakarta, PUSLOGIN Ctr Logist & Ind Optimizat Studies, Jl Ahmad Yani Tromol Pus 1 Pabelan Kartasura, Sukoharjo, Indonesia
关键词
D O I
10.1063/1.4985470
中图分类号
O59 [应用物理学];
学科分类号
摘要
Vehicle Routing Problem (VRP) often occurs when the manufacturers need to distribute their product to some customers/outlets. The distribution process is typically restricted by the capacity of the vehicle and the working hours at the distributor. This type of VRP is also known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). A Biased Random Key Genetic Algorithm (BRKGA) was designed and coded in MATLAB to solve the CVRPTW case of soft drink distribution. The standard BRKGA was then modified by applying chromosome insertion into the initial population and defining chromosome gender for parent undergoing crossover operation. The performance of the established algorithms was then compared to a heuristic procedure for solving a soft drink distribution. Some findings are revealed (1) the total distribution cost of BRKGA with insertion (BRKGA-I) results in a cost saving of 39% compared to the total cost of heuristic method, (2) BRKGA with the gender selection (BRKGA-GS) could further improve the performance of the heuristic method. However, the BRKGA-GS tends to yield worse results compared to that obtained from the standard BRKGA.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Biased Random Key Genetic Algorithm Design with Multiple Populations to Solve Capacitated Vehicle Routing Problem with Time Windows
    Prasetyo, Hari
    Putri, Anandistya Lisa
    Fauza, Gusti
    [J]. HUMAN-DEDICATED SUSTAINABLE PRODUCT AND PROCESS DESIGN: MATERIALS, RESOURCES, AND ENERGY, 2018, 1977
  • [2] A Memetic Algorithm for the Capacitated Vehicle Routing Problem with Time Windows
    Gonzalez, Oscar M.
    Segura, Carlos
    Ivvan Valdez Pena, S.
    Leon, Coromoto
    [J]. 2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 2582 - 2589
  • [3] An optimization algorithm for a capacitated vehicle routing problem with time windows
    Pinar Kirci
    [J]. Sādhanā, 2016, 41 : 519 - 529
  • [4] An optimization algorithm for a capacitated vehicle routing problem with time windows
    Kirci, Pinar
    [J]. SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2016, 41 (05): : 519 - 529
  • [5] Capacitated Vehicle Routing Problem with Time Windows
    Tanel, Aleyna
    Kinay, Begum
    Karakul, Deniz
    Ozyoruk, Efecan
    Iskifoglu, Elif
    Ozogul, Ezgi
    Ustaoglu, Meryem
    Yuksel, Damla
    Ornek, Mustafa Arslan
    [J]. DIGITIZING PRODUCTION SYSTEMS, ISPR2021, 2022, : 653 - 664
  • [6] Hierarchical tournament selection genetic algorithm for the vehicle routing problem with time windows
    Alvarenga, GB
    Mateus, GR
    [J]. HIS'04: Fourth International Conference on Hybrid Intelligent Systems, Proceedings, 2005, : 410 - 415
  • [7] A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows
    Akeb, Hakim
    Bouchakhchoukha, Adel
    Hifi, Mhand
    [J]. 2013 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2013, : 329 - 336
  • [8] A Parallel Memetic Algorithm to Solve the Capacitated Vehicle Routing Problem with Time Windows
    Gonzalez, Oscar M.
    Segura, Carlos
    Valdez Pena, S. Ivvan
    [J]. INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2018, 9 (01): : 35 - 45
  • [9] Genetic algorithm for batch vehicle routing problem with time windows
    Department of Computer, Guangxi Normal University, Guilin 541004, China
    不详
    [J]. Jisuanji Gongcheng, 2006, 8 (213-215+218):
  • [10] An improved genetic algorithm for vehicle routing problem with time windows
    Ting, CJ
    Huang, CH
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2005, 12 (03): : 218 - 228