Title: Genetic Algorithm based approach for Vehicle Routing Problem with Time Windows
Authors: M. Rajmohan, P. Shahabudeen
Addresses: Department of Industrial Engineering, Anna University, Chennai 600 025, Tamil Nadu, India. ' Department of Industrial Engineering, Anna University, Chennai 600 025, Tamil Nadu, India
Abstract: Logistics and supply chain management deals with managing the flow of goods from suppliers, through its facilities, and onto its customers. It is of critical importance in establishing a competitive advantage. Proper performance of the logistics functions can contribute to both lower costs and to enhance customer service. To reduce transportation costs and also to improve customer service, finding the best paths for vehicles that will minimise time or distance is frequent decision problem and this is commonly known as the Vehicle Routing Problem (VRP). In this paper, Genetic Algorithm (GA) based heuristic is proposed to solve Vehicle Routing Problem with Time Windows. The initial population of the GA is generated using Greedy Randomised Adaptive Search Procedure. The proposed algorithm is tested with bench mark instances and is found to be better solutions than published results.
Keywords: genetic algorithm; GAs; greedy randomised adaptive search procedure; GRASP; logistics; supply chain management; SCM; time windows; vehicle routing problem; VRP; time windows; transportation costs; cost reduction; customer service.
DOI: 10.1504/IJLSM.2008.017480
International Journal of Logistics Systems and Management, 2008 Vol.4 No.3, pp.338 - 365
Published online: 12 Mar 2008 *
Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article