Genetic Algorithm based approach for Vehicle Routing Problem with Time Windows. Issue 3 (13th March 2008)

• Record Type: Journal Article
• Authors: Rajmohan, M.; Shahabudeen, P.
• Is Part Of: International journal of logistics systems and management. Volume 4:Issue 3(2008)
• Page Start: 338
• Page End: 365
• Publication Date: 2008-03-13
• Subjects: 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; Business logistics -- Periodicals; 658.5005
• Languages: English
• ISSNs: 1742-7967

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.