Solve the vehicle routing problem with time windows via a genetic algorithm

Yaw Chang; Lin Chen

doi:10.3934/proc.2007.2007.240

Article Contents

2007, Volume 2007: 240-249. Doi: 10.3934/proc.2007.2007.240 open access

This issue Previous Article Strongly damped wave equations in $W^(1,p)_0 (\Omega) \times L^p(\Omega)$ Next Article Modeling the motion of a cell population in the extracellular matrix

Solve the vehicle routing problem with time windows via a genetic algorithm

Yaw Chang^1, and
Lin Chen¹

1.
Mathematics and Statistics, University of North Carolina at Wilmington, 601 S. College Rd, Wilmington, NC 28403

Received: August 31, 2006

Revised: May 31, 2007

Published: August 2007

Abstract Related Papers Cited by

Abstract

The objective of vehicle routing problem (VRP) is to deliver a set of customers with known demands on minimum-cost routes originating and terminating at the same depot. A vehicle routing problem with time windows (VRPTW) requires the delivery made in a specific time window given by the customers. Prins (2004) proposed a simple and effective genetic algorithm (GA) for VRP. In terms of average solution, it outperforms most published tabu search results. We implement this hybrid GA to handle VRPTW. Both the implementation and computation results will be discussed.

Keywords:

vehicle routing problem,
vehicle routing problem with time window,
genetic algorithm.

Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

Citation:

Article Metrics

HTML views() PDF downloads(102) Cited by(0)

Solve the vehicle routing problem with time windows via a genetic algorithm

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Solve the vehicle routing problem with time windows via a genetic algorithm

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content