Results 211 to 220 of about 550,853 (271)
Some of the next articles are maybe not open access.
On the Shortest Path Problems with Edge Constraints
2020 22nd International Conference on Transparent Optical Networks (ICTON), 2020The goal of this work is to provide a brief classification of some Shortest Path Problem (SPP) variants that include edge constraints and that find applications in several different contexts, including optical networks, transportation and logistics.
Ferone D. +3 more
openaire +3 more sources
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
Transportation Science, 2016The elementary shortest path problem with resource constraints ESPPRC is an NP-hard problem that often arises in the context of column generation for vehicle routing problems. We propose an exact solution method that relies on implicit enumeration with a
Leonardo Lozano, D. Duque, A. Medaglia
semanticscholar +1 more source
Shortest Path Problem in Network with Type-2 Triangular Fuzzy Arc Length
, 2017In traditional shortest path problem it is always determined that the parameters (Time, Cost and Distance etc.) are fixed between different nodes. But in real life situations where uncertain parameters exist, parameters are considered as fuzzy numbers ...
Ranjan Kumar, S. Jha, Ramayan Singh
semanticscholar +1 more source
On the difficulty of some shortest path problems
ACM Transactions on Algorithms, 2003We prove superlinear lower bounds for some shortest path problems in directed graphs, where no such bounds were previously known. The central problem in our study is the replacement paths problem: Given a directed graph G with non-negative edge weights, and a shortest path P
Subhash Suri +2 more
openaire +3 more sources
Cost Projection Methods for the Shortest Path Problem with Crossing Costs
Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, 2017Real world routing problems, e.g., in the airline industry or in public and rail transit, can feature complex non-linear cost functions. An important case are costs for crossing regions, such as countries or fare zones.
Marco Blanco +6 more
semanticscholar +1 more source
The constrained shortest path problem
Naval Research Logistics Quarterly, 1978AbstractThe shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case.
Yash P. Aneja, K. P. K. Nair
openaire +2 more sources
On the Robust Shortest Path Problem
Computers & Operations Research, 1998Abstract The shortest path problem is of great importance to the real world in such areas as transportation, network design, telecommunication, etc. The deterministic version of the problem is easily solved. However, in the real world, uncertainty is frequently encountered and must be dealt with.
Gang Yu, Jian Yang
openaire +2 more sources
1970
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +2 more sources
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +2 more sources
Shortest path tour problem with time windows
European Journal of Operational Research, 2020This paper aims at studying a new variant of the shortest path tour problem, where time window constraints are taken into account. This is the first work dealing with the shortest path tour problem with time windows. The problem is formally described and its theoretical properties are analyzed.
Luigi Di Puglia Pugliese +3 more
openaire +8 more sources
On the Forward Shortest Path Tour Problem
2017This paper addresses the Forward Shortest Path Tour Problem (FSPTP). Given a weighted directed graph, whose nodes are partitioned into clusters, the FSPTP consists of finding a shortest path from a source node to a destination node and which crosses all the clusters in a fixed order.
Carrabs, Francesco +3 more
openaire +4 more sources