A new genetic algorithm for vehicle routing problem. | [Mehran University Research Journal of Engineering and Technology • 2010]

Author(s):

1. Ziauddin Ursani: School of Engineering & Information Technology, University of New South Wales, ADFA Campus, Northcott Drive, Canberra, ACT 2600, Australia

2. Ahsan Ahmad Ursani: Institute of Information & Communication Technologies, Mehran University of Engineering & Technology, Jamshoro, Pakistan

3. Aftab Ahmed Memon: Institute of Information & Communication Technologies, Mehran University of Engineering & Technology, Jamshoro, Pakistan

Abstract:

The VRP (Vehicle Routing Problem) is a typical problem of combinatorial optimization. It is a product of two NP-Hard problems i.e., routing and assignment problem. In the past, a number of attempts have been made to solve this problem through various meta-heuristics including genetic algorithms. However, genetic algorithms have failed to compete with other paradigms in the area. Therefore there remains a great room for improvement for genetic algorithms as far as VRP is concerned. In this paper the authors proposed a new genetic algorithm augmented with a new evaluation procedure called self-imposed constraints. The algorithm is successfully tested on popular datasets, yielding encouraging results.

Page(s): 153-162

DOI: DOI not available

Published: Journal: Mehran University Research Journal of Engineering and Technology, Volume: 29, Issue: 1, Year: 2010

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views