In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a case study from Rete Ferroviaria Italiana, the Italian Infrastructure Manager. In particular, motivated by our case study, we consider a general quadratic objective function, and propose a new way to linearize it by using a small number of new variables along with a set of constraints that can be separated efficiently by solving an appropriate linear program. The resulting integer linear programming formulation has a continuous relaxation that leads to strong bounds on the optimal value. For the instances in our case study, the solution approach based on this relaxation produces solutions that are much better than those produced by a simple heuristic method currently in use, and that often turn out to be (nearly) optimal
We study the Home Care Problem under uncertainty. Home Care refers to medical, paramedical and social services that may be delivered to patient homes. The term includes several aspects involved in the planning of home care services, such as caregiver-to-patient assignment, scheduling of patient requests, and caregiver routing. In Home Care, cancellation of requests and additional demand for known or new patients are very frequent. Thus, managing demand uncertainty is of paramount importance in limiting service disruptions that might occur when such events realize. We address uncertainty of patient demand over a multiple-day time horizon, when assignment, scheduling and routing decisions are taken jointly, both from a methodological and a computational perspective. In fact, we propose a non-standard cardinality-constrained robust approach, analyse its properties, and report the results of a wide experimentation on real-life instances. The obtained results show that, for instances of moderate size, the approach is able to efficiently determine robust solutions of good quality in terms of balancing among caregivers and number of uncertain requests that can be managed. Also, the robustness of the solutions with respect to possible realizations of uncertain requests, evaluated on a small subset of instances, appears to be significant. Furthermore, preliminary experiments on a decomposition method, obtained from the robust one by fixing the scheduling decisions, show a drastic gain in computational efficiency, with the determination of robust solutions of still good quality. Therefore, the approach appears to be very promising to cope with robustness even on Home Care instances of larger size
Routing real-time traffic with maximum packet delay in contemporary telecommunication networks requires not only choosing a path, but also reserving transmission capacity along its arcs, as the delay is a nonlinear function of both components. The problem is known to be solvable in polynomial time under quite restrictive assumptions, i.e., Equal Rate Allocations (all arcs are reserved the same capacity) and identical reservation costs, whereas the general problem is N P-hard. We first extend the approaches to the ERA version to a pseudopolynomial Dynamic Programming one for integer arc costs, and a FPTAS for the case of general arc costs. We then show that the general problem can be formulated as a mixed-integer Second-Order Cone (SOCP) program, and therefore solved with off-the-shelf technology. We compare two formulations: one based on standard big-M constraints, and one where Perspective Reformulation techniques are used to tighten the continuous relaxation. Extensive computational experi-
In this tutorial, we give an overview of two fundamental problems arising in the optimization of a railway system: the train timetabling problem (TTP), in its non-periodic version, and the train platforming problem (TPP). We consider for both problems the planning stage, i.e. we face them from a tactical point of view. These problems correspond to two main phases that are usually optimized in close sequence by the railway infrastructure manager. First, in the TTP phase, a schedule of the trains in a railway network is determined. A schedule consists of the arrival and departure times of each train at each (visited) station. Second, in the TPP phase, one needs to determine a stopping platform and a routing for each train inside each (visited) station, according to the schedule found in the TTP phase. Due to the complexity of the two problems, an integrated approach is generally hopeless for real-world instances. Hence, the two phases are considered separately and optimized in sequence. Although there exist several versions for both problems, depending on the infrastructure manager and train operators requirements, we do not aim at presenting all of them, but rather at introducing the reader to the topic using small examples. We present models and solution approaches for the two problems in a didactic way and always refer the reader to the corresponding papers for technical details
I n this paper we describe a two-stage optimization model for determining robust rolling stock circulations for passenger trains. Here robustness means that the rolling stock circulations can better deal with large disruptions of the railway system. The two-stage optimization model is formulated as a large mixed-integer linear programming (MILP) model. We first use Benders decomposition to determine optimal solutions for the LP-relaxation of this model. Then we use the cuts that were generated by the Benders decomposition for computing heuristic robust solutions for the two-stage optimization model. We call our method Benders heuristic. We evaluate our approach on the real-life rolling stock-planning problem of Netherlands Railways, the main operator of passenger trains in the Netherlands. The computational results show that, thanks to Benders decomposition, the LP-relaxation of the two-stage optimization problem can be solved in a short time for a representative number of disruption scenarios. In addition, they demonstrate that the robust rolling stock circulation computed heuristically has total costs that are close to the LP lower bounds. Finally, we discuss the practical effectiveness of the robust rolling stock circulation: When a large number of disruption scenarios were applied to these robust circulations and to the nonrobust optimal circulations, the former appeared to be much more easily recoverable than the latter.
Planning a public transportation system is a complex process, which is usually broken down in several phases, performed in sequence. Most often, the trips required to cover a service with the desired frequency (headway) are decided early on, while the vehicles needed to cover these trips are determined at a later stage. This potentially leads to requiring a larger number of vehicles (and, therefore, drivers) that would be possible if the two decisions were performed simultaneously. We propose a multicommodity-flow type model for integrated timetabling and vehicle scheduling. Since the model is large-scale and cannot be solved by off-the-shelf tools with the efficiency required by planners, we propose a diving-type matheuristic approach for the problem. We report on the efficiency and effectiveness of two variants of the proposed approach, differing on how the continuous relaxation of the problem is solved, to tackle real-world instances of bus transport planning problem originating from customers of M.A.I.O.R., a leading company providing services and advanced decision-support systems to public transport authorities and operators. The results show that the approach can be used to aid even experienced planners in either obtaining better solutions, or obtaining them faster and with less effort, or both.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.