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 条
  • [21] Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem
    Ai, The Jin
    Kachitvichyanukul, Voratas
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (01) : 380 - 387
  • [22] Symbiotic organisms search and two solution representations for solving the capacitated vehicle routing problem
    Yu, Vincent F.
    Redi, A. A. N. Perwira
    Yang, Chao-Lung
    Ruskartina, Eki
    Santosa, Budi
    APPLIED SOFT COMPUTING, 2017, 52 : 657 - 672
  • [23] Solving the Electric Capacitated Vehicle Routing Problem with Cargo Weight
    Mavrovouniotis, Michalis
    Li, Changhe
    Ellinas, Georgios
    Polycarpou, Marios
    2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [24] Solving the capacitated vehicle routing problem by cellular ant algorithm
    Geography Department, Dezhou University, Dezhou, Shandong 253023, China
    J. Inf. Comput. Sci., 2012, 8 (2295-2304):
  • [25] Swarm Intelligence in Solving Stochastic Capacitated Vehicle Routing Problem
    Mandziuk, Jacek
    Swiechowski, Maciej
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2017, PT II, 2017, 10246 : 543 - 552
  • [26] A meta-heuristic factory for vehicle routing problems -: Meta-programming for meta-heuristics
    Caseau, Y
    Laburthe, F
    Silverstein, G
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP'99, 1999, 1713 : 144 - 158
  • [27] An Ameliorative Hybrid Algorithm for Solving the Capacitated Vehicle Routing Problem
    Hosseinabadi, Ali Asghar Rahmani
    Slowik, Adam
    Sadeghilalimi, Mehdi
    Farokhzad, Mohammad
    Shareh, Morteza Babazadeh
    Sangaiah, Arun Kumar
    IEEE ACCESS, 2019, 7 : 175454 - 175465
  • [28] Solving Capacitated Time-Dependent Vehicle Routing Problem
    Ribic, Filip
    Erdelic, Tomislav
    Caric, Tonci
    Erdelic, Martina
    CENTRAL EUROPEAN CONFERENCE ON INFORMATION AND INTELLIGENT SYSTEMS, CECIIS 2022, 2022, : 449 - 456
  • [29] A HYBRID SUBGRADIENT METHOD FOR SOLVING THE CAPACITATED VEHICLE ROUTING PROBLEM
    Takan, Melts Alpaslan
    Kasimbeyli, Refail
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2020, 21 (02) : 413 - 423
  • [30] A problem solving environment for combinatorial optimization based on parallel meta-heuristics
    Huang, Rong
    Tong, Shurong
    Sheng, Weihua
    Fan, Zhun
    2007 INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, 2007, : 505 - +