Mohammed Saddoune

Université Hassan II de Casablanca | FSAC · Department of Computer Sciences

The paper addresses a variant of the dial-a-ride problem with additional features. It is referred to as the DARP with driver preferences, which attempts to determine a solution more driver-oriented by designing a short trip in a specific direction that has to be finished at a destination of interest within a restricted time window. For this purpose...

The paper addresses a variant of the Dial-A-Ride problem with additional features. It is referred to as the DARP with driver preferences, which attempts to determine a solution more driver-oriented by designing a short trip in a specific direction that has to be finished at a destination of interest within a restricted time window. For this purpose...

Information retrieval is an important field that aims to provide a relevant document to a user information need, expressed through a query. Arabic is a challenging language that gained much attention recently in the information retrieval domain. To overcome the problems related to its complexity, many studies and techniques have been presented, mos...

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 base) such that each flight is covered once and side constraints are satisfied. This problem has been widely studied but most works have tackled daily or weekly CPP instances with up to 3500 f...

The airline crew scheduling problem is usually solved sequentially in two main steps because of its complexity: the crew pairing followed by the crew assignment. However, finding a globally optimal solution via the sequential approach may be impossible because the decision domain of the crew assignment problem is reduced by decisions made in the pa...

The optimization of Petroleum transport has always been a major concern for oil distribution companies. Dispatching and planning is usually done manually on a daily basis and dispatchers must deal with multiple constraints, lack of resources, shortage risk, time windows, etc. In this paper we develop a model to minimize the cost of delivery and max...

This paper presents a method based on dynamic constraint aggregation concept to solve the monthly crew pairing problem which consists of determining a minimum cost set of feasible pairings such that each flight is covered exactly once and side constraints are satisfied. Given its high complexity, This problem is traditionally decomposed in three pr...

Various disturbances such as adverse weather conditions may result in delayed or canceled flights and affect the optimized schedules planned for airline crew members. In this paper, we solve the recovery problem via an integrated approach to reoptimize both the pairings and the personalized monthly plans. We solve this problem simultaneously for th...

In this paper, we propose a two-phase approach to solve a combined routing and scheduling problem that occurs in the textile industry: fabrics are dyed by dye-jets and transported by forklifts. The objective is to minimize the cost of the unproductive activities, i.e., the dye-jet setup times and the forklift waiting time. The first phase solves an...

The airline crew scheduling problem has received extensive attention, particularly in the last 60 years. This problem is frequently divided into crew pairing and crew assignment because of its large size and the complex safety agreements and contractual rules. Several solution methodologies have been developed, but many objectives and constraints a...

A crew pairing is a sequence of flights, connections and rests that starts and ends at a crew base and is assigned to a single crew. The crew pairing problem consists of determining a minimum cost set of feasible crew pairings such that each flight is covered exactly once and side constraints are satisfied. Traditionally, this problem has been solv...

In this paper we propose a two-phase solution approach to solve a combined routing and scheduling problem occurring in the textile industry where all fabrics are dyed by dye-jets and transported by forklifts. The objective is to minimize the cost of unproductive activities consisting of setup time due to dye-jets cleaning and forklifts waiting time...

Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing problem and a crew assignment problem, both of which are solved sequentially. The first consists of generating a set of least-cost crew pairings (sequences of flights starting and ending at the same crew base) that cover all flights. The second aims at findin...

The integrated crew scheduling (ICS) problem consists of determining, for a set of available crew members, least-cost schedules that cover all flights and respect various safety and collective agreement rules. A schedule is a sequence of pairings interspersed by rest periods that may contain days off. A pairing is a sequence of flights, connections...

The crew pairing problem (CPP) is one step of the airline crew scheduling process. The CPP consists of determining a minimum cost set of feasible pairings such that each flight is covered exactly once and side constraints are satisfied. In the industry, this problem has been traditionally solved by a heuristic three-phase (TP) approach that solves...

"Projet de 9 crédits présenté à l'École de technologie supérieure comme exigence partielle à l'obtention de la maîtrise en génie logiciel". Thèse (M. Ing.)-- École de technologie supérieure, Montréal, 2006. Bibliogr.: f. [60]-61. Chap. 1. Services web : théorie -- Chap. 2. Services web : pratique -- Chap. 3. Performance des services web.

R´esum´e Le probl`eme int´egr´e de la construction des rotations et des blocs mensuels des pilotes consiste `a d´eterminer un ensemble de rotations et de blocs mensuels pour les pilotes tels que chaque segment de vol est couvert par une seule rotation et un seul bloc, et ce, tout en satisfaisant des contraintes suppl´ementaires comme la disponibili...