Line Planning with Minimal Traveling Time
نویسندگان
چکیده
An important strategic element in the planning process of public transportation is the development of a line concept, i.e. to find a set of paths for operating lines on them. So far, most of the models in the literature aim to minimize the costs or to maximize the number of direct travelers. In this paper we present a new approach minimizing the travel times over all customers including penalties for the transfers needed. This approach maximizes the comfort of the passengers and will make the resulting timetable more reliable. To tackle our problem we present integer programming models and suggest a solution approach using Dantzig-Wolfe decomposition for solving the LP-relaxation. Numerical results of real-world instances are presented.
منابع مشابه
A Decision Support System for Urban Journey Planning in Multimodal Public Transit Network
The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...
متن کاملDevelopment of an Autonomous Mobile Overhead Traveling Crane with on-line Obstacle Recognition and Path-Planning Based on Obstacle Information -The Design of a Transfer Control System in Consideration of Oscillating Control-
This paper is introduced to be the obstacle recognition, path planning and oscillating control for an automobile crane system on-line. We studied the autonomous mobile overhead traveling crane so for. In particular, the research of obstacle recognition, path plan and oscillating control is carried out. For on-line obstacle recognition, the obstacle recognition system using the ultrasonic sensor...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملScale-Free Navigational Planning by Neuronal Traveling Waves
Spatial navigation and planning is assumed to involve a cognitive map for evaluating trajectories towards a goal. How such a map is realized in neuronal terms, however, remains elusive. Here we describe a simple and noise-robust neuronal implementation of a path finding algorithm in complex environments. We consider a neuronal map of the environment that supports a traveling wave spreading out ...
متن کاملA new heuristic method for solving the bi-objective period trav- eling salesman problem with tour balancing
In the single objective period traveling salesman problem (SOPTSP), each of given n cities has to be visited by the traveling salesman a fixed number of times according to some allowable day combinations over a given m day planning period with the objective to minimize the total traveling distance over the whole period. The existing solution methods for the SOPTSP always generate a set of unbal...
متن کامل