shortest path problemnon-additive objectivedynamic programmingShortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems,
Multiobjective shortest path problem Consider a directed graph G=(V,A) with ≔n≔|V| nodes and ≔m≔|A| arcs. For a node v∈V, we denote its set of outgoing arcs by δ+(v) and its set of incoming arcs by δ−(v). We assume that G has no parallel arcs and can then...
Keywords:logisticsmanagement;fuzzyoptimalsolution;extendedlabelcorrectingmethod;multiobjective shortestpathproblem. 0 引言 传统上,寻找某一节点到另一节点之间的最短路是单目标网络优化中最常见的问题之一。而在许多 实际应用中,经常会发现单目标函数不足以正确描述问题,应同时考虑距离、费用、时间等因素 [1,2] 。
Complex&IntelligentSystems(2021)7:725–740https://doi.org/10.1007/s40747-020-00234-4ORIGINAL ARTICLESolvingfuzzymulti-objectiveshortestpathproblembasedondataenvelopmentanalysisapproachM. Bagheri 1 · Ali Ebrahimnejad 2 · S. Razavyan 1 · F. Hosseinzadeh Lotf i3· N. Malekmohammadi 1Received:...
We model this as a multi-objective shortest path problem. Additionally, we need to determine the order of the targets to be visited. We model this as a multi-objective traveling salesperson problem (MOTSP). The overall problem is a combination of these two problems, which we define as a ...
In multi-objective planning, Melo et al.34 considered the presence of many objects in the environment to minimize the time taken by all robots to reach the target location and to reduce the distance traveled by the robots. The problem is modeled as a graph problem in which a path is decom...
vOptSpecific: Multiobjective structured problems / Application Programming Interface (API), 2-LAP: Linear Assignment Problem 2-OSP: One machine Scheduling Problem 2-UKP: binary Unidimensional knapsack problem 2-UMFLP: Uncapacitated Mixed variables Facility Location Problem ...
Path planning problem is a typical multimodal multiobjective optimization problem. However, no MMO path planning benchmark problems have been released in public. This special session is devoted to the novel approaches, algorithms and techniques for solving multimodal multiobjective path planning optimizatio...
rst studies on the multi-objective shortestpath problem; he analyzed some bi-objective problems and demonstrated that, in the 2.4 Multi-objective Optimization Integer Problems 29 worst case, the non-dominated paths number grows exponentially with the network size. So it is clear that, in the ...
As it has been mentioned before, there are various criteria in real life problems where people prefer to decide upon routes according to their conditions and it is called as a multi-objective shortest path problem that usually arises in transportation problems. Solution techniques including labeling ...