Axel Parmentier

Axel Parmentier

Auto-generated profile, based on publicly available information

Axel Parmentier

CERMICS, Ecole des Ponts, 77455 Marne-la-Vallée, France

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2024 in Transportation Science
Verified
Journal Article
Closed access
LBLéo Baty
Léo Baty
KJKai Jungel
Kai Jungel
PKPatrick S. Klein
Patrick S. Klein
APAxel Parmentier
Axel Parmentier
MSMaximilian Schiffer
Maximilian Schiffer
With the rise of e-commerce and increasing customer requirements, logistics service providers face a new complexity in their daily planning, mainly due to efficiently handling same-day deliveries. Existing multistage stochastic optimization approaches that allow solving the underlying dynamic vehicle routing problem either are computationally too expensive for an application in online settings or—in the case of reinforcement learning—struggle to perform well on high-dimensional combinatorial problems. To mitigate these drawbacks, we propose a novel machine learning pipeline that incorporates a combinatorial optimization layer. We apply this general pipeline to a dynamic vehicle routing problem with dispatching waves, which was recently promoted in the EURO Meets NeurIPS Vehicle Routing Competition at NeurIPS 2022. Our methodology ranked first in this competition, outperforming all other approaches in solving the proposed dynamic vehicle routing problem. With this work, we provide a comprehensive numerical study that further highlights the efficacy and benefits of the proposed pipeline beyond the results achieved in the competition, for example, by showcasing the robustness of the encoded policy against unseen instances and scenarios. History: This paper has been accepted for the Transportation Science special issue on DIMACS Implementation Challenge: Vehicle Routing Problems. Funding: This work was supported by Deutsche Forschungsgemeinschaft [Grant 449261765].

1 June 2020 in Omega
Verified
Journal Article
Closed access
APAxel Parmentier
Axel Parmentier
FMFrédéric Meunier
Frédéric Meunier

31 May 2017
Verified
Book Chapter
Closed access
PDF file
MKMarkus Kruber
Markus Kruber
MLMarco E. Lübbecke
Marco E. Lübbecke
APAxel Parmentier
Axel Parmentier

1 January 2022 in Operations Research
Verified
Journal Article
Closed access
APAxel Parmentier
Axel Parmentier
Operations research (OR) practitioners are accustomed to dealing with variants of classic OR problems. Indeed, an industrial problem often looks like a traveling salesman problem, a vehicle routing problem, a shortest path problem, etc., but has an additional constraint or a different objective that prevent the use of the powerful algorithms produced by decades of research on the classic OR problems. This situation can be frustrating, notably when we realize that the classic problem catches most of the structure of the variant. In “Learning to approximate industrial problems by operations research classic problems,” Axel Parmentier introduces a machine learning approach to use the algorithms for the classic OR problems on the variant. The idea is to leverage structured learning to obtain a mapping that approximates an instance of the variant by an instance of the classic problem.

1 May 2023 in Transportation Science
Verified
Journal Article
Closed access
APAxel Parmentier
Axel Parmentier
RMRafael Martinelli
Rafael Martinelli
TVThibaut Vidal
Thibaut Vidal
The rise of battery-powered vehicles has led to many new technical and methodological hurdles. Among these, the efficient planning of an electric fleet to fulfill passenger transportation requests still represents a major challenge. This is because of the specific constraints of electric vehicles, bound by their battery autonomy and necessity of recharge planning, and the large scale of the operations, which challenges existing optimization algorithms. The purpose of this paper is to introduce a scalable column generation approach for routing and scheduling in this context. Our algorithm relies on four main ingredients: (i) a multigraph reformulation of the problem based on a characterization of nondominated charging arcs, (ii) an efficient bidirectional pricing algorithm using tight backward bounds, (iii) sparsification approaches permitting to decrease the size of the subjacent graphs dramatically, and (iv) a diving heuristic, which locates near-optimal solutions in a fraction of the time needed for a complete branch-and-price. Through extensive computational experiments, we demonstrate that our approach significantly outperforms previous algorithms for this setting, leading to accurate solutions for problems counting several hundreds of requests. Funding: This work was supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grants 08528/2018-2 and 315361/2020-4], Coordenação de Aperfeiçoamento de Pessoal de Nível Superior [Finance Code 001], and Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro [Grants E-26/010.002232/2019 and E-26/202.790/2019]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.1199 .

26 June 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
APAxel Parmentier
Axel Parmentier
VTVincent T’kIndt
Vincent T’kIndt