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...

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

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

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â...

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

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

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

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

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

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

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

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

For a simple connected graph \(G\), let \(D(G), ~Tr(G)\), \(D^{L}(G)=Tr(G)-D(G)\), and \(D^{Q}(G)=Tr(G)+D(G)\) be the distance matrix, the diagonal m...

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 `...

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...

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,...

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...

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...

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...

The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This pr...

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...

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...

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...

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...

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

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

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

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

Personnel scheduling aims at determining the cheapest work schedules to cover the demand for one or more tasks at each period of a given horizon. During the ...

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

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

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

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

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

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

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

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. ...

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

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

The integral simplex using decomposition (ISUD) algorithm <font size=2>[Zaghrouti, A., Soumis, F., Elhallaoui, I.: Integral simplex using decomposition for t...

Starting from the improved primal simplex (IPS) decomposition, introduced by Elhallaoui et al. (2011) to tackle degeneracy in general linear programs, we int...

This paper develops an efficient method to solve a typical combinatorial optimization problem that is frequently encountered when designing high levels of pr...

We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...

Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...

The buffer sizing problem in unreliable production lines is a complex combinatorial optimization problem. In the formulation of the problem, the system consi...

We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production li...

An unreliable single part type transfer line with fixed inter machine buffer sizes is considered. In general, imperfect machines operating with imperfect raw...

Since the 1970's, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an ...

The integrated crew scheduling (ICS) problem consists of determining, for a set of available crew members, least-cost schedules that cover all flights and re...

Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...

The bidline scheduling problem with equity arises in several North American airlines. It consists of determining anonymous monthly schedules, called bidlines...

Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithm for solving linear programs. It is very efficient wh...

Column generation is often used to solve problems involving set partitioning constraints, such as vehicle routing and crew scheduling problems. When these co...