A simulated annealing approach to solve a multi traveling salesman problem in a FMCG company

被引:6
|
作者
Rao, T. Srinivas [1 ]
机构
[1] Amrita Vishwa Vidyapeetham, Dept Mech Engn, Amrita Sch Engn, Bengaluru, India
关键词
FMCG; VRP; TSP; MTSP; MNTP; VEHICLE-ROUTING PROBLEM; ALGORITHM; DEPOT;
D O I
10.1016/j.matpr.2020.10.384
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
FMCG Companies are fast spreading across the globe and there is a huge need for efficient delivery of goods to the consumers. In the normal context the regular vehicle routing problem was defined for various cities but within a city there is a need for multiple vehicular movements with different warehouse hubs to facilitate the delivery of goods. Often such problems are defined as hub and spoke mechanism. The hub may be defined as the central resource station from which the various goods will originate and spoke represents the various destination to reach out the customers. In this paper we have used simulated annealing approach to design a Multi traveling sales man problem. (c) 2020 Elsevier Ltd. Selection and peer-review under responsibility of the scientific committee of the International Conference on Advances in Materials and Manufacturing Applications.
引用
收藏
页码:4971 / 4974
页数:4
相关论文
共 50 条
  • [21] A simulated annealing approach to the traveling tournament problem
    A. Anagnostopoulos
    L. Michel
    P. Van Hentenryck
    Y. Vergados
    [J]. Journal of Scheduling, 2006, 9 : 177 - 193
  • [22] A simulated annealing approach to the traveling tournament problem
    Anagnostopoulos, A
    Michel, L
    Van Hentenryck, P
    Vergados, Y
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (02) : 177 - 193
  • [23] A Multi-objective Iterated Local Search Approach to Solve the Insular Traveling Salesman Problem
    Rodriguez-Zbinden, Sebastian
    Montero, Elizabeth
    Blazquez, Carola
    Miranda, Pablo
    [J]. 2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 2339 - 2346
  • [24] A hierarchic approach based on swarm intelligence to solve the traveling salesman problem
    Gunduz, Mesut
    Kiran, Mustafa Servet
    Ozceylan, Eren
    [J]. TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2015, 23 (01) : 103 - 117
  • [25] SMART ANTS SOLVE TRAVELING SALESMAN PROBLEM
    ARTHUR, C
    [J]. NEW SCIENTIST, 1994, 142 (1928) : 6 - 6
  • [26] GatedGCN with GraphSage to Solve Traveling Salesman Problem
    Yang, Hua
    [J]. ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING, ICANN 2023, PT IV, 2023, 14257 : 377 - 387
  • [27] Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem
    Cherabli, Meriem
    Ourbih-Tari, Megdouda
    Boubalou, Meriem
    [J]. MONTE CARLO METHODS AND APPLICATIONS, 2022, 28 (02): : 175 - 188
  • [28] Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem
    Hasegawa, M.
    [J]. PHYSICAL REVIEW E, 2011, 83 (03)
  • [29] A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem
    Dong, Xueshi
    Lin, Qing
    Shen, Fanfan
    Guo, Qingteng
    Li, Qingshun
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2023, 83
  • [30] Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing - tabu search algorithm to solve the symmetrical traveling salesman problem
    Lin, Yu
    Bian, Zheyong
    Liu, Xiang
    [J]. APPLIED SOFT COMPUTING, 2016, 49 : 937 - 952