A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG (Q6201534): Difference between revisions

Latest revision as of 19:24, 30 December 2024

scientific article; zbMATH DE number 7807637

Language	Label	Description	Also known as
English	A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG	scientific article; zbMATH DE number 7807637

Statements

instance of

scholarly article

0 references

title

A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG (English)

0 references

published in

OR Spectrum

0 references

publication date

21 February 2024

0 references

zbMATH Keywords

locomotive and driver scheduling

0 references

problem decomposition for sequential optimization

0 references

matheuristics

0 references

lexicographic objectives

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00291-023-00729-9

0 references

cites work

A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations

0 references

A survey on matheuristics for routing problems

0 references

Reducing the number of variables in integer and linear programming problems

0 references

On some matching problems arising in vehicle scheduling models

0 references

Q3525409

0 references

An exact algorithm for the simplified multiple depot crew scheduling problem

0 references

A sequencing approach for creating new train timetables

0 references

Q3523239

0 references

Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer

0 references

Inbound and outbound flow integration for cross-docking operations

0 references

The Column Generation Principle And The Airline Crew Scheduling Problem

0 references

A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution

0 references

TRACS II: a hybrid IP/heuristic driver scheduling system for public transport

0 references

Models and algorithms for integration of vehicle and crew scheduling

0 references

Q4699372

0 references

A heuristic for cumulative vehicle routing using column generation

0 references

Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems

0 references

A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping

0 references

Railway crew scheduling: models, methods and applications

0 references

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

0 references

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

0 references

A graph partitioning strategy for solving large-scale crew scheduling problems

0 references

A distribution network design problem in the automotive industry: MIP formulation and heuristics

0 references

MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry

0 references

A matheuristic for the asymmetric capacitated vehicle routing problem

0 references

A lexicographic minimax approach to the vehicle routing problem with route balancing

0 references

A survey on vertex coloring problems

0 references

Teaching Integer Programming Formulations Using the Traveling Salesman Problem

0 references

Solution approaches for integrated vehicle and crew scheduling with electric buses

0 references

The locomotive assignment problem: a survey on optimization models

0 references

An overview of heuristic solution methods

0 references

The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem

0 references

Learning variable neighborhood search for a scheduling problem with time windows and rejections

0 references

Solving the wire-harness design problem at a European car manufacturer

0 references

A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models

0 references

A flexible system for scheduling drivers

0 references

Scheduled Service Network Design for Freight Rail Transportation

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S00291-023-00729-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6201534

@@ Property / DOI @@
-.1007/s00291-023-00729-9
@@ Property / DOI: 10.1007/s00291-023-00729-9 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S00291-023-00729-9
@@ Property / DOI: 10.1007/S00291-023-00729-9 / rank @@
+Normal rank