Related papers: Line Planning in Public Transport: Bypassing Line …
Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of…
The arc-routing problems are known to be notoriously hard. We study here a natural arc-routing problem on trees and more generally on bounded tree-width graphs and surprisingly show that it can be solved in a polynomial time. This implies a…
Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source to a target, packets are routed via intermediate waypoints.…
Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into…
Planning a public transit network is a challenging optimization problem, but essential in order to realize the benefits of autonomous buses. We propose a novel algorithm for planning networks of routes for autonomous buses. We first train a…
Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a master problem, and one or more pricing problems (PP). The total computing time taken by the method is…
Platooning allows vehicles to travel with small intervehicle distance in a coordinated fashion thanks to vehicle-to-vehicle connectivity. When applied at a larger scale, platooning will create significant opportunities for energy savings…
In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek routes that guarantee visibility, as this has a sizable impact on the community perceived safety, allowing quick emergency…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest…
We present algorithms for multi-modal route planning in road and public transit networks, as well as in combined networks. Therefore, we explore the nearest neighbor and shortest path problem and propose solutions based on Cover-Trees, ALT…
Recently, with the advancement of the GPS-enabled cellular technologies, the location-based services (LBS) have gained in popularity. Nowadays, an increasingly larger number of map-based applications enable users to ask a wider variety of…
We consider two variational models for transport networks, an urban planning and a branched transport model, in both of which there is a preference for networks that collect and transport lots of mass together rather than transporting all…
Given a collection $L$ of line segments, we consider its arrangement and study the problem of covering all cells with line segments of $L$. That is, we want to find a minimum-size set $L'$ of line segments such that every cell in the…
A metro-line crossing minimization problem is to draw multiple lines on an underlying graph that models stations and rail tracks so that the number of crossings of lines becomes minimum. It has several variations by adding restrictions on…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
We study various versions of the problem of scheduling platoons of autonomous vehicles through an unregulated intersection, where an algorithm must schedule which platoons should wait so that others can go through, so as to minimize the…
Traffic congestion is one of the major challenges faced by the transportation industry. While this problem carries a high economical and environmental cost, the need for an efficient design of optimal paths for passengers in multilayer…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
Pedestrian route choice is a complex, situation- and population-dependent issue. In this contribution an example is presented, where pedestrians can choose among two seemingly similar alternatives. The choice ratio is not even close to…