Return
A genetic algorithm for vehicle routing with backhauling
DOI:10.1007/BF00132738.png)
Abstract
En 中文
In this paper, a greedy route construction heuristic for a vehicle routing problem with backhauling is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of customers. Then, a genetic algorithm is used to identify an ordering that produces good routes. Numerical comparisons are provided with an exact algorithm and with other heuristic approaches.
Keywords:
vehicle routing
backhauling
time windows
genetic algorithms
heuristics
Journal
IF:
3.5
Papers:
7.5K
Citations:
1.7W
Organization
No organization information available

