The Random Particle Optimization (RPO) method, used for determining the optimal path from a specified initial pose of a mobile robot in a static or dynamic environment, models obstacles and target as repulsive and attractive Coulomb potentials respectively. It is a sensor-based method drawing its methodology from bacterial foraging just as Genetic Algorithms (GA) are based on Darwin’s genetic e...

Based on evolutionary computation concepts, the Evolutionary Planner/Navigator (EP/N) 4, 5] represents a new approach to path planning and navigation. Since its rst version, the development of the EP/N system has been an ever living \evolution" process itself: much new development and further research has been made 8, 7] to fullll the EP/N promise of being able to (1) accommodate diierent optim...

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

This work deals with a class of problems under interval data uncertainty, namely interval robusthard problems, composed of interval data min-max regret generalizations of classical NP-hard combinatorial problems modeled as 0-1 integer linear programming problems. These problems are more challenging than other interval data min-max regret problems, as solely computing the cost of any feasible so...

In this thesis, we study the preprocessing phase of the ALT algorithm. ALT is a well known preprocessing-based speed-up technique for Dijkstra’s algorithm, which allows fast computations of shortest paths in large scale road networks. The preprocessing of the ALT algorithm has some degree of freedom, in that it must select a subset of nodes in the graph, called landmarks, that fulfill a special...

In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according to certain probabilities, and these failure probabilities may depend on the values of one or more hidden variables. This problem may be viewed as a generaliz...

We study the computational complexity of some special partial inverse combinatorial optimization problems where the goal is to change a parameter at minimum cost such that there exists an optimal solution for the underlying combinatorial optimization problem with respect to the modified parameter that does not contain a prespecified set of forbidden elements. We show that the partial inverse pr...

 The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the columngeneration formulation of the vehicle routing problem with time windows (VRPTW) and its variations. The problem is ...