default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Lacomme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Thierry Garaix
, Philippe Lacomme, Ivan Peña-Arenas:
A label-setting algorithm for the truck driver scheduling problem in accordance with European Community social legislation. Expert Syst. Appl. 242: 122787 (2024)- [j30]Xavier Delorme, Gérard Fleury, Philippe Lacomme, Damien Lamy:
Modelling and solving approaches for scheduling problems in reconfigurable manufacturing systems. Int. J. Prod. Res. 62(7): 2683-2704 (2024) - [c19]Jean-Philippe Gayon, Philippe Lacomme, Oussama Amine:
Job-Shop Scheduling with Robot Synchronization for Transport Operations. MIC (1) 2024: 28-42 - [c18]Katyanne Farias, Philippe Lacomme, Diego Perdigão Martino:
Iterative Heuristic over Periods for the Inventory Routing Problem. MIC (1) 2024: 123-135 - [c17]Gérard Fleury, Philippe Lacomme, Caroline Prodhon:
Indirect Flow-Shop Coding Using Rank: Application to Indirect QAOA. MIC (1) 2024: 203-218 - [c16]Gérard Fleury, Bogdan Vulpescu, Philippe Lacomme:
Quantum Optimization Approach for Feature Selection in Machine Learning. MIC (1) 2024: 281-288 - [i7]Gérard Fleury, Philippe Lacomme:
A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach. CoRR abs/2402.00065 (2024) - [i6]Eric Bourreau, Gérard Fleury, Philippe Lacomme:
Indirect Job-Shop coding using rank: application to QAOA (IQAOA). CoRR abs/2402.18280 (2024) - 2023
- [i5]Gérard Fleury, Philippe Lacomme:
Mathematical Foundations of Quantum Computing for Computer Science Researchers. CoRR abs/2303.01938 (2023) - [i4]Eric Bourreau, Gérard Fleury, Philippe Lacomme:
Indirect Quantum Approximate Optimization Algorithms: application to the TSP. CoRR abs/2311.03294 (2023) - 2022
- [j29]Eric Bourreau, Thierry Garaix, Matthieu Gondran, Philippe Lacomme, Nikolay Tchernev:
A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP). Int. J. Prod. Res. 60(4): 1265-1283 (2022) - [i3]Gérard Fleury, Philippe Lacomme:
A technical note for a Shor's algorithm by phase estimation. CoRR abs/2206.00757 (2022) - [i2]Gérard Fleury, Philippe Lacomme, Christian Prins:
Stochastic Capacitated Arc Routing Problem. CoRR abs/2211.12728 (2022) - [i1]Philippe Lacomme, Christian Prins, Alain Tanguy:
First Competitive Ant Colony Scheme for the CARP. CoRR abs/2212.02228 (2022) - 2021
- [j28]Arthur Kramer, Manuel Iori, Philippe Lacomme:
Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization. Eur. J. Oper. Res. 289(3): 825-840 (2021) - [j27]Philippe Lacomme, Gwénaël Rault, Marc Sevaux:
Integrated decision support system for rich vehicle routing problems. Expert Syst. Appl. 178: 114998 (2021) - [c15]Ivan Peña-Arenas, Thierry Garaix, Philippe Lacomme, Nikolay Tchernev:
A mixed integer programming formulation for the truck drivers scheduling problem considering the European Union drivers rules. CASE 2021: 101-106 - 2020
- [c14]Sylvie Rousset, Deborah Coyault Abele, Maelane Benoit, Rihab Zemni, Philippe Lacomme, Gérard Fleury:
Spontaneous Physical Activity and Sedentary Patterns Analyzed in a General Population of Adults by the eMouve Application. IHIET (Lausanne) 2020: 363-368
2010 – 2019
- 2019
- [j26]Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot:
Integration of routing into a resource-constrained project scheduling problem. EURO J. Comput. Optim. 7(4): 421-464 (2019) - 2018
- [j25]Matthieu Gondran, Marie-José Huguet, Philippe Lacomme, Alain Quilliot, Nikolay Tchernev:
A Dial-a-Ride evaluation for solving the job-shop with routing considerations. Eng. Appl. Artif. Intell. 74: 70-89 (2018) - [j24]Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot:
Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product. Int. J. Prod. Res. 56(12): 4313-4336 (2018) - 2017
- [j23]Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot:
A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution. Eng. Appl. Artif. Intell. 66: 75-86 (2017) - [j22]Romain Guidoux, Martine Duclos, Gérard Fleury, Philippe Lacomme, Nicolas Lamaudière, Damien Saboul, Libo Ren, Sylvie Rousset:
The eMouveRecherche application competes with research devices to evaluate energy expenditure, physical activity and still time in free-living conditions. J. Biomed. Informatics 69: 128-134 (2017) - 2016
- [j21]Maxime Chassaing, Christophe Duhamel, Philippe Lacomme:
An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem. Eng. Appl. Artif. Intell. 48: 119-133 (2016) - [j20]Martine Duclos, Gérard Fleury, Philippe Lacomme, Raksmey Phan, Libo Ren, Sylvie Rousset:
An acceleration vector variance based method for energy expenditure estimation in real-life environment with a smartphone/smartwatch integration. Expert Syst. Appl. 63: 435-449 (2016) - [c13]Jairo Lozano, Luis Carlos González-Gurrola, Eduardo Rodriguez-Tello, Philippe Lacomme:
A Statistical Comparison of Objective Functions for the Vehicle Routing Problem with Route Balancing. MICAI (Special Session) 2016: 130-135 - 2015
- [j19]Philippe Lacomme, Christian Prins, Caroline Prodhon, Libo Ren:
A Multi-Start Split based Path Relinking (MSSPR) approach for the vehicle routing problem with route balancing. Eng. Appl. Artif. Intell. 38: 237-251 (2015) - [j18]Sabeur Aridhi, Philippe Lacomme, Libo Ren, Benjamin Vincent:
A MapReduce-based approach for shortest path problem in large-scale networks. Eng. Appl. Artif. Intell. 41: 151-165 (2015) - 2014
- [j17]Maxime Chassaing, Jonathan Fontanel, Philippe Lacomme, Libo Ren, Nikolay Tchernev, Pierre Villechenon:
A GRASP × ELS approach for the job-shop with a web service paradigm packaging. Expert Syst. Appl. 41(2): 544-562 (2014) - [j16]Romain Guidoux, Martine Duclos, Gérard Fleury, Philippe Lacomme, Nicolas Lamaudière, Pierre-Henri Manenq, Ludivine Paris, Libo Ren, Sylvie Rousset:
A smartphone-driven methodology for estimating physical activities and energy expenditure in free living conditions. J. Biomed. Informatics 52: 271-278 (2014) - [c12]Philippe Lacomme, Caroline Prodhon, Christian Prins, Xavier Gandibleux, Boris Beillevaire, Libo Ren:
A Split based Approach for the Vehicle Routing Problem with Route Balancing. ICORES 2014: 159-166 - [c11]Philippe Lacomme, Libo Ren, Nikolay Tchernev, Benjamin Vincent:
Shortest Path Challenging Problem - Context of Mobile Devices in Urban Area Considering Weakened GPS Signal and Data Network Traffic. ICORES 2014: 393-400 - 2013
- [j15]Philippe Lacomme, Hélène Toussaint, Christophe Duhamel:
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints. Eng. Appl. Artif. Intell. 26(8): 1795-1810 (2013) - [p1]Christophe Duhamel, Christophe Gouinaud, Philippe Lacomme, Caroline Prodhon:
A Multi-thread GRASPxELS for the Heterogeneous Capacitated Vehicle Routing Problem. Hybrid Metaheuristics 2013: 237-269 - 2012
- [j14]Christophe Duhamel, Philippe Lacomme, Caroline Prodhon:
A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems. Eng. Appl. Artif. Intell. 25(2): 345-358 (2012) - 2011
- [j13]Christophe Duhamel, Philippe Lacomme, Alain Quilliot, Hélène Toussaint:
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3): 617-640 (2011) - [j12]Christophe Duhamel, Philippe Lacomme, Caroline Prodhon:
Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4): 723-739 (2011) - [c10]Philippe Lacomme, Nikolay Tchernev, Marie-José Huguet:
Dedicated constraint propagation for Job-Shop problem with generic time-lags. ETFA 2011: 1-7 - 2010
- [j11]Christophe Duhamel, Philippe Lacomme, Christian Prins, Caroline Prodhon:
A GRASP×ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37(11): 1912-1923 (2010)
2000 – 2009
- 2009
- [j10]Anthony Caumond, Philippe Lacomme, Aziz Moukrim, Nikolay Tchernev:
An MILP for scheduling problems in an FMS with one vehicle. Eur. J. Oper. Res. 199(3): 706-722 (2009) - 2008
- [j9]Anthony Caumond, Philippe Lacomme, Nikolay Tchernev:
A memetic algorithm for the job-shop with time-lags. Comput. Oper. Res. 35(7): 2331-2356 (2008) - 2006
- [j8]José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins:
Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33(12): 3363-3383 (2006) - [j7]Philippe Lacomme, Christian Prins, Marc Sevaux:
A genetic algorithm for a bi-objective capacitated arc routing problem. Comput. Oper. Res. 33(12): 3473-3493 (2006) - 2005
- [j6]Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
Evolutionary algorithms for periodic arc routing problems. Eur. J. Oper. Res. 165(2): 535-553 (2005) - [j5]Gérard Fleury, Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc. 56(5): 526-538 (2005) - 2004
- [j4]Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
Competitive Memetic Algorithms for Arc Routing Problems. Ann. Oper. Res. 131(1-4): 159-185 (2004) - [c9]Philippe Lacomme, Christian Prins, Alain Tanguy:
First Competitive Ant Colony Scheme for the CARP. ANTS Workshop 2004: 426-427 - [c8]Gérard Fleury, Philippe Lacomme, Christian Prins:
Evolutionary Algorithms for Stochastic Arc Routing Problems. EvoWorkshops 2004: 501-512 - 2003
- [j3]Michel Gourgand, Philippe Lacomme, Mamadou K. Traoré:
Design of a monitoring environment for manufacturing systems management and optimization. Int. J. Comput. Integr. Manuf. 16(1): 61-80 (2003) - [c7]Philippe Lacomme, Christian Prins, Marc Sevaux:
Multiobjective Capacitated Arc Routing Problem. EMO 2003: 550-564 - 2001
- [j2]Alexandre Dolgui, Philippe Lacomme:
Guest editorial. J. Intell. Manuf. 12(5-6): 407-408 (2001) - [c6]Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions. EvoWorkshops 2001: 473-483 - 2000
- [c5]Michel Gourgand, Philippe Lacomme, Nikolay Tchernev:
Simulation based scheduling with WIP consideration for FMS using trip-based material handling systems. ESM 2000: 481-488
1990 – 1999
- 1999
- [j1]Gérard Fleury, Jean-Yves Goujon, Michel Gourgand, Philippe Lacomme:
Multi-agent approach and stochastic optimization: random events in manufacturing systems. J. Intell. Manuf. 10(1): 81-101 (1999) - 1998
- [c4]Philippe Lacomme, Mamadou K. Traoré:
Modélisation et simulation du système d'information des ateliers de traitement de surfaces: modèle générique orienté objets et approche multi-agents. INFORSID 1998: 131-145 - 1996
- [c3]Jean-Yves Goujon, Philippe Lacomme, Mamadou Kaba Traoré:
A Multi-Agent Simulation Methodology for Manufacturing Systems. ESM 1996: 183-187 - [c2]Jean-Yves Goujon, Philippe Lacomme:
Une structuration du sous-système décisionnel des systèmes industriels de production. INFORSID 1996: 139-158 - [c1]Gérard Fleury, Jean-Yves Goujon, Michel Gourgand, Philippe Lacomme:
Multi-Agents Approach for Manufacturing Systems Optimization. PAAM 1996: 225-244
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
