Caroline Prodhon

According to our database1, Caroline Prodhon authored at least 39 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Fair Sharing Approach for Micro-Services Function Chains Placement in Ultra-Low Latency Services.
IEEE Trans. Netw. Serv. Manag., February, 2024

2023
A Lightweight Heuristic for Micro-Services Placement and Chaining in Low Latency Services.
Proceedings of the 19th International Conference on Network and Service Management, 2023

2022
Leveraging Micro-Services for Ultra-Low Latency: An optimization Model for Service Function Chains Placement.
Proceedings of the 8th IEEE International Conference on Network Softwarization, 2022

2021
An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups.
J. Oper. Res. Soc., 2021

The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach.
Comput. Oper. Res., 2021

2019
Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services.
Algorithms, 2019

2016
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots.
Transp. Sci., 2016

A GRASP × ILS for the vehicle routing problem with time windows, synchronization and precedence constraints.
Expert Syst. Appl., 2016

2015
A relax-and-price heuristic for the inventory-location-routing problem.
Int. Trans. Oper. Res., 2015

A Multi-Start Split based Path Relinking (MSSPR) approach for the vehicle routing problem with route balancing.
Eng. Appl. Artif. Intell., 2015

2014
A survey of recent research on location-routing problems.
Eur. J. Oper. Res., 2014

GRASP for the Vehicle Routing Problem with Time Windows, synchronization and precedence constraints.
Proceedings of the IEEE 10th International Conference on Wireless and Mobile Computing, 2014

A Split based Approach for the Vehicle Routing Problem with Route Balancing.
Proceedings of the ICORES 2014, 2014

An Overview of OR Models for Biomass Supply Chains.
Proceedings of the ICORES 2014, 2014

2013
A Multi-thread GRASPxELS for the Heterogeneous Capacitated Vehicle Routing Problem.
Proceedings of the Hybrid Metaheuristics, 2013

A matheuristic for the truck and trailer routing problem.
Eur. J. Oper. Res., 2013

On the Generalized Elementary Shortest Path Problem: A heuristic approach.
Electron. Notes Discret. Math., 2013

2012
Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking.
Eur. J. Oper. Res., 2012

A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem.
Eng. Appl. Artif. Intell., 2012

A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems.
Eng. Appl. Artif. Intell., 2012

2011
A hybrid evolutionary algorithm for the periodic location-routing problem.
Eur. J. Oper. Res., 2011

A GRASP with evolutionary path relinking for the truck and trailer routing problem.
Comput. Oper. Res., 2011

Efficient frameworks for greedy split and new depth first search split procedures for routing problems.
Comput. Oper. Res., 2011

A Branch-and-Cut method for the Capacitated Location-Routing Problem.
Comput. Oper. Res., 2011

2010
GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots.
Eng. Appl. Artif. Intell., 2010

Metaheuristics for logistics and vehicle routing.
Comput. Oper. Res., 2010

A GRASP×ELS approach for the capacitated location-routing problem.
Comput. Oper. Res., 2010

A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009
Bi-objective Optimization of the Plasmon-assisted Lithography - Design of Plasmonic Nanostructures.
Proceedings of the IJCCI 2009, 2009

An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

Evolutionary Optimization for Plasmon-Assisted Lithography.
Proceedings of the Applications of Evolutionary Computing, 2009

2008
A Memetic Algorithm with Population Management (MA|PM) for the Periodic Location-Routing Problem.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008

2007
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic.
Transp. Sci., 2007

Supply planning under uncertainties in MRP environments: A state of the art.
Annu. Rev. Control., 2007

Solving the capacitated location-routing problem.
4OR, 2007

A Metaheuristic for the Periodic Location-Routing Problem.
Proceedings of the Operations Research, 2007

2006
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem.
Ann. Oper. Res., 2006

Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking.
4OR, 2006

A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006


  Loading...