Title: Multi-objective optimisation for the vehicle routing problem using metaheuristics

Authors: Sonu Rajak; P. Parthiban; R. Dhanalakshmi; S. Sujith

Addresses: Department of Production Engineering, National Institute of Technology, Tiruchirappalli – 620015, India ' Department of Production Engineering, National Institute of Technology, Tiruchirappalli – 620015, India ' Department of Computer Science and Engineering, National Institute of Technology Nagaland, Dimapur – 797103, India ' Department of Production Engineering, National Institute of Technology, Tiruchirappalli-620015, India

Abstract: The capacitated vehicle routing problem is a combinatorial optimisation problem that determines a set of routes of minimum distance to deliver the goods, using a fleet of identical vehicles with restricted capacity. The objective of this article it to optimise the total distance required to deliver the goods and also the workload imbalance in terms of distances travelled by the vehicles and their loads. Due to the combinatorial in nature, it requires metaheuristic to solve these types of problems and this is a rapidly growing field of research. Here two metaheuristics such as ant colony optimisation (ACO) and simulated annealing (SA) are proposed and analysed for solving this multi-objective formulation of the vehicle routing problem. The results obtained from these two methods were compared and found that the ACO gives better results than the SA for the VRP.

Keywords: vehicle routing problem; VRP; K-means clustering algorithm; simulated annealing; ant colony optimisation; ACO.

DOI: 10.1504/IJENM.2018.093706

International Journal of Enterprise Network Management, 2018 Vol.9 No.2, pp.117 - 128

Accepted: 02 Nov 2017
Published online: 01 Aug 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article