Dominique Feillet
Orcid: 0000-0003-1246-223X
According to our database1,
Dominique Feillet
authored at least 75 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
A Guided Insertion Mechanism for Solving the Dynamic Large-Scale Dial-a-Ride Problem.
Proceedings of the 11th International Network Optimization Conference, 2024
2023
A Filtering System for the Large-Scale Dial-A-Ride Problem With Shared Autonomous Vehicles.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023
2022
Transp. Sci., 2022
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
The consistent electric-Vehicle routing problem with backhauls and charging management.
Eur. J. Oper. Res., 2022
A branch-and-price algorithm for a routing problem with inbound and outbound requests.
Comput. Oper. Res., 2022
2021
The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information.
Oper. Res. Forum, 2021
An exact algorithm for the single liner service design problem with speed optimisation.
Int. J. Prod. Res., 2021
2020
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing.
Transp. Sci., 2020
Eur. J. Oper. Res., 2020
EURO J. Transp. Logist., 2020
Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time.
Comput. Oper. Res., 2020
2019
A branch-and-price algorithm for the vehicle routing problem with time windows on a road network.
Networks, 2019
Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows.
Comput. Oper. Res., 2019
Comput. Oper. Res., 2019
2018
Networks, 2018
An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem.
Networks, 2018
Eur. J. Oper. Res., 2018
An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization.
Comput. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
Empirical analysis for the VRPTW with a multigraph representation for the road network.
Comput. Oper. Res., 2017
Ann. Oper. Res., 2017
2016
Transp. Sci., 2016
Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows.
Eur. J. Oper. Res., 2016
2015
Transp. Sci., 2015
Eur. J. Oper. Res., 2015
2014
Networks, 2014
A new consistent vehicle routing problem for the transportation of people with disabilities.
Networks, 2014
Benefits of a truck appointment system on the service quality of inland transport modes at a multimodal container terminal.
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows.
Comput. Oper. Res., 2014
A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration.
4OR, 2014
2011
ACM Trans. Model. Comput. Simul., 2011
SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions.
Eur. J. Oper. Res., 2011
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation.
Comput. Oper. Res., 2011
A simulation approach to evaluate the impact of RFID technologies on a CTO environment.
Proceedings of the Winter Simulation Conference 2011, 2011
Introduction of RFID Technologies in a Manufacturing System - A Discrete Event Simulation Approach.
Proceedings of the SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011
Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem.
Proceedings of the Computational Logistics - Second International Conference, 2011
Proceedings of the Computational Logistics - Second International Conference, 2011
2010
Vehicle routing problems with alternative paths: An application to on-demand transportation.
Eur. J. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem.
Comput. Oper. Res., 2010
Comput. Oper. Res., 2010
4OR, 2010
2009
J. Oper. Res. Soc., 2009
Proceedings of the 2009 Winter Simulation Conference, 2009
Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009
2008
Comput. Oper. Res., 2008
A branch and bound method for the job-shop problem with sequence-dependent setup times.
Ann. Oper. Res., 2008
2007
INFOR Inf. Syst. Oper. Res., 2007
Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming.
INFOR Inf. Syst. Oper. Res., 2007
2006
2005
Transp. Sci., 2005
2004
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.
Networks, 2004
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004
2003
Eur. J. Oper. Res., 2003