An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes

Scheffler, Martin; Neufeld, Janis S.; Hölscher, Michael

doi:10.1016/j.trb.2020.05.020

Cited by 15 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several methods have been proposed in the literature to answer such a question [12]. The most important ones include exact methods, heuristic methods, population search methods, and local search methods [11,[13][14][15]. Recently, the Bio-Inspired Hybrid approach seems to be quite promising [16].…”

Section: Literature Reviewmentioning

confidence: 99%

A New Approach to the Allocation of Multidimensional Resources in Production Processes

Wikarek

Sitek

2022

Applied Sciences

View full text Add to dashboard Cite

Modern technologies in the field of automation, robotics and IT have significantly changed the face of modern production systems. In particular, the use of AVG, PLC, mobile robots, RFID, IoT, etc. results in modern production processes being characterized by, among others, shortened production cycles and supply chains, reduced production costs, increased product quality and reliability, etc. Moreover, the application of these technologies requires a new definition and methods of using production resources. Most often these are resources that are characterized by many functionalities, the so-called multidimensional resources, which can be configured, remotely controlled, updated, etc., and their use in many cases enables the self-optimization and self-organization of the production system. The article presents the problem of allocation and control of multidimensional resources in production processes. The proprietary formal model of the problem is proposed, as well as how to use it in both proactive and reactive modes. A procedure for reducing the size of the modeled problem is also proposed, the use of which enables a two-fold reduction in the number of constraints and even a fifty-fold reduction in the number of decision variables of the proposed model. This results in an almost hundredfold reduction in computation time for the considered data instances. An original hybrid approach is used to implement the model, which enables the integration of mathematical programming (MP) and programming in constrained logic (CLP). Model data and parameters have been saved as facts.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A New Approach to the Allocation of Multidimensional Resources in Production Processes

Wikarek

Sitek

2022

Applied Sciences

View full text Add to dashboard Cite

show abstract

A Bi-Objective Column Generation Approach for Real-World Rolling Stock Circulation Planning Problems

Päprer,

Neufeld,

Buscher

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG

2023

View full text Add to dashboard Cite

At the scale of Switzerland, the national railway company SBB Cargo AG has to schedule its locomotives and drivers in order to be able to pull all trains. Two objective functions are considered in a two-stage lexicographic fashion: (1) the locomotive and driver costs and (2) the driver time that is spent without driving. As the problem instances tend to reach really big sizes (up to 1900 trains), we propose to schedule locomotives and drivers in a sequential way, thus having a sequence of smaller problems to solve. Moreover, for smaller instances, we also propose to schedule jointly locomotives and drivers in an integrated way, therefore increasing the search space but possibly leading to better solutions. In this paper, we present a mathematical formulation and model for the problem. We also consider the contract-related constraints of the drivers, and we propose a way to integrate some time flexibility in the schedules. Next, we propose an innovative matheuristic to solve the problem, relying on a descent local search and a rolling horizon decomposition. An important goal of this method is to explore thoroughly at which extent a general-purpose solver can be used on this problem. Finally, the benefits of each aspect of the model and of the method are analyzed in detail on the results obtained for 20 real SBB Cargo AG instances.

show abstract

An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes

Cited by 15 publications

References 29 publications

A New Approach to the Allocation of Multidimensional Resources in Production Processes

A New Approach to the Allocation of Multidimensional Resources in Production Processes

A Bi-Objective Column Generation Approach for Real-World Rolling Stock Circulation Planning Problems

A matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG

Contact Info

Product

Resources

About