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.

An aggregate label setting policy for the multi-objective shortest path problem / Iori, Manuel; S., Martello; Pretolani, Daniele. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 207:3(2010), pp. 1489-1496. [10.1016/j.ejor.2010.06.035]

An aggregate label setting policy for the multi-objective shortest path problem

IORI, MANUEL;PRETOLANI, Daniele
2010

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.
207
3
1489
1496
An aggregate label setting policy for the multi-objective shortest path problem / Iori, Manuel; S., Martello; Pretolani, Daniele. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 207:3(2010), pp. 1489-1496. [10.1016/j.ejor.2010.06.035]
Iori, Manuel; S., Martello; Pretolani, Daniele
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0377221710004741-main.pdf

non disponibili

Tipologia: Post-print dell'autore (bozza post referaggio)
Dimensione 364.64 kB
Formato Adobe PDF
364.64 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/645952
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? 17
social impact