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

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 war...

Full description

Saved in:
Bibliographic Details
Main Author: Srinivas Rao, T.
Format: Conference Proceeding
Language:English
Subjects:
FMCG
MNTP
MTSP
TSP
VRP
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2214-7853
2214-7853
DOI:10.1016/j.matpr.2020.10.384