| Competitive memetic algorithms for arc routing problems P Lacomme, C Prins, W Ramdane-Cherif Annals of Operations Research 131, 159-185, 2004 | 379 | 2004 |
| A GRASP× ELS approach for the capacitated location-routing problem C Duhamel, P Lacomme, C Prins, C Prodhon Computers & Operations Research 37 (11), 1912-1923, 2010 | 254 | 2010 |
| A genetic algorithm for the capacitated arc routing problem and its extensions P Lacomme, C Prins, W Ramdane-Chérif Workshops on applications of evolutionary computation, 473-483, 2001 | 236 | 2001 |
| Order-first split-second methods for vehicle routing problems: A review C Prins, P Lacomme, C Prodhon Transportation Research Part C: Emerging Technologies 40, 179-200, 2014 | 223 | 2014 |
| A genetic algorithm for a bi-objective capacitated arc routing problem P Lacomme, C Prins, M Sevaux Computers & Operations Research 33 (12), 3473-3493, 2006 | 222 | 2006 |
| Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles P Lacomme, M Larabi, N Tchernev International Journal of Production Economics 143 (1), 24-34, 2013 | 182 | 2013 |
| Lower and upper bounds for the mixed capacitated arc routing problem JM Belenguer, E Benavent, P Lacomme, C Prins Computers & Operations Research 33 (12), 3363-3383, 2006 | 172 | 2006 |
| Evolutionary algorithms for periodic arc routing problems P Lacomme, C Prins, W Ramdane-Chérif European Journal of Operational Research 165 (2), 535-553, 2005 | 158 | 2005 |
| A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem C Duhamel, P Lacomme, A Quilliot, H Toussaint Computers & Operations Research 38 (3), 617-640, 2011 | 149 | 2011 |
| An MILP for scheduling problems in an FMS with one vehicle A Caumond, P Lacomme, A Moukrim, N Tchernev European journal of operational research 199 (3), 706-722, 2009 | 123 | 2009 |
| A memetic algorithm for the job-shop with time-lags A Caumond, P Lacomme, N Tchernev Computers & Operations Research 35 (7), 2331-2356, 2008 | 99 | 2008 |
| Algorithmes de graphes P Lacomme, C Prins, M Sevaux Eyrolles, 2003 | 94 | 2003 |
| Evolutionary algorithms for stochastic arc routing problems G Fleury, P Lacomme, C Prins Workshops on Applications of Evolutionary Computation, 501-512, 2004 | 91 | 2004 |
| An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem M Chassaing, C Duhamel, P Lacomme Engineering Applications of Artificial Intelligence 48, 119-133, 2016 | 68 | 2016 |
| Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product P Lacomme, A Moukrim, A Quilliot, M Vinot International Journal of Production Research 56 (12), 4313-4336, 2018 | 65 | 2018 |
| Efficient frameworks for greedy split and new depth first search split procedures for routing problems C Duhamel, P Lacomme, C Prodhon Computers & Operations Research 38 (4), 723-739, 2011 | 63 | 2011 |
| A MapReduce-based approach for shortest path problem in large-scale networks S Aridhi, P Lacomme, L Ren, B Vincent Engineering Applications of Artificial Intelligence 41, 151-165, 2015 | 58 | 2015 |
| A multi-start split based path relinking (MSSPR) approach for the vehicle routing problem with route balancing P Lacomme, C Prins, C Prodhon, L Ren Engineering Applications of Artificial Intelligence 38, 237-251, 2015 | 54 | 2015 |
| Multiobjective capacitated arc routing problem P Lacomme, C Prins, M Sevaux International Conference on Evolutionary Multi-Criterion Optimization, 550-564, 2003 | 53 | 2003 |
| A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems C Duhamel, P Lacomme, C Prodhon Engineering Applications of Artificial Intelligence 25 (2), 345-358, 2012 | 52 | 2012 |
Aziz MoukrimUniversité de Technologie de Compiègne, Heudiasyc UMR CNRS 7253Verified email at utc.fr
