Results 331 to 340 of about 779,089 (370)
Some of the next articles are maybe not open access.
Dynamic programming approaches to solve the shortest path problem with forbidden paths
Optim. Methods Softw., 2013In this paper, the shortest path problem with forbidden paths is addressed. The problem under consideration is formulated as a particular instance of the resource-constrained shortest path problem.
L. Pugliese, F. Guerriero
semanticscholar +1 more source
2007
In this chapter we consider the shortest route problem where distances/costs are not known precisely and are modeled using fuzzy numbers. The fuzzy shortest route problem is outlined in the next section. We have previously used an evolutionary algorithm to solve an example problem (Section 6.5.1 of [2] and [3]).
James J. Buckley, Leonard J. Jowers
openaire +2 more sources
In this chapter we consider the shortest route problem where distances/costs are not known precisely and are modeled using fuzzy numbers. The fuzzy shortest route problem is outlined in the next section. We have previously used an evolutionary algorithm to solve an example problem (Section 6.5.1 of [2] and [3]).
James J. Buckley, Leonard J. Jowers
openaire +2 more sources
Shortest Path Problems in Hydrogeology
Groundwater, 1978ABSTRACTMany aspects of ground water involve shortest paths between two points and shortest round trips to many points. These problems are included in network theory which is not easily available to groundâwater specialists. This paper introduces some of the techniques which can be solved by hand for fairly small projects.
openaire +2 more sources
The k-Color Shortest Path Problem
2019This paper proposes a mathematical model and an exact algorithm for a novel problem, the k-Color Shortest Path Problem. This problem is defined on a edge-colored weighted graph, and its aim is to find a shortest path that uses at most k different edge-colors.
Ferone D., Festa P., Pastore T.
openaire +3 more sources
Shortest and longest path problems
Optimization, 1996This paper considers a wide class of shortest path problems in acyclic digraphs, where path lengths are given by the multiplicatively additive value. The problems are solved through bynamic programming, [4]. The bynamic programming formulation for the class has a system of two interrelated recursive equations. By solving the system, simultaneously both
openaire +2 more sources
2009
Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document ...
David S. Johnson +2 more
openaire +2 more sources
Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document ...
David S. Johnson +2 more
openaire +2 more sources
Shortest Path Problems with Resource Constraints
2006In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants.
Stefan Irnich, Guy Desaulniers
openaire +3 more sources
Uncertain programming models for multi-objective shortest path problem with uncertain parameters
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2019S. Majumder +3 more
semanticscholar +1 more source
Generalised arrays and shortest path problems
ACM SIGAPL APL Quote Quad, 1986Real world problems are often formulated as flow optimization problems on large networks, with thousands of nodes but with a restricted number of arcs. The average number of arcs having a given node as origin or terminal node (node degree) may be limited even to a few units.
openaire +2 more sources