Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office

被引:0
|
作者
Ines Sbai
Saoussen Krichen
Olfa Limam
机构
[1] Université de Tunis,Institut Supérieur de Gestion de Tunis, LARODEC Laboratory
[2] Université de Tunis El Manar,Institut Supérieur d’Informatique de Tunis, LARODEC Laboratory
来源
Operational Research | 2022年 / 22卷
关键词
Distribution; Post office routing problem; Genetic algorithm; Variable neighborhood search; Hybrid GA-VNS;
D O I
暂无
中图分类号
学科分类号
摘要
Postal sector has a significant role in promoting and improving the services intended for companies and citizens via its various services and its capacity to provide a communication network which ensures rapidity in collecting, transferring and delivering correspondences, funds and goods across the world. Therefore, optimization of the routing system for collection and transport of letters and parcels constitutes an important component of an effective delivery management system. Generally, postal distribution problems are formulated as a Capacitated vehicle routing problem (CVRP) that consists of designing a set of routes, starting and terminating at a central depot and utilize a set of homogenous vehicles to deliver demands to a set of vertices. The objective is to minimize the total transportation cost. Due to its NP-Hardness, we develop in this paper a hybrid metaheuristic that embeds a Variable Neighborhood Search (VNS) in a Genetic Algorithm (GA) in order to accelerate the convergence of the GA to high quality solutions. This combination aims to take advantage of GA’s strength in the exploration and the VNS’s powerful exploitation of the solution space. We propose to include the VNS in the mutation operator of the GA so that the individual space is enlarged and more diversified. Hence, the hybrid algorithm is able to exploit and explore new regions of the search space. The proposed approach is compared to existing methods while applied on benchmark instances. Empirical results driven on five benchmark datasets with a total of 186 instances show that our proposed approach is very competitive in terms of the obtained solutions. Overall, our experiments illustrated that the Hybrid GA-VNS could be a very efficient method for solving the CVRP and its results are comparable with the results of the state-of-the-art. To operationalize our modeling and solution approach, we considered a real case study: the Tunisian Post Office. Results indicate that the proposed HGA-VNS approach improves considerably the solution regarding the existing methods adopted by the Tunisian Post Office.
引用
收藏
页码:507 / 549
页数:42
相关论文
共 50 条
  • [31] A Proposal of Good Practice in the Formulation and Comparison of Meta-heuristics for Solving Routing Problems
    Osaba, Eneko
    Carballedo, Roberto
    Diaz, Fernando
    Onieva, Enrique
    Perallos, Asier
    INTERNATIONAL JOINT CONFERENCE SOCO'14-CISIS'14-ICEUTE'14, 2014, 299 : 31 - 40
  • [32] Solving the Mask Data Preparation Scheduling Problem Using Meta-Heuristics
    Ying, Kuo-Ching
    Lin, Shih-Wei
    Huang, Chien-Yi
    Liu, Memphis
    Lin, Chia-Tien
    IEEE ACCESS, 2019, 7 : 24192 - 24203
  • [33] A Hybrid Meta-Heuristics for Solving the Design Problem in Wireless Sensor Networks
    Xie, Xie
    Li, Yanping
    Zhou, Huibo
    Zheng, Yongyue
    Li, Xiaoli
    PROCEEDINGS OF 2013 2ND INTERNATIONAL CONFERENCE ON MEASUREMENT, INFORMATION AND CONTROL (ICMIC 2013), VOLS 1 & 2, 2013, : 370 - 374
  • [34] Solving integrated process planning and scheduling problem with constructive meta-heuristics
    Zhang, Luping
    Wong, T. N.
    INFORMATION SCIENCES, 2016, 340 : 1 - 16
  • [35] Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics
    Nekooghadirli, N.
    Tavakkoli-Moghaddam, R.
    Ghezavati, V.R.
    Javanmard, S.
    Computers and Industrial Engineering, 2014, 76 : 204 - 221
  • [36] Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics
    Nekooghadirli, N. (najme.qadiri@gmail.com), 1600, Elsevier Ltd (76):
  • [37] Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
    Khebbache-Hadji, Selma
    Prins, Christian
    Yalaoui, Alice
    Reghioui, Mohamed
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 (02) : 307 - 336
  • [38] Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
    Selma Khebbache-Hadji
    Christian Prins
    Alice Yalaoui
    Mohamed Reghioui
    Central European Journal of Operations Research, 2013, 21 : 307 - 336
  • [39] Combination of nearest neighbor and heuristics algorithms for sequential two dimensional loading capacitated vehicle routing problem
    Sarwono, A. A.
    Ai, T. J.
    Wigati, S. S.
    INDONESIAN OPERATIONS RESEARCH ASSOCIATION (IORA) - INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH 2016, 2017, 166
  • [40] Combining meta-heuristics to effectively solve the vehicle routing problems with time windows
    Tam, V
    Ma, KT
    ARTIFICIAL INTELLIGENCE REVIEW, 2004, 21 (02) : 87 - 112