The purpose of this paper is to present the possibility of replacing physical unit cost in transportation or distribution problems by an aggregate coefficient, getting qualitative and subjective considerations involved. The model for constructing aggregate cost is a two stage multiple attribute decision-making problems. In the first stage supply points, demand points and routes of transportatio...

Modern day routing planners are optimized to find the shortest route. This allows us to travel between two places efficiently. However, traveling is not only a means of transportation between two places but can be a recreational activity. In this work a way of generating bicycle routes that are not only based on distance, but consider other factors as well, is proposed. The additional usage of ...

We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which requests to subcontract to taxis? We call this problem the Day-ahead Paratransit Planning problem. The developed model is a non-standard two-stage integer recourse model. Both stages consist of two consecutive optimization ...

In last decades, mobile factories have been used due to their high production capability, carrying their equipment and covering rough and uneven routes. Nowadays, more companies use mobile factories with the aim of reducing the transportation and manufacturing costs. The mobile factory must travel between the suppliers, visit all of them in each time period and return to the initial location of...

The Pickup and Delivery Problem (PDP) consists in defining a set of routes that satisfy transportation requests between a pickup point and a delivery point. This paper addresses a variant of the PDP where the requests are transportation demands arising from disabled persons. Vehicle passengers can change of vehicle during their trip on specific locations called “transfer points”. Solving this v...

DTN is a relatively new research field and many applications have been identified for it. It is an overlay network working over heterogeneous networks in challenged environments where the links are less reliable and the delays are expected to be very long. Due to the difficult working conditions of DTN, all types of available links are utilized to ensure better delivery of messages including th...

The Modal-Shift Transportation Planning Problem (MSTPP) is the problem that finds a feasible schedule for carriers with the minimum total cost when sets of facilities, delivery orders, and carriers are given. In this paper, we propose a fast steepest descent algorithm to solve the MSTPP. Our solution generates a set of candidate routes for each delivery order as a preprocess. Then, it finds a s...

In this paper, a scheme is outlined within which the autonomous vehicles in an intelligent transportation system exchange information about their environment. Benefiting from each other’s experiences, the vehicles can locally adapt their behaviour in order to perform the desired flexible adjustments of the overall system behaviour. Based on the vehicles’ shared knowledge, an exploration and pla...

The urban transit routing problem (UTRP) consists of finding satisfying routes for public transportation within a city or region. Urban scenarios get bigger and more complex every day, making the design of routes an overwhelming task whose results are often unsatisfactory, with high costs and travel times. We develop an exact MIP formulation and a multi-objective genetic algorithm to solve this...

This work builds upon established Sandia intelligent systems technology to develop a unique approach for the integration of intelligent system control into the U. S. Highway and urban transportation systems. The Sandia developed concept of the COPILOT controller integrates a human driver with computer control to increase human performance while reducing reliance on detailed driver attention. Th...