To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given quality-of-service constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a nearoptimal solution. However, these heuristics eith...

| In this paper, we address several QoS routing problems in wireless ad hoc networks. Due to mobility or limited battery power, a link between two nodes can last for a certain period, which is represented by a life parameter. On the other hand, each link has cost parameters which can represent the delay of this link, the transmission power needed to support this link, and so on. The life of a p...

Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and has been extensively studied. Many proposed source routing algorithms tackle this problem by transforming it into the shortest path selection problem, which is P-complete, with an integrated cost function that maps the multi-constraints of each link into a single cost. However, how to select an ap...

We consider generalized shortest path problems with cost and weight functions for the arcs of a graph. According to their weight arcs may generate or consume ow. Weights may be additive or multiplicative on a path. More precisely, if x units enter an arc a = (u; v) then x + w(a) resp. x w(a) leave it. The cost is charged per unit and summed over the edges of a path. If the weights multiply, the...

Several schemes have been proposed in the path planning-literature to plan collision-free and feasible trajectories for non-holonomic mobile robots. A classical scheme is the two-step approach proposed in 4, 8, 5] which consists in rst computing a collision-free holonomic path, and then in transforming this path by a sequence of feasible ones. The quality of the solution and the computational c...

The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required, together with user setting on path and computational cost weightage. However, the op...

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

Given a digraph G = (V; E) and a cost function C : E ! IR, which does not imply negative cost cycles, let us denote by G() the graph obtained from G by adding to the cost of each edge the positive constant ; then we want to compute the cost of the least cost path from a given origin r to each node v in the graph G() for diierent choices of 0, without having to run a least cost path algorithm ev...

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is co...

The problem of finding a path with two additive constraints, in particular finding a path that satisfies both the cost and the delay constraints, is called multi-constrained path (MCP) problem in the literature. In this paper, we explore the MCP problem based on the idea of single mixed weight—a mixed weight for each link is first obtained by combining its delay and cost, and then Dijkstra’s al...