# François Soumis

Back## Cahiers du GERAD

### 163 results — page 1 of 9

The primal simplex algorithm is still one of the most used algorithms by the operations research community. It moves from basis to adjacent one until optimal...

BibTeX referenceDeep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering

The personalized crew rostering problem (CRP) consists of assigning pairings (sequences of flights, deadheads, connections, and rests, forming one or several...

BibTeX reference

The monthly crew pairing problem (CPP) consists of determining a least-cost set of feasible crew pairings (sequences of flights starting and ending at a crew...

BibTeX reference

The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...

BibTeX reference

Overbooking is a common practice in the air cargo industry because booked and actual demands often differ greatly. As a consequence, in case of excessive ove...

BibTeX reference

We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...

BibTeX reference

In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew ...

BibTeX reference

We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under...

BibTeX reference

The primal adjacency-based algorithm and the multi-directional dynamic programming algorithm are two exact methods that have recently been developed to effic...

BibTeX referenceA two-stage solution approach for personalized multi-department multi-day shift scheduling

In this paper, we address a personalized multi-department multi-day shift scheduling problem with a multi-skill heterogeneous workforce where employees can b...

BibTeX reference

The airline crew scheduling problem involves determining schedules for airline crew members such that all the scheduled flights over a planning horizon (usua...

BibTeX referenceA primal adjacency-based algorithm for the shortest path problem with resource constraints

The shortest path problem with resource constraints (SPPRC) is often used as a subproblem within a column generation approach for routing and scheduling prob...

BibTeX reference

The shortest path problem with resource constraints finds the least cost path between two nodes in a network while respecting constraints on resource consump...

BibTeX reference

The airline crew scheduling problem, because of its size and complexity, is usually solved in two phases: the crew pairing problem and the crew assignment pr...

BibTeX reference

Synchronization of workers and vehicles plays a major role in many industries such as logistics, healthcare or airport ground handling. In this paper, we fo...

BibTeX reference

Airline crew scheduling is typically performed in two steps : crew pairing followed by crew assignment. The crew pairing problem (CPP) finds a set of pairing...

BibTeX reference

To solve integer linear programs, primal algorithms follow an augmenting sequence of integer solutions leading to an optimal solution. In this work, we focu...

BibTeX reference

Given a flight schedule and a set of aircraft of different types, the airline fleet assignment problem (FAP) consists of assigning an aircraft type to each f...

BibTeX reference

The tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight...

BibTeX reference

In this paper, we tackle the aircraft conflict resolution problem under uncertainties. We consider errors due to the wind effect, the imprecision on the airc...

BibTeX reference