Lacomme Philippe

Prof. Lacomme Philippe

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 March 2014 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
CPChristian Prins
Christian Prins
LPLacomme Philippe
Lacomme Philippe
CPCaroline Prodhon
Caroline Prodhon

23 October 2018 in EURO Journal on Computational Optimization
Verified
Journal Article
Closed access
PDF file
LPLacomme Philippe
Lacomme Philippe
AMAziz Moukrim
Aziz Moukrim
AQAlain Quilliot
Alain Quilliot
MVMarina Vinot
Marina Vinot

1 May 2017 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
RGRomain Guidoux
Romain Guidoux
MDMartine Duclos
Martine Duclos
GFGérard Fleury
Gérard Fleury
LPLacomme Philippe
Lacomme Philippe
NLNicolas Lamaudière
Nicolas Lamaudière
SRSylvie Rousset
Sylvie Rousset

5 November 2019 in Journal on Vehicle Routing Algorithms
Verified
Journal Article
Open access
PDF file
DBD. Brevet
D. Brevet
CDC. Duhamel
C. Duhamel
MIM. Iori
M. Iori
LPLacomme Philippe
Lacomme Philippe
This paper addresses the dial-a-ride problem (DARP) using private vehicles and alternative nodes (DARP-PV-AN). The DARP consists of creating vehicle routes in order to ensure a set of users’ transportation requests. Each request corresponds to a client needing to be transported from his/her origin to his/her destination. Routing costs have to be minimized while respecting a set of constraints like time windows and maximum route length. In the classical DARP, vehicles have to start from a depot and come back to it at the end of their route. In the DARP-PV-AN, the on-demand transportation service can be done either by a public fleet or by clients that use their private vehicles. The use of these vehicles adds more flexibility and unclog the public transportation fleet by allowing clients to organize their own transportation. However, it also raises some privacy concerns. The DARP-PV-AN addresses these concerns and focuses on location privacy, i.e., the ability to prevent the third parties from learning clients’ locations, by keeping both original and final locations private. This is addressed by setting several pickup/delivery nodes for the transportation requests, thus masking the private address. A compact mixed integer linear model is presented, and an evolutionary local search (ELS) is proposed to compute solutions of good quality for the problem. These methods are benchmarked on a modified set of benchmark instances. A new set of realistic instances is also provided to test the ELS in a more realistic way.

26 December 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
EBE. Bourreau
E. Bourreau
TGT. Garaix
T. Garaix
MGM. Gondran
M. Gondran
LPLacomme Philippe
Lacomme Philippe
NTN. Tchernev
N. Tchernev
This paper deals with the Generalised Workforce Scheduling and Routing Problem (GWSRP) where 9 temporal constraints ensuring visit dependencies are all together taken into account and where customer and worker’s quality of service are taken into consideration. A Constraint-Programming based Decomposition Method (CPDM) is proposed, firstly based on a relaxation of coordination constraints and a column generation, and secondly with an iterative insertion of coordination constraint by constraint programming solver. Numerical experiments are achieved on huge instances derived from WSRP benchmark instances with up to 177 customers, 59 vehicles and coordination constraints. The CPDM is able to find nearly optimal solution for medium-size instances and find high-quality solution for huge-size instances whereas CPLEX solver applied to a mixed integer linear model is not able to give a solution in this case.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
CDChristophe Duhamel
Christophe Duhamel
CGChristophe Gouinaud
Christophe Gouinaud
LPLacomme Philippe
Lacomme Philippe
CPCaroline Prodhon
Caroline Prodhon