Results 191 to 200 of about 47,653 (229)

Optimizing multi-criteria k-shortest paths in graph by a natural routing genotype-based genetic algorithm

2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2018
k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios ...
Yang Wang, Qing Liu, Hai‐Peng Ren, Xuan Ma, Long Liu, Wenqing Wang, Jing Zhang   +6 more
openalex   +3 more sources

Finding all best ties by a K shortest paths method of Dreyfus in a general digraph for routing control

TENCON 2014 - 2014 IEEE Region 10 Conference, 2014
For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then,
Eiji Mizutani
openalex   +3 more sources

Multi-tiers route design coordinating QoS-specific K shortest paths over optical network

2015 IEEE International Conference on Communication Workshop (ICCW), 2015
In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection.
Hideki Tode, Masashi Takada, Yosuke Tanigawa   +2 more
openalex   +3 more sources

Solving the communication networks routing problem using modified algorithm for finding K shortest paths

, 2010
Problem wyznaczania połączeń w sieciach komunikacyjnych jest przykładem zadania optymalizacji wielokryterialnej, którego rozwiązaniem jest zbiór rozwiązań niezdominowanych. Wyznaczanie połączeń polega na rozwiązaniu dwu kryterialnego problemu wyznaczania najkrótszej ścieżki w grafie ważonym.
Jacek Widuch
openalex   +3 more sources

Routing and Spectrum Assignment in Elastic Optical Networks through a Hybrid Approach based on K-Shortest Paths and Q-Learning

2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2023
Ivan I. Ríos-Villalba, Santiago C. Arce, Luis Ayala Albertini, Diego P. Pinto-Roa   +3 more
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

Annals of Operations Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicos Christofides, Aristide Mingozzi, Eleni Hadjiconstantinou   +2 more
openaire   +2 more sources

The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem

European Journal of Operational Research, 2014
Abstract In many branch-and-price algorithms, the column generation subproblem consists of computing feasible constrained paths. In the capacitated arc-routing problem (CARP), elementarity constraints concerning the edges to be serviced and additional constraints resulting from the branch-and-bound process together impose two types of loop ...
Stefan Irnich, Claudia Bode
openaire   +2 more sources

Transmisson Line Route Selection: An Application Of K-Shortest Paths And Goal Programming

, 1984
F. Choobineh, T. Burgman
openalex   +1 more source

Path-Planning for Unmanned Aerial Vehicles with Environment Complexity Considerations: A Survey

ACM Computing Surveys, 2023
, Soufiene Djahel
exaly  

Exploring paths of chemical transformations in molecular and periodic systems: An approach utilizing force

Wiley Interdisciplinary Reviews: Computational Molecular Science, 2021
Satoshi Maeda, Yu Harabuchi
exaly