Issmail El Hallaoui
RetourCahiers du GERAD
54 résultats — page 2 de 3
Solving a real-world multi-period petrol replenishment problem with complex loading constraints
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
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...
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
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
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 BibTeXA game theoretic analysis for community microgrid: Architecture, formulation and optimization
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
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 BibTeXDistributed integral column generation
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
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
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
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
This paper addresses the winner determination problem (WDP) for TL transportation procurement auctions under uncertain shipment volumes and uncertain carrier...
référence BibTeXA 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...
référence BibTeX
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
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 BibTeXIntegral column generation
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
The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...
référence BibTeX
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
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
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