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
相关论文
共 15 条
[1]   Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem [J].
Abdulkader, Mohamed M. S. ;
Gajpal, Yuvraj ;
ElMekkawy, Tarek Y. .
APPLIED SOFT COMPUTING, 2015, 37 :196-203
[2]  
CHRISTOFIDES N, 1976, REV FR AUTOMAT INFOR, V10, P55
[3]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[4]   A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING [J].
FISHER, ML ;
JAIKUMAR, R .
NETWORKS, 1981, 11 (02) :109-124
[5]   HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM [J].
GILLETT, BE ;
MILLER, LR .
OPERATIONS RESEARCH, 1974, 22 (02) :340-349
[6]  
Hegde Darshan, 2017, INT J MECH ENG TECH, V8, P958
[7]   VEHICLE SCHEDULING PROCEDURE BASED UPON SAVINGS AND A SOLUTION PERTURBATION SCHEME [J].
HOLMES, RA ;
PARKER, RG .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (01) :83-92
[8]   THE VEHICLE-ROUTING PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS [J].
LAPORTE, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 59 (03) :345-358
[9]   A Transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem [J].
Oberlin, Paul ;
Rathinam, Sivakumar ;
Darbha, Swaroop .
2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, :1292-1297
[10]   A Performance Evaluation of GA Algorithm to Solve a VRP Problem with Excess loads for a FMCG Company [J].
Rao, Srinivas T. .
EMERGING TRENDS IN MECHANICAL ENGINEERING 2018, 2019, 2080