Results 241 to 250 of about 50,964 (251)
Some of the next articles are maybe not open access.
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 ...
Long Liu +6 more
openaire +2 more sources
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 ...
Long Liu +6 more
openaire +2 more sources
K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks
2005Actually, various kinds of sources (such as voice, video, or data) with diverse traffic characteristics and Quality of Service Requirements (QoS), which are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks.
Abdelhamid Mellouk +2 more
openaire +2 more sources
Multi-tiers route design coordinating QoS-specific K shortest paths over optical network
2015 IEEE International Conference on Communication Workshop (ICCW), 2015In 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.
Yosuke Tanigawa +2 more
openaire +2 more sources
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming
2011In this paper, we describe a Constraint Programming (CP) route finding application for a container transportation company. Mathematically, this amounts to finding the k shortest paths in a directed graph. However the nature of the business constraints rule out known algorithms such as Dijkstra's.
Jean-Francois Puget +2 more
openaire +2 more sources
Annals of Operations Research, 1995
We consider the basic Vehicle Routing Problem (VRP) in which a fleet ofM identical vehicles stationed at a central depot is to be optimally routed to supply customers with known demands subject only to vehicle capacity constraints. In this paper, we present an exact algorithm for solving the VRP that uses lower bounds obtained from a combination of two
Nicos Christofides +2 more
openaire +2 more sources
We consider the basic Vehicle Routing Problem (VRP) in which a fleet ofM identical vehicles stationed at a central depot is to be optimally routed to supply customers with known demands subject only to vehicle capacity constraints. In this paper, we present an exact algorithm for solving the VRP that uses lower bounds obtained from a combination of two
Nicos Christofides +2 more
openaire +2 more sources
Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths
IEEE Transactions on Automatic Control, 2006The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC is NP-complete. Many heuristic methods have been proposed for it.
Pravin Varaiya, Zhanfeng Jia
openaire +2 more sources
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
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
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,
openaire +2 more sources
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,
openaire +2 more sources
International Journal of Operational Research, 2018
The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity.
openaire +2 more sources
The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity.
openaire +2 more sources
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.
openaire +2 more sources
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.
openaire +2 more sources