The Capacitated Arc Routing Problem (CARP) is a combinatorial optimization problem, which requires the identification of such route plans on given graph to number vehicles that generates least total cost. Dynamic CARP (DCARP) variation considers dynamic changes in problem. Artificial Bee Colony (ABC) algorithm an evolutionary was proven be able provide better performance than many other algorit...

A Mobile Ad hoc Network (MANET) is a selfconfigured, infrastructure less network. In MANETs wireless mobile nodes form a dynamic temporary network Due to mobility of nodes routing is a very critical issue in MANETs. Finding and selecting an optimal and reliable path that can exist as long as possible is a complex task. In the process of path selection and path failure, most of the routing proto...

One of the major road transportation problems is route finding. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is a shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation ...

We consider the problem of finding a route that minimises the expected sailing time between two points on the ocean under uncertain weather conditions. This has applications in long distance offshore yacht racing. The uncertainty in the weather is modelled by a branching scenario tree that captures the serial correlation inherent in the evolution of weather systems over time. The stochastic sol...

An emergency requiring evacuation is a chaotic event filled with uncertainties both for the people affected and rescuers. The evacuees are often left to themselves for navigation to the escape area. The chaotic situation increases when a predefined escape route is blocked by a hazard, and there is a need to re-think which escape route is safest. This paper addresses automatically finding the sa...

This paper proposes a unified approach to modeling heterogonous risk-taking behavior in route choice based on the theory of stochastic dominance (SD). Specifically, the first-, second-, and third-order stochastic dominance (FSD, SSD, TSD) are respectively linked to insatiability, risk-aversion and ruin-aversion within the framework of utility maximization. The paths that may be selected by trav...

3D network analysis for indoor provides strong decision support for users in searching optimal routes on applications such as emergency services, transportation, security and visitor guiding. Genetic algorithm is used to solve non-linear problems with complicated constraints. Therefore, the implementation of genetic algorithm into route finding algorithms is needed. This paper explains the dema...

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...