In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algor...

This paper investigates a multi-period rectilinear distance 1-center location problem considering a line-shaped barrier, in which the starting point of the barrier follows the uniform distribution function. In addition, the existing points are sensitive to demands and locations. The purpose of the presented model is to minimize the maximum barrier distance from the new facility to the existing ...

Interleaving planning and execution is the practical alternative to the problem of planning off-line with large state spaces. While planning via symbolic model checking has been extensively studied for off-line planning, no framework for interleaving it with execution has been ever devised. In this paper, we extend planning via symbolic model checking with the ability of interleaving planning a...

The aim of the current study was to compare the influence of on-line planning and pre-task planning on the performance of EFL university students enjoying different levels of proficiency regarding accuracy, fluency and complexity. To this end a group of 134 EFL learners with different proficiency levels were asked to write narrative tasks under two planning conditions (Pre-task planning and on-...

The motion planning problem for mobile robots is typically formulated as follows: given a robot and a description of an environment, plan a path of the robot between two specified locations, which is collision-free and satisfies certain optimization criteria. Traditionally there are two approaches to the problem: Off-line planning, which assumes perfectly known and stable environment, and on-li...

In this paper, a planning problem is analysed for a consolidation transportation system in order to serve different transportation requests (i.e., orders) with different origins and destinations and different characteristics. The considered transportation system is a railway network provided with innovative terminals (where handling operations are realized very much faster than in traditional t...

The bus line planning problem or transit network design with integrated passenger routing is a challenging combinatorial problem. Although well-known benchmark instances for this have been available decades, the state of art lacks optimal solutions these instances. branch and bound algorithm, presented in paper, introduces three novel concepts to determine solutions: (1) new pool generation met...

We consider the problem of on-line continual planning, in which additional goals may arrive while plans for previous goals are still executing and plan quality depends on how quickly goals are achieved. This is a challenging problem even in domains with deterministic actions. One common and straightforward approach is reactive planning, in which plans are synthesized when a new goal arrives. In...

We propose railway line planning optimization models that determines the frequency of each train so that it can meet passenger origindestination demands while minimizing the related costs. Most line planning models assume that all trains on a supply network stop at all intermediate stations. However to minimize passenger travelling time and provide train service to as many stations as possible,...