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.

M. Iori, S. Martello, D. Pretolani (2010). An aggregate label setting policy for the multi-objective shortest path problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 207, 1489-1496 [10.1016/j.ejor.2010.06.035].

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

MARTELLO, SILVANO;
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.
2010
M. Iori, S. Martello, D. Pretolani (2010). An aggregate label setting policy for the multi-objective shortest path problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 207, 1489-1496 [10.1016/j.ejor.2010.06.035].
M. Iori; S. Martello; D. Pretolani
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/92374
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 22
  • ???jsp.display-item.citation.isi??? 18
social impact