Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and cannot be solved in polynomial time. Thus, many proposed source routing algorithms tackle this problem by transforming it into the shortest path problem, which is P-complete, with an integrated cost function that maps multi-constraints into a single cost. However, this approach may fail to find a ...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

As you walk around during your daily life, you commonly make path finding decisions based on the world around you. For example, when you are walking in the outdoors, you take the path of least resistance over a terrain. We present two applications which demonstrate the importance of using the least cost caloric cost path computation in two different domain settings. One application uses the pop...

Query processing remains one of the important challenges of Object-Oriented Database Management Systems. Cost based query optimization involves creating alternative executing plans for a given query and executing the least costly one within a cost model framework. In Object-Oriented Database Management Systems (OODBMSs) objects may store references to other objects (precomputed joins), and path...

ion 30 Path performance abstraction: cost positive integer costs can be combined costs respect a transitivity relationship the lowest the cost, the better the path Objective: minimize the cost [SDIB08] cost = ↵+ X i i · costi i

In order to optimize cost and decrease complexity with a delay upper bound, the delay-constrained Steiner tree problem is addressed. Base on the new delay-constrained MPH (DCMPH_1) algorithm and through improving on the select path, an improved MPH-based delay-constrained Steiner tree algorithm is presented in this paper. With the new algorithm a destination node can join the existing multicast...