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 条
  • [1] Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office
    Sbai, Ines
    Krichen, Saoussen
    Limam, Olfa
    OPERATIONAL RESEARCH, 2022, 22 (01) : 507 - 549
  • [2] Applying hybrid meta-heuristics for capacitated vehicle routing problem
    Lin, Shih-Wei
    Lee, Zne-Jung
    Ying, Kuo-Ching
    Lee, Chou-Yuan
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 1505 - 1512
  • [3] A New Solution Representation to Improve the Performance of Meta-Heuristics for Capacitated Vehicle Routing Problem
    Ahmed, A. K. M. Foysal
    Sun, Ji Ung
    ADVANCED SCIENCE LETTERS, 2017, 23 (10) : 9398 - 9402
  • [4] Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem
    Albert Y. Zomaya
    Daniel Patterson
    Stephan Olariu
    Cluster Computing, 2004, 7 (2) : 123 - 139
  • [5] Forest Vehicle Routing Problem solved by New Insertion and meta-heuristics
    Bagayoko, Moussa
    Dao, Thien-My
    Ateme-Nguema, Barthelemy Hugues
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT (IEOM), 2015,
  • [6] Hybrid Meta-Heuristics for Vehicle Routing Problem with Time Window Constraints
    Chen, James C.
    Hsieh, W. H.
    Cheng, C. H.
    Chen, C. S.
    2009 6TH INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, 2009, : 369 - +
  • [7] Combining Genetic Algorithm with Constructive and Refinement Heuristics for Solving the Capacitated Vehicle Routing Problem
    de Araujo Lima, Stanley Jefferson
    Rocha Santos, Renato Alessandro
    de Araujo, Sidnei Alves
    Triguis Schimit, Pedro Henrique
    ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: INITIATIVES FOR A SUSTAINABLE WORLD, 2016, 488 : 113 - 121
  • [8] A Meta-Genetic Algorithm for Solving the Capacitated Vehicle Routing Problem
    Wink, Stefan
    Back, Thomas
    Emmerich, Michael
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [9] A Decision Support System Based on Hybrid Metaheuristic for Solving the Constrained Capacitated Vehicle Routing Problem: The Tunisian Case
    Harzi, Marwa
    Krichen, Saoussen
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2016, 2016, 9692 : 695 - 704
  • [10] Selecting meta-heuristics for solving vehicle routing problems with time windows via meta-learning
    Gutierrez-Rodriguez, Andres E.
    Conant-Pablos, Santiago E.
    Ortiz-Bayliss, Jose C.
    Terashima-Marin, Hugo
    EXPERT SYSTEMS WITH APPLICATIONS, 2019, 118 : 470 - 481