An aggregate label setting policy for the multi-objective shortest path problem
We consider label setting algorithms for the multi-objective shortest path problem with any number of sum and bottleneck objectives. We propose a weighted sum aggregate ordering of the labels, specifically tailored to combine sum and bottleneck objectives. We show that the aggregate order leads to a consistent reduction of solution times (up to two-thirds) with respect to the classical lexicographic order.
Year of publication: |
2010
|
---|---|
Authors: | Iori, Manuel ; Martello, Silvano ; Pretolani, Daniele |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 207.2010, 3, p. 1489-1496
|
Publisher: |
Elsevier |
Subject: | Multi-objective Shortest path Label setting |
Saved in:
Saved in favorites
Similar items by person
-
An aggregate label setting policy for the multi-objective shortest path problem
Iori, Manuel, (2010)
-
Rejoinder on: Routing problems with loading constraints
Iori, Manuel, (2010)
-
Rejoinder on: Routing problems with loading constraints
Iori, Manuel, (2010)
- More ...