Heuristic Based Transportation Routing and Sizing

Authors

  • Ankita Mishra Department of Production Engg. and Industrial Management, College of Engineering Pune (COEP), Shivajinagar, Pune, Maharashtra, India
  • NR Rajhans Department of Production Engg. and Industrial Management, College of Engineering Pune (COEP), Shivajinagar, Pune, Maharashtra, India
  • Amit Pingle Advanced Optimization, Asia Technology Innovation Center, John Deere India Pvt. Ltd., Pune, Maharashtra, India

Keywords:

Vehicle routing problem (VRP), K-means clustering, sweep heuristics, travelling salesman problem

Abstract

Employee transportation is one of the most concerned issues and a part of HR policy in today’s work culture. Optimization of these routes and analysis of scenario needs to be done to leverage cost benefits for the organizations of today. Traditional studies focus on goods delivery and pickup, but employees are a totally different entity, which change the type of problem to be solved. As the entity to be considered changes, new constraints get added up to the existing solutions, and new study needs to be proposed, for getting better and reliable solutions. Though the problem can be considered as one of vehicle routing, but solving it imposes many restrictions on the predefined techniques. The heuristics need to be evaluated, and selection of the most optimal one is the challenge. Clustering of data is done using two approaches i.e., K-means and sweep heuristics. Results obtained were permuted and again tested to get the best and real time solution to the problem being considered.Cite this ArticleMishra Ankita, Rajhans NR, Pingle Amit. Heuristic Based Transportation Routing and Sizing. Journal of Production Research and Management. 2015; 5(3): 20–27p.

Published

2015-12-02

Issue

Section

Research Articles