The crew rostering problem (CRP) for pilots is a complex crew scheduling task assigning pairings, or sequences of flights starting and ending at the same air...

This paper addresses the problem of efficiently routing vehicles for spring sweeping operations in countries that spread sand and gravel on roads in winter. ...

Motivated by our collaboration with an online platform operating in North America, we explore the joint optimization of the order fulfillment process with pe...

We investigate the impact of information asymmetry regarding the producer of remanufactured products on the decisions of a manufacturer and an authorized r...

Blending problems occur when different components are mixed to form an end product. The recipe typically has some flexibility as long as specific quality con...

The procurement of freight services is an important element for the supply chain management of a shipper (i.e., a manufacturer or retailer) that sources tran...

In the multi-commodity two-echelon vehicle routing problem with time windows (MC-2E-VRPTW), first-echelon vehicles transport goods from depots to satellites...

Planners in different industries use optimization software for decision-making. In numerous practical applications, these optimization tools are often not re...

The Fourteenth Montreal Industrial Problem Solving Workshop, held May 13-17, 2024, was jointly organized by the Centre de recherches mathématiques (CRM), the...

This paper addresses the Integrated Electrical Drill Rig Dispatching and Drilling Coordination Problem (IDRDCP) in open-pit mining operations, combining mach...

The routing-and-driving problem for plug-in hybrid electric vehicles (PHEVs) is an extension of the vehicle routing problem with time windows, where routing ...

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

This paper presents a partial outsourcing strategy for the vehicle routing problem with stochastic demands (VRPSD), and routing reoptimization is considered ...

Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....

The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...

Designing efficient evacuation networks is crucial for disaster preparedness, as poorly planned and managed evacuations can increase the time required for ev...

The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...

Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is enco...

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

The Thirteenth Montreal IPSW took place on August 21-25, 2023, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute ...