L'algorithme NCL est conçu pour les problèmes d'optimisation lisse dont les dérivées premières et secondes sont disponibles, y compris les problèmes dont ...

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

This paper presents an algorithm for the identification of parameters for a stochastic hot water end-use process that drives a homogeneous population of ther...

Energy generation has always been a major stake in our economy and is all the more so with the increase in energy demand all over the world. In that context,...

The personalized crew rostering problem (CRP) consists of assigning pairings (sequences of flights, deadheads, connections, and rests, forming one or several...

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

We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...

We study a class of deterministic two-player nonzero-sum differential games where one player uses piecewise-continuous controls to affect the continuously e...

Nous considérons le problème d'un gouvernement qui souhaite promouvoir le remplacement des vieilles voitures par des neuves via un programme de mise à la cas...

Dans cet article, nous étudions la question de la cohérence temporelle des accords de coopération dans les jeux dynamiques à utilité non transférable. Un acc...

Nous représentons une chaîne d'approvisionnement en boucle fermée composée d'un fabricant et d'un détaillant comme un jeu dynamique joué sur un arbre d'évén...

Nous étudions un jeu séquentiel à deux étapes dans un duopole de produits substituables en considérant que les firmes peuvent poursuivre un double objectif...

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

We consider computationally expensive blackbox optimization problems and present a method that employs surrogate models and concurrent computing at the searc...

We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...

Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...

This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...

Generation expansion planning (GEP) is a classical problem that determines an optimal investment plan for existing and future electricity generation technolo...

This work introduces the StoMADS-PB algorithm for constrained stochastic blackbox optimization, which is an extension of the mesh adaptive direct-search (MAD...

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm with the Cross-Entropy (CE) method for non smooth constrained optimizat...