Multimodal transportation (MMT) refers to a system that utilizes various means of transfer people & goods from one place another. Transit operations are measured as the maximum number passengers can be carried past fixed route, in given period. Investing and using multiple modes does not only bring efficiencies but also goes long way reduce time delay, well overall cost transportation. This...

This work applies the sustainable evaluation to the case of transport and land use planning in urban areas. A set of indicators according the three dimensions of sustainability, environment, economics, and social aspects, are defined to evaluate the mobility in urban areas. The aim of this work is to present a procedure to define a Sustainable Mobility Index in Urban Areas. A set of transports ...

Modern vehicles have an increasing number of advanced features requiring network coverage in order to function properly. In order to facilitate the requirements of such features and allow more advanced applications, we consider the possibility of planning routes that take signal strength into consideration. Previous work have shown the relationship between TCP throughput/goodput and signal stre...

Route planning is a challenging task because it is a combination of theoretically well-defined computational problems on one side, and everyday-life decisions and constraints on the other side. This paper presents an approach to sightseeing route planning using theory of computation. In particular, in this paper we discuss the combination of two well-known computational problems: knapsack and t...

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-depend...

One of the key elements in production planning hierarchy is master production scheduling. The aim of this study is to evaluate and compare thirteen alternative MPS development methods, including multi-objective optimization as well as twelve heuristics, in different operating conditions for multi-product single-level capacity-constrained production systems. We extract six critical criteria from...

Motivated by the success of the translation-based approach for conformant planning, introduced by Palacios and Geffner, we present two variants of a new compilation scheme from conformant probabilistic planning problems (CPP) to variants of classical planning. In CPP, we are given a set of actions – which we assume to be deterministic in this paper, a distribution over initial states, a goal co...

Planning is traditionally associated with the search for sequences of actions spread over time. In this paper we present a component placement problem (CPP), which is concerned with sequences of actions spread in the space of wide-area networks. We argue that, despite the lack of a time component, the CPP is a planning problem. We discuss complexity of the CPP and similarities between the CPP a...

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...