The paper describes the mathematical based tools implememented in the MTRAM package, for solving large size crew scheduling problems. A column generation procedure that exploits the subproblem network structure, is presented, based on constrained shortest paths. A heuristic solution approach to large size Set Covering models, based on Lagrangean relaxation, is also presented. Computational results on real life instances are discussed.
Network models, Lagrangean relaxations and subgradient bundle approach in crew scheduling problems
NONATO, Maddalena
1995
Abstract
The paper describes the mathematical based tools implememented in the MTRAM package, for solving large size crew scheduling problems. A column generation procedure that exploits the subproblem network structure, is presented, based on constrained shortest paths. A heuristic solution approach to large size Set Covering models, based on Lagrangean relaxation, is also presented. Computational results on real life instances are discussed.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
