Issmail El Hallaoui

Back

Cahiers du GERAD

56 results — page 1 of 3

, , and

This study explores accelerating strategies in column generation (CG) to effectively solve online dial-a-ride problems in large-scale ride-sharing systems. ...

BibTeX reference
, , , , , , and

This paper tackles a complex variant of the unit commitment (UC) problem at Hydro-Quebec, referred to as the transient stability constrained unit commitmen...

BibTeX reference
, , , and

This paper describes a planning problem faced by a fast-growing petroleum company in West Africa. The problem is a complex variant of the petrol station repl...

BibTeX reference
, , and

Efficiently solving a vehicle routing problem (VRP) in a practical runtime is a critical challenge for delivery management companies. This pa...

BibTeX reference
, , , and

The truck loading and inventory routing problems are the two most important decisions made by companies replenishing petrol stations. This paper investigates...

BibTeX reference

Le problème du partitionnement d'ensemble est un problème de programmation en nombres entiers très étudié. Le problème consiste à trouver une partition de tâ...

BibTeX reference
, , and

Incentive-based demand response aggregators are widely recognized as a powerful strategy to increase the flexibility of residential community microgrid (RCM)...

BibTeX reference
, , and

Benders decomposition has been applied significantly to tackle large-scale optimization problems with complicating variables, which, when temporarily fixed, ...

BibTeX reference
, , , , , , , , , , and

Operations research specialists at the OCP Group, the Mohammed VI Polytechnic University, and the Polytechnique Montreal operationalized a system optimizing ...

BibTeX reference
, , , and

Perturbations are universal in supply chains, and their appearance is getting more frequent in the past few years. These perturbations affect industries and ...

BibTeX reference
, , , and

This paper develops an efficient hybrid algorithm to solve the credit scoring problem. We use statistical mathematical programming to develop new classificat...

BibTeX reference
, , and

We consider the problem of minimizing the linear cost of multistate homogeneous series-parallel system given the nonlinear reliability constraint on the syst...

BibTeX reference
, , , , and

This paper presents a multiobjective, mixed-integer linear programming (MILP) model that integrates production scheduling, inventory management, and vessel a...

BibTeX reference
, , , , , and

The parameter configuration problem consists of finding a parameter configuration that provides the most effective performance by a given algorithm. This pap...

BibTeX reference
, , and

For a simple connected graph G, let D(G), Tr(G), DL(G)=Tr(G)D(G), and DQ(G)=Tr(G)+D(G) be the distance matrix, the diagonal m...

BibTeX reference
and

For a graph G, the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) is the adjacency matrix of G and `...

BibTeX reference
, , and

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 reference
, , and

Personnel scheduling aims to determine least-cost personnel schedules to meet the demand for employees in each period of a planning horizon. In this article,...

BibTeX reference
, , , , and

The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...

BibTeX reference
, , , and

Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...

BibTeX reference