Route Planning Methodology with Four-step Model and Dynamic Assignments

The Four Step Model

Multi - modal Route Planning with Dynamic Public Transport Delays

Route planning with GA

In previous work we proposed a new evolutionary algorithm , GA , which incorporates features of both the classical search algorithm A and genetic algorithms. In this paper we describe the application of GA to a hard opti-misation problem, route planning in complex terrains for Computer Generated Forces (CGF). We report the performance of the algorithm on a large number of route-planning problem...

Dynamic Inventory Planning with Unknown Costs and Stochastic Demand

Generally ordering policies are done by two methods, including fix order quantity (FOQ) and fix order period (FOP). These methods are static and either the quantity of ordering or the procedure of ordering is fixing in throughout time horizon. In real environments, demand is varying in any period and may be considered as uncertainty. When demand is variable in any period, the traditional and st...

Route planning with ordered constraints

Route planning in realistic terrains is a critical task for many autonomous agents such as mobile robots, autonomous vehicles or Computer Generated Forces. The route planning problem is often formulated as one of finding a minimum-cost route between two locations in a digitised map which represents a complex terrain of variable altitude, where the cost of a route is an indication of its quality...