A multi-objective shortest path problem

Kazuyoshi Wakuta

Mathematical Methods of Operations Research, 2001, vol. 54, issue 3, 445-454

Abstract: We study a multi-objective shortest path problem. We formulate a multi-objective Markov decision process model for the problem and solve it by the policy improvement procedure. We first show by counter-examples the differences between the multi-objective shortest path problem and the single-objective one. We next introduce “locally efficient policies” and present an algorithm for finding all efficient paths from all nodes to the destination. Moreover, as an application, we consider a shortest path problem with a constraint. Last, the algorithm is illustrated by a numerical example. Copyright Springer-Verlag Berlin Heidelberg 2001

Keywords: Key words: shortest path problem; multi-objective; policy improvement procedure (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860100169 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:54:y:2001:i:3:p:445-454

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860100169

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().