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 条
  • [1] Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem
    Liu, Xiaojun
    Zhang, Bin
    Du, Fangying
    [J]. 2014 SEVENTH INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION (CSO), 2014, : 177 - 180
  • [2] Modified Simulated Annealing Hybrid Algorithm to Solve the Traveling Salesman Problem
    Chandomi-Castellanos, Eduardo
    Escobar-Gomez, Elias N.
    Aguilar Marroquin-Cano, Sergio F.
    Hernandez-de-Leon, Hector R.
    Velazquez-Trujillo, Sabino
    Sarmiento-Torres, Jorge A.
    de-Coss-Perez, Carlos, V
    [J]. 2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1536 - 1541
  • [3] A New Hybrid Genetic and Simulated Annealing Algorithm to Solve the Traveling Salesman Problem
    Elhaddad, Younis
    Sallabi, Omar
    [J]. WORLD CONGRESS ON ENGINEERING, WCE 2010, VOL I, 2010, : 11 - 14
  • [4] A new approach to solve the traveling salesman problem
    Siqueira, Paulo Henrique
    Arns Steiner, Maria Teresinha
    Scheer, Sergio
    [J]. NEUROCOMPUTING, 2007, 70 (4-6) : 1013 - 1021
  • [5] A DISTRIBUTED IMPLEMENTATION OF SIMULATED ANNEALING FOR THE TRAVELING SALESMAN PROBLEM
    ALLWRIGHT, JRA
    CARPENTER, DB
    [J]. PARALLEL COMPUTING, 1989, 10 (03) : 335 - 338
  • [6] Simulated annealing algorithm for the solution of the traveling salesman problem
    Misevicius, Alfonsas
    [J]. INFORMATION TECHNOLOGIES' 2008, PROCEEDINGS, 2008, : 19 - 24
  • [7] An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem
    Wang, Zicheng
    Geng, Xiutang
    Shao, Zehui
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2009, 6 (07) : 1680 - 1686
  • [8] THE TRAVELING SALESMAN PROBLEM ON A DILUTE LATTICE - A SIMULATED ANNEALING STUDY
    GHOSH, M
    MANNA, SS
    CHAKRABARTI, BK
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1988, 21 (06): : 1483 - 1486
  • [9] A simulated annealing heuristic for the online symmetric traveling salesman problem
    Shirdel, G. H.
    Abdolhosseinzadeh, M.
    [J]. JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (06): : 1283 - 1296
  • [10] A Simulated Annealing-Based Algorithm for Traveling Salesman Problem
    郭茂祖
    陈彬
    洪家荣
    [J]. Journal of Harbin Institute of Technology(New series), 1997, (04) : 35 - 38