logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

On the sum-max bicriterion path problem

delete1998-12-01
delete22
PRE
AI
B
Blas Pelegrı́n
P
Pascual Fernández
DOI：10.1016/S0305-0548(98)00036-7delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we study a special class of bicriterion path problems where the objective functions are defined by a sum and a maximum: The sum-max bicriterion path problem (SMBPP). After reviewing some special kinds of efficient paths, we propose some algorithms to generate these kinds of efficient paths, based on a progressive reduction of the original network. We analyse its relationship with the quickest path problem (QPP), showing that this is equivalent to the weighted problem associated to the SMBPP, which is also solved by a modification of an algorithm proposed for the QPP. A computational study is presented which shows the superiority of the algorithm proposed in this paper over other existing algorithms to generate the entire set E of efficient paths of the SMBPP. (C) 1998 Elsevier Science Ltd. All rights reserved.
Keywords:
bicriteria analysis
network optimization
quickest paths
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available