42 citations · 82 across the 10 of their papers we have counts for
10 papers
A Deterministic Annealing Local Search for the Electric Autonomous Dial-A-Ride Problem
Yue Su, Jakob Puchinger, Nicolas Dupin
This paper investigates the Electric Autonomous Dial-A-Ride Problem (E-ADARP), which consists in designing a set of minimum-cost routes that accommodates all customer requests for…
A Branch-and-Price Algorithm for the Electric Autonomous Dial-A-Ride Problem
Yue Su, Nicolas Dupin, Sophie N. Parragh +1
The Electric Autonomous Dial-A-Ride Problem (E-ADARP) consists in scheduling a fleet of electric autonomous vehicles to provide ride-sharing services for customers that specify the…
An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem
David Nizard, Nicolas Dupin, Dominique Quadri
In this article, we address a class of non convex, integer, non linear mathematical programs using dynamic programming. The mathematical program considered, whose properties are st…
Polynomial algorithms for p-dispersion problems in a planar Pareto Front
Nicolas Dupin
In this paper, p-dispersion problems are studied to select representative points from a large 2D Pareto Front (PF), solution of bi-objective optimization. Four stand…
Long term planning of military aircraft flight and maintenance operations
Franco Peschiera, Olga Battaïa, Alain Haït +1
We present the Flight and Maintenance Planning (FMP) problem in its military variant and applied to long term planning. The problem has been previously studied for short- and mediu…
Column generation for the discrete Unit Commitment problem with min-stop ramping constraints
Nicolas Dupin
The discrete unit commitment problem with min-stop ramping constraints optimizes the daily production of thermal power plants (coal, gas, fuel units). For this problem, compact Int…
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
This paper is motivated by real-life applications of bi-objective optimization. Having many non dominated solutions, one wishes to cluster the Pareto front using Euclidian distance…
Matheuristics to optimize refueling and maintenance planning of nuclear power plants
Nicolas Dupin, El-Ghazali Talbi
Planning the maintenance of nuclear power plants is a complex optimization problem, involving a joint optimization of maintenance dates, fuel constraints and power production decis…
k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
This paper examines a common extension of k-medoids and k-median clustering in the case of a two-dimensional Pareto front, as generated by bi-objective optimization approaches. A c…
Dual heuristics and new dual bounds to schedule the maintenances of nuclear power plants
Nicolas Dupin, El-Ghazali Talbi
The EURO/ROADEF 2010 Challenge aimed to schedule the maintenance and refueling operations of French nuclear power plants, ranking the approaches in competition for the quality of p…