Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW:...

Full description

Bibliographic Details
Main Authors: Filip Taner, Ante Galić, Tonči Carić
Format: Article
Language:English
Published: University of Zagreb, Faculty of Transport and Traffic Sciences 2012-07-01
Series:Promet (Zagreb)
Subjects:
Online Access:http://www.fpz.unizg.hr/traffic/index.php/PROMTT/article/view/443