We address the determination of the second point-to-point shortest simple path in undirected networks. The effective reduced cost concept is introduced to compute the second best solution. This concept is used to prove that a path tree containing the second point-to-point shortest simple path is adjacent to any shortest path tree. Therefore, this result immediately implies a methods requiring O...

The desire for configuring well-managed OSPF routes to handle today’s communication needs with larger networks and changing service requirements has opened the way to use traffic engineering tools with OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We consider these two crucial issue...

Finding a line plan with corresponding frequencies is an important stage of planning a public transport system. A line plan should permit all passengers to travel with an appropriate quality at appropriate costs for the public transport operator. Traditional line planning procedures proceed sequentially: In a first step a traffic assignment allocates passengers to routes in the network, often b...

Planning landmarks are facts that must be true at some point in every solution plan. Previous work has very successfully exploited planning landmarks in satisficing (non-optimal) planning. We propose a methodology for deriving admissible heuristic estimates for cost-optimal planning from a set of planning landmarks. The resulting heuristics fall into a novel class of multi-path dependent heuris...

Planning landmarks are facts that must be true at some point in every solution plan. Previous work has very successfully exploited planning landmarks in satisficing (non-optimal) planning. We propose a methodology for deriving admissible heuristic estimates for cost-optimal planning from a set of planning landmarks. The resulting heuristics fall into a novel class of multi-path dependent heuris...

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

The precision and efficiency of multi-target path planning are crucial factors influencing the performance anti-mine operations using unmanned underwater vehicles (UUVs). Addressing inadequacies in computation time solution quality present existing algorithms, this study proposes a novel cost estimation strategy based on neural networks. This swiftly generates an accurate matrix, ensuring attai...

The quadratic shortest path (QSP) problem is to find a path from a node to another node in a given network such that the total cost includes two kinds of costs, say direct cost and interactive cost, is minimum. The direct cost is the cost associated with each arc and the interactive cost occurs when two arcs appear simultaneously in the shortest path. In this paper, the concept of the quadratic...