The shortest path problem with two objective functions

Mordechai I. Henig*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

143 Scopus citations

Abstract

We present methods to find the shortest path in a network where each path is associated with two objectives. We describe how to obtain the nondominated paths and the extreme nondominated paths, and compare the expected complexity of the methods. An improvement in efficiency can be obtained when quasiconcave or quasiconvex utility functions are assumed. In the first case, we describe how to find the optimal extreme nondominated path and bounds for the optimal path value. Then the optimal path can be located by calculating the k-th shortest path. In the second case we suggest a branch and bound method to solve the problem.

Original languageEnglish
Pages (from-to)281-291
Number of pages11
JournalEuropean Journal of Operational Research
Volume25
Issue number2
DOIs
StatePublished - May 1986

Keywords

  • Dynamic programming
  • multiattribute utility
  • networks

Fingerprint

Dive into the research topics of 'The shortest path problem with two objective functions'. Together they form a unique fingerprint.

Cite this