Open Access Open Access  Restricted Access Subscription or Fee Access

Heuristic Based Transportation Routing and Sizing

NR Rajhans, Ankita Mishra, Amit Pingle

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.

Keywords


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

Full Text:

PDF

References


Gilbert Laporte. The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. Eur J Oper Res. 1992.

Yannis Marinakis, Athanasios Migdalas. Heuristics Solutions of Vehicle Routing Problems in Supply Chain Management.

Gilbert Laporte, Michel Gendreau, et al. Classical and Modern Heuristics for the Vehicle Routing Problem. Intl. Trans. in Op. Res. 2000; 7: 285–300p.

Jalel Euchi, Adnan Yassine, Habib Chabchoub. The Dynamic Vehicle Routing Problem: Solution with Hybrid Metaheuristic Approach. Swarm Evol Comput. 2013.

Burak Eksioglu, Arif Volkan Vural, Arnold Reisman. The Vehicle Routing Problem: A Taxonomic Review. Comput Ind Eng. 2009; 57: 1472–1483p.

Liong Choong Yeun, et al. Vehicle Routing Problem: Models and Solutions. Journal of Quality Measurement and Analysis (JQMA). 2008.

Maurizio Bielli, Alessandro Bielli, Riccardo Rossi. Trends in Models and Algorithms for Fleet Management. Procedia Soc Behav Sci. 2011; 20: 4–18p.

Gilbert Laporte, Paolo Toth, Daniele Vigo. Vehicle Routing: Historical Perspective Andrecent Contributions. Euro J Transp Logist. 2013; 2: 1–4p.

Sanghamitra Bandyopadhyay, Ujjwal Maulik. K-Means Algorithm for Optimal Clustering, Information Sciences.15. Nurcahyo Guadi W, Rose Alinda Alias, SM Mamyam Shamsuddin, et al. Sweep Algorithm in Vehicle Routing Problem For Public Transport. Jurnal Antarabangsa (Teknologi Maklumat). 2002; 2: 51–64p.

Supawadee Charoenwiengwechakij, Tanasanee Phienthrakul. Solving Traveling Salesman Problems with k-Means Clustering Genetic Algorithm.

Aristidis Likasa, Nikos Vlassis, Verbeek Jakob J. The Global k-Means Clustering Algorithm. Pattern Recogn. 2003; 36: 451–461p.

Fuyuan Cao, Jiye Liang, Deyu Li, et al. A Weighting k-Modes Algorithm for Subspace Clustering of Categorical Data. Neurocomputing. 2013; 108: 23–30p.

Cordeau J-F, Gendreau M, Laporte G, et al. A Guide to Vehicle Routing Heuristics. J Oper Res Soc. May 2002; 53(5): 512–522p.

Kehan Zeng, Gang Peng, Zhaoquan Cai,

et al. A Hybrid Natural Computing Approach for the VRP Problem Based on PSO, GA and Quantum Computation. Computer Science and its Applications (CSA). DOI: 10.1007/978-94-007-5699-1_3.

Transportation Logistics. Lecture held by Gilbert Laporte Winter Term 2004, (University of Vienna); Summarized by Guenther Fuellerer.

Thibaut Vidal, Teodor Gabriel Crainic. Heuristics for Multi Attribute Vehicle Routing Problems: A Survey and Synthesis. CIRRELT. Feb 2012.

David Mester, Olli Bra¨ysy, Wout Dullaert. A Multi-Parametric Evolution Strategies Algorithm for Vehicle Routing Problems. Expert Syst Appl. 2007; 32: 508–517p.




DOI: https://doi.org/10.37591/joprm.v5i3.7189

Refbacks

  • There are currently no refbacks.