Starting from a case study, a rich vehicle routing problem is analyzed. It is characterized by multiple time windows, heterogeneous fleet, maximum duration, and multiple visits. Two variants of Ant Colony Optimization are proposed in a multiple colonies framework. Two algorithms are tested, giving results that appear satisfactory.
|Data di pubblicazione:||2007|
|Titolo:||Multiple ant colony optimization for a rich vehicle routing problem: a case study|
|Rivista:||LECTURE NOTES IN COMPUTER SCIENCE|
|Appare nelle tipologie:||2.1 Articolo su rivista |