A genetic algorithm for a bi-objective capacitated arc routing problem
The capacitated arc routing problem (CARP) is a very hard vehicle routing problem for which the objective—in its classical form—is the minimization of the total cost of the routes. In addition, one can seek to minimize also the cost of the longest trip. In this paper, a multi-objective genetic algor...
Saved in:
Published in | Computers & operations research Vol. 33; no. 12; pp. 3473 - 3493 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Elsevier Ltd
01.12.2006
Pergamon Press Inc Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!