Issmail El Hallaoui

Retour

Cahiers du GERAD

54 résultats — page 2 de 3

, , et

In this paper, we solve a rich real-word Multi-Depot Multi-Period Petrol Replenishment Problem with a heuristic based on Branch-and-Price heuristic. The netw...

référence BibTeX
, et

In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), as well as a lower bound on \(GA/\sqrt{\delta}\), in terms of...

référence BibTeX
, et

Personnel scheduling consists of determining least-cost work schedules to cover the demand of multiple jobs expressed in number of employees per job and peri...

référence BibTeX
, , et

Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...

référence BibTeX
, , et

Operations Research (OR) has a very important role to play in credit scoring for building models that can help the lending organization to make a good decisi...

référence BibTeX
, et

Microgrid, a promising component of smart grid, will potentially yield a free electricity market. This paper proposes a novel construction for a community mi...

référence BibTeX
, et

This paper develops an exact method for the redundancy allocation problem (RAP) for multistate homogeneous series-parallel systems. The problem aims to min...

référence BibTeX
, et

The Integral Simplex Using Decomposition (ISUD) algorithm has been developed recently to solve large set partitioning problems (SPPs) in a primal way, i.e.,...

référence BibTeX
, et

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

référence BibTeX
, et

Les problèmes de gestion de personnel visent à déterminer les horaires de travail les moins coûteux pour couvrir la demande d'une ou plusieurs tâches à chaqu...

référence BibTeX
, et

Clustering is the subject of active research in several fields such as operations research, statistics, pattern recognition, and machine learning. The range ...

référence BibTeX
, , et

This paper addresses the winner determination problem (WDP) for TL transportation procurement auctions under uncertain shipment volumes and uncertain carrier...

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, et

Given an integer solution, the integral simplex using decomposition (ISUD) seeks a descent direction that leads to an improved adjacent integer solution. It ...

référence BibTeX
, et

The integral simplex using decomposition (ISUD) algorithm was recently developed to solve efficiently set partitioning problems containing a number of variab...

référence BibTeX
, , et

The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...

référence BibTeX
, et

Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...

référence BibTeX
, et

In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...

référence BibTeX
, , et

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

référence BibTeX