Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly

Author(s):  
Ji Youn Lee ◽  
Hee-Woong Lim ◽  
Suk-In Yoo ◽  
Byoung-Tak Zhang ◽  
Tai Hyun Park
Author(s):  
Zbigniew Tarapata

Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard AlgorithmsThe paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra's algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.


1989 ◽  
Vol 23 (3) ◽  
pp. 251-279 ◽  
Author(s):  
S. Venkatasubramanian ◽  
Kamala Krithivasan ◽  
C. Pandu Rangan

2017 ◽  
Vol 51 (1) ◽  
pp. 261-266 ◽  
Author(s):  
Édouard Bonnet ◽  
Vangelis Th. Paschos
Keyword(s):  

2020 ◽  
Vol 964 (10) ◽  
pp. 49-58
Author(s):  
V.I. Bilan ◽  
A.N. Grigor’ev ◽  
G.G. Dmitrikov ◽  
E.A. Dudin

The direction of research on the development of a scientific and methodological tool for the analysis of spatial objects in order to determine their generalized spatial parameters was selected. An approach to the problem of modeling networks and groups of objects based on the synthesis of a weighted graph is proposed. The spatial configuration of objects based on the given conditions is described by a weighted graph, the edge length of which is considered as the weight of the edges. A generalization to the typical structure of a spatial graph is formulated; its essence is representation of nodal elements as two-dimensional (polygonal) objects. To take into account the restrictions on the convergence of the vertices described by the buffer zones, a complementary graph is formed. An algorithm for constructing the implementation of a spatial object based on the sequential determination of vertices that comply with the given conditions is proposed. Using the software implementation of the developed algorithm, an experiment was performed to evaluate the spatial parameters of the simulated objects described by typical graph structures. The following parameters were investigated as spatial ones


2001 ◽  
Vol 63 (4) ◽  
pp. 639-671 ◽  
Author(s):  
Uriel Feige ◽  
Joe Kilian
Keyword(s):  

2021 ◽  
Vol 868 ◽  
pp. 46-64
Author(s):  
Klaus Heeger ◽  
Anne-Sophie Himmel ◽  
Frank Kammer ◽  
Rolf Niedermeier ◽  
Malte Renken ◽  
...  
Keyword(s):  

Author(s):  
Guang-Yu Zhang ◽  
Xiao-Wei Chen ◽  
Yu-Ren Zhou ◽  
Chang-Dong Wang ◽  
Dong Huang ◽  
...  

Author(s):  
Xue Mei ◽  
Weiwei Li ◽  
Ryad Chellali ◽  
Yu Zhou ◽  
Jiashuang Huang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document