15 results on '"Corman, Francesco"'
Search Results
2. Automated real-time railway traffic control: an experimental analysis of reliability, resilience and robustness.
- Author
-
Corman, Francesco, Quaglietta, Egidio, and Goverde, Rob M. P.
- Subjects
- *
TRAFFIC engineering , *SUSTAINABLE transportation , *RAILROADS , *RELIABILITY in engineering , *MATHEMATICAL optimization - Abstract
Railway transportation provides sustainable, fast and safe transport. Its attractiveness is linked to a broad concept of service reliability: the capability to adhere to a timetable in the presence of delays perturbing traffic. To counter these phenomena, real-time rescheduling can be used, changing train orders and times, according to rules of thumb, or mathematical optimization models, minimizing delays or maximizing punctuality. In the literature, different indices of robustness, reliability and resilience are defined for railway traffic. We review and evaluate these indices applied to railway traffic control, comparing optimal rescheduling approaches such as Open Loop and Closed Loop control, to a typical First-Come-First-Served dispatching rule, and following the timetable (no-action). This experimental analysis clarifies the benefits of automated traffic control for infrastructure managers, railway operators and passengers. The timetable order, normally used in assessing a-priori reliability, systematically overestimates unreliability of operations that can be reduced by real-time control. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
3. Optimal Scheduling and Routing of Free-range AGVs at Large Scale Automated Container Terminals.
- Author
-
Corman, Francesco, Jianbin Xin, Negenborn, Rudy R., D'Ariano, Andrea, Samà, Marcella, Toli, Alessandro, and Lodewijks, Gabriël
- Subjects
- *
AUTOMATED guided vehicle systems , *SUPPLY chains , *PRODUCTIVITY accounting , *ECONOMIC efficiency , *ROUTING algorithms - Abstract
This work tackles the problem of controlling operations at an automated container terminal. In the context of large supply chains, there is a growing trend for increasing productivity and economic efficiency. New optimization models and algorithms are provided for scheduling and routing equipment that is moving containers in a quay area, loading/unloading ships, transporting them via Automated Guided Vehicles (AGVs) to Automated Stacking Cranes (ASCs), organizing them in stacks. In contrast with the majority of the approaches in the related literature, this work tackles two dynamics of the system, a discrete dynamic, characteristic of the maximization of operations efficiency, by assigning the best AGV and operation time to a set of containers, and a continuous dynamic of the AGV that moves in a geographically limited area. As an assumption, AGVs can follow free range trajectories that minimize the error of the target time and increase the responsiveness of the system. A novel solution framework is proposed in order to tackle the two system dynamics. Various metaheuristic algorithms are tested to solve the problem in a near-optimal way. Computational experiments are presented in order to show the feasibility of the proposed framework on a practical case study, and to assess the performance of advanced scheduling and routing algorithms on numerous system settings. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
4. Susceptibility of optimal train schedules to stochastic disturbances of process times.
- Author
-
Larsen, Rune, Pranzo, Marco, D'Ariano, Andrea, Corman, Francesco, and Pacciarelli, Dario
- Subjects
STOCHASTIC analysis ,RAILROADS ,DISTRIBUTION (Probability theory) ,SCHEDULING ,COMPUTER algorithms ,TRAFFIC engineering - Abstract
This work focuses on the stochastic evaluation of train schedules computed by a microscopic scheduler of railway operations based on deterministic information. The research question is to assess the degree of sensitivity of various rescheduling algorithms to variations in process times (running and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced rescheduling algorithms. Computational results are based on a complex and densely occupied Dutch railway area; train delays are computed based on accepted statistical distributions, and dwell and running times of trains are subject to additional stochastic variations. From the results obtained on a real case study, an advanced branch and bound algorithm, on average, outperforms a First In First Out scheduling rule both in deterministic and stochastic traffic scenarios. However, the characteristic of the stochastic processes and the way a stochastic instance is handled turn out to have a serious impact on the scheduler performance. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
5. An iterative optimization framework for delay management and train scheduling.
- Author
-
Dollevoet, Twan, Corman, Francesco, D'Ariano, Andrea, and Huisman, Dennis
- Subjects
ITERATIVE methods (Mathematics) ,MATHEMATICAL optimization ,RAILROAD trains ,SCHEDULING ,SAFETY regulations - Abstract
Delay management determines which connections should be maintained in case of a delayed feeder train. Recent delay management models incorporate the limited capacity of the railway infrastructure. These models introduce headway constraints to make sure that safety regulations are satisfied. Unfortunately, these headway constraints cannot capture the full details of the railway infrastructure, especially within the stations. We therefore propose an optimization approach that iteratively solves a macroscopic delay management model on the one hand, and a microscopic train scheduling model on the other hand. The macroscopic model determines which connections to maintain and proposes a disposition timetable. This disposition timetable is then validated microscopically for a bottleneck station of the network, proposing a feasible schedule of railway operations. We evaluate our iterative optimization framework using real-world instances around Utrecht in the Netherlands. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
6. Bi-objective conflict detection and resolution in railway traffic management
- Author
-
Corman, Francesco, D’Ariano, Andrea, Pacciarelli, Dario, and Pranzo, Marco
- Subjects
- *
RAILROADS , *TRAFFIC conflicts , *TRAFFIC engineering , *PASSENGERS , *OPERATING companies , *SCHEDULING , *ALGORITHMS , *APPROXIMATION theory - Abstract
Abstract: Railway conflict detection and resolution is the daily task faced by dispatchers and consists of adjusting train schedules whenever disturbances make the timetable infeasible. The main objective pursued by dispatchers in this task is the minimization of train delays, while train operating companies are also interested in other indicators of passenger dissatisfaction. The two objectives are conflicting whenever train delay reduction requires cancellation of some connected services, causing extra waiting times to transferring passengers. In fact, the infrastructure company and the train operating companies discuss on which connection to keep or drop in order to reach a compromise solution. This paper considers the bi-objective problem of minimizing train delays and missed connections in order to provide a set of feasible non-dominated schedules to support this decisional process. We use a detailed alternative graph model to ensure schedule feasibility and develop two heuristic algorithms to compute the Pareto front of non-dominated schedules. Our computational study, based on a complex and densely occupied Dutch railway network, shows that good coordination of connected train services is important to achieve real-time efficiency of railway services since the management of connections may heavily affect train punctuality. The two algorithms approximate accurately the Pareto front in a limited computation time. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
7. Optimal multi-class rescheduling of railway traffic.
- Author
-
Corman, Francesco, D’Ariano, Andrea, Hansen, Ingo A., and Pacciarelli, Dario
- Subjects
TRAIN schedules ,RAILROAD traffic ,TRAFFIC flow ,SCHEDULING ,RAILROAD block system signals - Abstract
Abstract: During real-time traffic management, the railway system suffers perturbations. The task of dispatchers is to monitor traffic flow and to compute feasible rescheduling solutions in case of perturbed operations. The main objective of the infrastructure manager is delay minimization, but the dispatchers also need to comply with the objectives of the train operating companies. This paper presents an innovative optimization framework in order to reschedule trains with different classes of priority, that can be computed statically or dynamically in order to include the needs of different stakeholders. An iterative train scheduling procedure is proposed in order to compute feasible train schedules for an ordered set of priority classes, from the highest one to the lowest one. At each step, the procedure focuses on the current priority class, preserving solution quality from the higher priority classes and neglecting lower priority classes in the optimization of train orders and times. The multi-class rescheduling problem is formulated via alternative graphs that are able to model precisely train movements at the microscopic level of block sections and block signals. Each step of the iterative train scheduling procedure is solved to optimality by a state-of-the-art branch and bound algorithm. The results show an interesting gap between single-class and multi-class rescheduling problems in terms of delay minimization. Each priority class is also evaluated in order to assess the performance of the different rescheduling solutions. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
8. A tabu search algorithm for rerouting trains during rail operations
- Author
-
Corman, Francesco, D’Ariano, Andrea, Pacciarelli, Dario, and Pranzo, Marco
- Subjects
- *
RAILROAD trains , *SEARCH algorithms , *SCHEDULING , *TRAFFIC engineering , *REAL-time control , *JOINT use of railroad facilities , *TRANSPORTATION management system , *RAILROADS - Abstract
Abstract: This paper addresses the problem of train conflict detection and resolution, which is dealt every day by traffic controllers to adapt the timetable to delays and other unpredictable events occurring in real-time. We describe a number of algorithmic improvements implemented in the real-time traffic management system ROMA (Railway traffic Optimization by Means of Alternative graphs), achieved by incorporating effective rescheduling algorithms and local rerouting strategies in a tabu search scheme. We alternate a fast heuristic and a truncated branch and bound algorithm for computing train schedules within a short computation time, and investigate the effectiveness of using different neighborhood structures for train rerouting. The computational experiments are based on practical size instances from a dispatching area of the Dutch railway network and include complex disturbances with multiple late trains and blocked tracks. Several small instances are solved to optimality in order to compare the heuristic solutions with the optimum. For small instances, the new tabu search algorithms find optimal solutions. For large instances, the solutions generated by the new algorithms after 20s of computation are up to more than 15% better than those achieved within 180s by the previous version of ROMA. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
9. Evaluation of green wave policy in real-time railway traffic management
- Author
-
Corman, Francesco, D’Ariano, Andrea, Pacciarelli, Dario, and Pranzo, Marco
- Subjects
- *
RAILROADS , *TRAFFIC engineering , *REAL-time control , *MATHEMATICAL optimization , *TIME perspective , *COMMUNICATIONS industry laws , *AUTOMATIC control systems , *TERMINALS (Transportation) , *LAW - Abstract
Abstract: In order to face the expected growth of transport demand in the next years, several new traffic control policies have been proposed and analyzed both to generate timetables and to effectively manage the traffic in real-time. In this paper, a detailed optimization model is used to analyze one such policy, called green wave, which consists in letting trains wait at the stations to avoid speed profile modifications in open corridors. Such policy is expected to be especially effective when the corridors are the bottleneck of the network. However, there is a lack of quantitative studies on the real-time effects of using this policy. To this end, this work shows a comparison of the delays obtained when trains are allowed or not to change their speed profile in open corridors. An extensive computational study is described for two practical dispatching areas of the Dutch railway network. [Copyright &y& Elsevier]
- Published
- 2009
- Full Text
- View/download PDF
10. Passenger-oriented rescheduling of trains and rolling stock for handling large passenger demand: linearized models with train capacity constraint.
- Author
-
Long, Sihui, Luan, Xiaojie, and Corman, Francesco
- Subjects
- *
RAILROADS , *SCHEDULING , *TRANSPORTATION , *PASSENGERS , *NONLINEAR programming - Abstract
This paper focuses on adjusting the offline-planned schedules for urban rail networks in the case of large passenger demand. We simultaneously reschedule train services, adjust rolling stock plans, and find the best route for passengers in the updated train schedule. The goal is to improve transport performance for passengers and to balance it with operating cost, while respecting operational constraints. A mixed-integer nonlinear programming (MINLP) model is first proposed. Approximate and exact methods are further introduced to reformulate the nonlinear term in the MINLP model, resulting in mixed-integer linear programming (MILP) models. In the models, emergency train services can be added if necessary. Short-turning and stop-pattern adaptation can speed up the circulation of rolling stock (i.e. metro vehicles). Passengers with the same characteristics are gathered into a group, and the passengers of a group may follow different routes, depending on resource availability. Experimental results on a small-scale case study demonstrate the better performance of three exact reformulation methods, i.e. they can find the first feasible solution much faster (within 180 s) and obtain solutions with much higher quality within a certain computation time, in comparison with the other proposed approximate and exact methods. Moreover, the results identify the improved performance of the operation for passengers, up to 13% improvement when properly shortening the headway time and up to 69% if operating emergency trains. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
11. Coordination of scheduling decisions in the management of airport airspace and taxiway operations.
- Author
-
Samà, Marcella, D'Ariano, Andrea, Corman, Francesco, and Pacciarelli, Dario
- Subjects
- *
AIR traffic capacity , *TAXIWAYS , *SCHEDULING , *RUNWAYS (Aeronautics) , *DECISION making - Abstract
This paper addresses the real-time problem of coordinating aircraft ground and air operations in an airport area. At a congested airport, airborne decisions are related to take-off and landing operations, while ground (taxiway) decisions consist of scheduling aircraft movements between the gates and the runways. Since the runways are the initial/terminal points of both decisions, coordinated actions have a great potential to improve the overall performance. However, in the traffic control practice the different decisions are taken by different controllers, at least in large airports. Weak coordination may result in long queues at the runways, with increasing aircraft delays and energy consumption. This paper investigates models, methods and policies for improving the coordination between taxiway scheduling and airborne scheduling. The performance of a solution is measured in terms of delay and travel time, the latter being related to the energy consumption of an aircraft. A microscopic mathematical formulation is adopted to achieve reliable solutions. Exact and heuristic methods have been analysed in combination with the different policies, based on practical-size instances from Amsterdam Schiphol airport, in the Netherlands. Computational experience shows that good quality solutions can be found within limited time, compatible with real-time operations. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
12. Metaheuristics for efficient aircraft scheduling and re-routing at busy terminal control areas.
- Author
-
Samà, Marcella, D’Ariano, Andrea, Corman, Francesco, and Pacciarelli, Dario
- Subjects
- *
FLIGHT , *AIR pilots , *AIRPORT capacity , *AIR traffic capacity , *PETRI nets , *SAFETY , *SCHEDULING - Abstract
Intelligent decision support systems for the real-time management of landing and take-off operations can be very effective in helping air traffic controllers to limit airport congestion at busy terminal control areas. The key optimization problem to be solved regards the assignment of airport resources to take-off and landing aircraft and the aircraft sequencing on them. The problem can be formulated as a mixed integer linear program. However, since this problem is strongly NP-hard, heuristic algorithms are typically adopted in practice to compute good quality solutions in a short computation time. This paper presents a number of algorithmic improvements implemented in the AGLIBRARY solver (a state-of-the-art optimization solver to deal with complex routing and scheduling problems) in order to improve the possibility of finding good quality solutions quickly. The proposed framework starts from a good initial solution for the aircraft scheduling problem with fixed routes (given the resources to be traversed by each aircraft), computed via a truncated branch-and-bound algorithm. A metaheuristic is then applied to improve the solution by re-routing some aircraft in the terminal control area. New metaheuristics, based on variable neighbourhood search, tabu search and hybrid schemes, are introduced. Computational experiments are performed on an Italian terminal control area under various types of disturbances, including multiple aircraft delays and a temporarily disrupted runway. The metaheuristics achieve solutions of remarkable quality, within a small computation time, compared with a commercial solver and with the previous versions of AGLIBRARY. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
13. Control of interacting machines in automated container terminals using a sequential planning approach for collision avoidance.
- Author
-
Xin, Jianbin, Negenborn, Rudy R., Corman, Francesco, and Lodewijks, Gabriël
- Subjects
- *
TRAFFIC accidents , *CONTAINER terminals , *SEQUENTIAL analysis , *SCHEDULING , *INTEGER programming , *LINEAR programming - Abstract
The control of automated container terminals is complex since Quay Cranes (QCs), Automated Guided Vehicles (AGVs) and Automated Stacking Cranes (ASCs) interact intensively for transporting containers, while collision avoidance of equipment must be ensured. This paper proposes a methodology to generate collision-free trajectories of free-ranging AGVs in automated container terminals, while minimizing the makespan of the whole container handling system. A hierarchical control architecture is proposed to integrate the scheduling of interacting machines and trajectory planning of AGVs. Following a so-called overall graph sequence by a scheduler, the collision-free trajectories of AGVs are determined by solving a collection of mixed integer linear programming problems sequentially. Simulation results illustrate the potential of the proposed methodology. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
14. A Decision Support Model for Routing and Scheduling a Fleet of Fuel Supply Vessels
- Author
-
Christiansen, Marielle, Fagerholt, Kjetil, Rachaniotis, Nikolaos P., Tveit, Ingeborg, Øverdal, Marte Viktoria, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Corman, Francesco, editor, Voß, Stefan, editor, and Negenborn, Rudy R., editor
- Published
- 2015
- Full Text
- View/download PDF
15. Optimal scheduling and routing of free-range AGVs at large scale automated container terminals
- Author
-
Gabriel Lodewijks, Marcella Samà, Alessandro Toli, Rudy R. Negenborn, Andrea D'Ariano, Francesco Corman, Jianbin Xin, Corman, Francesco, Xin, Jianbin, Negenborn, Rudy R., D'Ariano, Andrea, Sama', Marcella, Toli, Alessandro, and Lodewijks, Gabriël
- Subjects
Engineering ,Distributed computing ,0211 other engineering and technologies ,Scheduling (production processes) ,Aerospace Engineering ,Trajectory planning ,Context (language use) ,Metaheuristic ,02 engineering and technology ,Metaheuristics ,0502 economics and business ,Simulation ,050210 logistics & transportation ,021103 operations research ,Supply chain management ,business.industry ,Scheduling ,Mechanical Engineering ,05 social sciences ,Container terminal operations ,Free-ranging routing ,Container terminal operation ,Maximization ,System dynamics ,Modeling and Simulation ,Container (abstract data type) ,Automotive Engineering ,Routing (electronic design automation) ,business - Abstract
This work tackles the problem of controlling operations at an automated container terminal. In the context of large supply chains, there is a growing trend for increasing productivity and economic efficiency. New optimization models and algo rithms are provided for scheduling and routing equipment that is moving containers in a quay area, loading/unloading ships, transporting them via Automated Guided Vehicles (AGVs) to Automated Stacking Cranes (ASCs), organizing them in stacks. In contrast with the majority of the approaches in the related literature, this work tackles two dynamics of the system, a dis crete dynamic, characteristic of the maximization of opera tions efficiency, by assigning the best AGV and operation time to a set of containers, and a continuous dynamic of the AGV that moves in a geographically limited area. As an assump tion, AGVs can follow free range trajectories that minimize the error of the target time and increase the responsiveness of the system. A novel solution framework is proposed in order to tackle the two system dynamics. Various metaheuristic algo rithms are tested to solve the problem in a near-optimal way. Computational experiments are presented in order to show the feasibility of the proposed framework on a practical case study, and to assess the performance of advanced scheduling and routing algorithms on numerous system settings., Periodica Polytechnica Transportation Engineering, 44 (3), ISSN:0303-7800, ISSN:1587-3811
- Published
- 2016
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.