Journal ArticleDOI
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
Reads0
Chats0
TLDR
An Adaptive Large Neighborhood Search (ALNS) algorithm is developed, which can simultaneously handle the network design and line planning problems considering also rolling stock and personnel planning aspects, and is compared with state-of-the-art commercial solvers on a small-size artificial instance.About:
This article is published in Computers & Operations Research.The article was published on 2017-02-01. It has received 86 citations till now. The article focuses on the topics: Network planning and design & Metaheuristic.read more
Citations
More filters
Journal Article
Simultaneous Optimization of Transit Line Configuration and Passenger Line Assignment
TL;DR: This paper presents a model for simultaneous optimization of transit line configuration and passenger line assignment in a general network as a linear binary integer program and can be solved by the standard branch and bound method.
Journal ArticleDOI
Complete hierarchical multi-objective genetic algorithm for transit network design problem
Mahmoud Owais,Mostafa K. Osman +1 more
TL;DR: Genetic Algorithm (GA) is presented as a complete constructive multi-objective algorithm that creates its own routes from scratch then assembles the routes into efficient transit networks to produce the optimal (near optimal) Pareto front solutions.
Journal ArticleDOI
Integrating Lagrangian and Eulerian observations for passenger flow state estimation in an urban rail transit network: A space-time-state hyper network-based assignment approach
TL;DR: A hyper network-based flow assignment model in a generalized least squares estimation framework can provide a rich set of state inferences for advanced transit planning and management applications, for instance, passenger flow control, adaptive travel demand management, and real-time train scheduling.
Journal ArticleDOI
A differential evolution for simultaneous transit network design and frequency setting problem
Ahmed Tarajo Buba,Lai Soon Lee +1 more
TL;DR: A differential evolution approach to address the UTNDP by simultaneously determining the set of transit routes and their associated service frequency with the objective to minimize the passenger cost, as well as the unmet demand is proposed.
Journal ArticleDOI
Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit
TL;DR: The proposed iterative solving procedure is governed by an adaptive large neighborhood search metaheuristic which, at each iteration, calls a branch-and-cut algorithm implemented in Gurobi in order to solve the assignment and network operation problems.
References
More filters
Journal ArticleDOI
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
Stefan Ropke,David Pisinger +1 more
TL;DR: This paper presents a heuristic for the pickup and delivery problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows that is very robust and is able to adapt to various instance characteristics.
Journal ArticleDOI
An algorithmic framework for convex mixed integer nonlinear programs
Pierre Bonami,Lorenz T. Biegler,Andrew R. Conn,Gérard Cornuéjols,Ignacio E. Grossmann,Carl D. Laird,Jon Lee,Andrea Lodi,François Margot,Nicolas Sawaya,Andreas Wächter +10 more
TL;DR: A class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented and Computational results that demonstrate the effectiveness of this framework are reported.
Journal ArticleDOI
A Survey of Optimization Models for Train Routing and Scheduling
TL;DR: A survey of recent optimization models for the most commonly studied rail transportation problems is presented and a classification of models is proposed and their important characteristics are described by focusing on model structure and algorithmic aspects.
Book
Urban Transit : Operations, Planning and Economics
TL;DR: In this paper, the authors introduce theoretical concepts and relationships in transit systems, followed by practical methodologies for operations, planning, and analysis, including transit lines and networks; planning of rail transit station locations; transit agency operations, economics, and marketing; transit fares; financing of transit; transit ownership, regulation, and organization; transit systems planning; analysis, evaluation, and selection of transit modes; and planning and selecting of medium and high-performance transit modes.
Journal ArticleDOI
A survey of very large-scale neighborhood search techniques
TL;DR: This paper surveys three broad classes of very large-scale neighborhood search (VLSN) algorithms: (1) variable-depth methods in which large neighbourhoods are searched heuristically, (2) large neighborhoods in which the neighborhoods are searched using network flow techniques or dynamic programming, and (3) large neighbourhoods induced by restrictions of the original problem that are solvable in polynomial time.