Vehicle routing problem: models and solutions

Liong, Choong Yeun and Wan Rosmanira Ismail, and Khairuddin Omar, and Mourad Zirour, (2008) Vehicle routing problem: models and solutions. Journal of Quality Measurement and Analysis, 4 (1). pp. 205-218. ISSN 1823-5670

[img] PDF
Restricted to Repository staff only


Official URL:


The Vehicle Routing Problem (VRP) is a well known problem in operational research where customers of known demands are supplied by one or several depots. The objective is to find a set of delivery routes satisfying some requirements or constraints and giving minimal total cost. The VRP has drawn enormous interests from many researchers during the last decades because of its vital role in planning of distribution systems and logistics in many sectors such as garbage collection, mail delivery, snow ploughing and task sequencing. The VRP is divided into many types. The important problems are VRP with Time Windows, VRP with Pick-Up and Delivery and Capacitated VRP. Recently many exact methods have been used to solve the VRP such as exact algorithms based on linear programming techniques and guided local search. Besides that, heuristic techniques have received wide interests in researchers’ effort to solve large scale VRPs. Among the recently applied heuristic techniques are genetic algorithm, evolution strategies and neural networks

Item Type:Article
Keywords:Vehicle routing problem; VRP with time windows; VRP with pick-up and delivery; capacitated VRP; exact algorithms; heuristic methods
Journal:Journal of Quality Measurement and Analysis
ID Code:1868
Deposited By: Ms. Nor Ilya Othman
Deposited On:15 Jun 2011 07:52
Last Modified:14 Dec 2016 06:30

Repository Staff Only: item control page