A Set Partitioning Approach to the Crew Scheduling Problem
From MaRDI portal
Publication:4545655
DOI10.1287/opre.47.6.873zbMath1024.90042OpenAlexW2170833051MaRDI QIDQ4545655
Salvatore Ricciardelli, Aristide Mingozzi, Lucio Bianco, Marco Antonio Boschetti
Publication date: 5 November 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.6.873
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Methods of successive quadratic programming type (90C55)
Related Items
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context, Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price, Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models, Public transport for smart cities: recent innovations and future challenges, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, A hybrid soft computing approach for subset problems, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, A dual ascent procedure for the set partitioning problem, A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation, Solving the constrained shortest path problem using random search strategy, The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem, A new method for solving capacitated location problems based on a set partitioning approach, Railway crew scheduling: models, methods and applications, A survey of resource constrained shortest path problems: Exact solution approaches, Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows, A set covering based matheuristic for a real‐world city logistics problem
Uses Software
