.png){kind=icon}
返回
Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2020.104977.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The shortest path problem arises in several contexts like transportation, telecommunication or data analysis. New requirements in solving practical problems (e.g., efficient content delivery for information-centric networks, urban passenger transport system or social network) impose that more than one criterion should be considered. Since the objectives are in conflict, the solution is not unique, rather a set of (efficient) paths is defined as optimal. The most satisfactory path should be selected considering additional preference information. Generally, computing the entire set of efficient solutions is time consuming. In this paper, we apply the reference point method for finding the best path. In a reference point-based approach, non-additive scalarizing function is applied. In this case, the classical optimality principle for the shortest path problem is not valid. To overcome this issue, we propose an equivalent formulation dealing with the constrained shortest path (CSP) problem. The idea is to define a set of constraints guaranteeing that an optimal solution to the problem at hand lies in the feasible region of the defined CSP problem. We propose a two-phase method where, in the first phase, a bound on the optimal solution is computed and used to define the constraints, whereas, in the second phase a labelling algorithm is applied to search for an optimal solution to the defined CSP problem. The method is tested on instances generated from random and grid networks, considering several scenarios. The computational results show that, on average, the proposed solution strategy is competitive with the state-of-the-art approaches and behaves the best on grid networks. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Multiple criteria analysis
Pareto-optimal paths
Reference point method
Constrained shortest path
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Cambios antropométricos y satisfacción personal con una intervención educativa que incluyó el uso de una aplicación móvil, para personas con sobrepeso u obesidad身体测量指标的变化和个人满意度：一项包含使用移动应用程序的教育干预研究，针对体重超重或肥胖人群
OAAI
OAAI分享收藏
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks在城市多式联运网络中寻找多目标最短路径的效用度量
PREAI
分享收藏Efectividad en programas preventivos de lesiones deportivas músculo esqueléticas en adultos sedentarios que inician actividad física (Effectiveness in preventive programs of skeletal muscle injuries in sedentary adults who begin a sports activity)预防运动性骨骼肌肉损伤计划在开始体育活动的久坐成人中的有效性.png)
RetosOAAI
RetosIF0
OAAI分享收藏
查看更多内容