Back close

A simulated annealing and nearest neighborhood approach to solve a vehicle routing problem in a FMCG company

Publication Type : Journal Article

Publisher : Scorpus

Source : International Journal of Mechanical and Production Engineering Research and Development

Url : https://www.scopus.com/record/display.uri?eid=2-s2.0-85042880620&doi=10.24247%2fijmperdapr201838&origin=inward&txGid=d91e0fdb2feb5d5785dba26c335a630f

Campus : Bengaluru

School : School of Engineering

Department : Mechanical

Year : 2018

Abstract : Recently, there are certain category of supply chains which are fast emerging such as online groceries, fast moving goods which are low in cost and fast moving. The logistics cost of these supply chains is very important and they need to be delivered in the shortest possible time. All these problems are categorized into a vehicle routing problem. In certain problem, additional constraints such as time slots are also introduced so as to deliver the goods in particular time. Thus, it becomes very important to make the vehicle scheduling efficient. It becomes Non Polynomial when there is more than one vehicle in the delivery system. A vehicle routing problem is defined as a system of a vehicle covering a geographically dispersed routes which are covered in the shortest possible time. The vehicle should not visit any of the routes twice. In this paper, we have used simulated annealing and nearest neighborhood algorithms to compare and solve a designated set of routes in which a FMCG company delivers the goods to its customer. © TJPRC Pvt. Ltd

Cite this Research Publication : A. Tatavarthy, T. Srinivas Rao, and K. Prakash Marimuthu, “ A simulated annealing and nearest neighborhood approach to solve a vehicle routing problem in a FMCG company.” International Journal of Mechanical and Production Engineering Research and Development

Admissions Apply Now