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.
Titolo: | An aggregate label setting policy for the multi-objective shortest path problem |
Autore/i: | M. Iori; MARTELLO, SILVANO; D. Pretolani |
Autore/i Unibo: | |
Anno: | 2010 |
Rivista: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.ejor.2010.06.035 |
Abstract: | 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. |
Data prodotto definitivo in UGOV: | 2010-11-08 19:17:20 |
Appare nelle tipologie: | 1.01 Articolo in rivista |
File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.