Michel Vasquez
Présentation
Enseignant-Chercheur Euromov DHM, IMT Mines Alès Operations Research and Combinatorial Optimization Qualification and Career 2005 Promoted to Ingénieur Divisionnaire de l’Industrie et des Mines. 2004 Habilitation (Professorship Diploma), University of Science of Avignon, France. 2000 PhD Thesis, University of Angers, prepared at Nîmes LGI2P, France. 1989 Appointed Ingénieur de l’Industrie et des Mines at école des Mines d’Alès, France. 1988 Master (Artificial Intelligence & Image Synthesis), University of Science of St-Etienne, France. Main responsibilities - IT Manager for DRIRE at Ecole de Mines d’Alès site de Rochebelle (1992, ..., 1997) (12 permanent members). - President of the organizing committee of JFPC' 2006 at site EERIE Nîmes France (100 participants). - Director of the LGI2P Lab. (2008, 2009, 2010) (43 members including 28 permanent members). - Supervisor of 4 defended PhD theses and external thesis reviewer of some 10 PhD in France. Publications - 27 international journals and 40 peer-reviewed conference publications. - 3 significant ones : o Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Buljubašić, M., Vasquez, M. 2016 Computers and Operations Research 76, pp. 12-21. o On the queen graphs coloring problem, Vasquez, M. 2006 Comptes Rendus Mathematique 342(3), pp. 157-16. o A hybrid approach for the 0-1 multidimensional knapsack problem, Vasquez, M., Hao, J.-K. 2001 IJCAI International Joint Conference on Artificial Intelligence, pp. 328-333. Awards - 1st prize of the ROADEF/EURO 2021 International Challenge on Grid operation-based outage maintenance Planning, 31st European Conference on Operational Research, July 11-14, 2021, Athens, Greece. - 1st prize of the ROADEF/EURO 2014 International Challenge on Rolling stock unit management on railways sites, IFORS 2014, Barcelona, Spain. - 1st prize of the ROADEF 2001 International Challenge on Frequency assignment with polarization, FRANCORO III, Quebec, Canada*.*
Publications
Publications
A matheuristic for a maintenance planning problem with non-convex objective functionMIC 2024 - 15th Metaheuristic International Conference, Jun 2024, Lorient, France |
|
Une méthode à base d'apprentissage par renforcement pour le problème de tournées de véhicules avec contrainte de capacitéROADEF 2023 - 24ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2023, Rennes, France |
|
|
|
Neural Order-First Split-Second Algorithm for the Capacitated Vehicle Routing Problem5th International Conference on Optimization and Learning (OLA 2022), Jul 2022, Syracuse, Italy. pp.168-185, ⟨10.1007/978-3-031-22039-5_14⟩ |
|
|
Une approche hybride pour la planification des opérations de maintenance du réseau de transport d'électricitéROADEF 2022 - 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France |
|
|
Évaluation empirique des modèles d'apprentissage profond pour le problème de tournées de véhicules avec contrainte de capacitéROADEF 2022 - 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France |
|
|
Formalisation du concept d’assortiment idéal dans la grande distributionLFA’2020 - 29èmes Rencontres Francophones sur la Logique Floue et ses Applications, Oct 2020, Sète, France |
Un algorithme hybride pour le problème de découpe de verre de Saint-GobainROADEF2020 - 21e congrès annuel de la société française de recherche opérationnelle et d'aide à la décision, Feb 2020, Montpellier, France |
|
|
|
Hierarchical reasoning and knapsack problem modelling to design the ideal assortment in retailIPMU 2020 - 18th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Jun 2020, Lisbonne, Portugal. pp.201-214, ⟨10.1007/978-3-030-50146-4_16⟩ |
Apprentissage automatique pour l'optimisation combinatoire : Étude du problème du voyageur de commerceCNIA 2020 - Conférence Nationale en Intelligence Artificielle, Jun 2020, Angers, France |
|
Consistent Neighbourhood Search for Two-Dimensional Vector Packing19eme ROADEF, Feb 2018, Lorient, France |
|
Lower bound on the logistic ratio objective function for bulk distribution inventory-routing problemVeRoLog: Vehicle Routing and Logistics optimization, Jun 2016, Nantes, France |
|
Consistent Neighborhood Search for Bin Packing28th European Conference on Operational Research, Jul 2016, Poznan, Poland |
|
Pavage d'un polygone rectilinéaire avec des carrés17eme congrès ROADEF, Feb 2016, Compiègne, France |
|
Optimizing the periodic maintenance problem using General Variable neighbourhood searchROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France |
|
Two-phase heuristic for SNCF rolling stock problemIFORS 2014 : 20th Conference of the International Federation of Operational Research Societies,, Jul 2014, Barcelona, Spain |
|
|
|
Consistent Neighborhood Search for Constrained Assignment Problems9th International Conference on Modeling, Optimization & SIMulation, Jun 2012, Bordeaux, France |
Combining Resolution Search and Dynamic Programming for the 0-1 Multidimensional Knapsack Problem.International Federation of Operational Research Societies, Jul 2011, Australia |
|
Improving the 01 Multi Dimensional Knapsack Bounds9th Metaheuristics International Conference, Jul 2011, Italy |
|
Several versions of the Devour Digest Tidy-up Heuristic for Unconstrained Binary Quadratic Problems9th Metaheuristics International Conference, Jul 2011, Italy |
|
Amélioration des solutions intermédiaires pour la résolution exacte du sac à dos multidimensionnel en 0–110ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2009, Nancy, France |
|
|
|
Solving the 0-1 Multidimensional Knapsack Problem with Resolution SearchVI ALIO/EURO Workshop on Applied Combinatorial Optimization, Dec 2008, Buenos Aires, Argentina |
Improving Local Search for Satisfiability Problem by Integrating Structural Properties2007 IEEE International Conference on Research, Innovation and Vision for the Future, Mar 2007, Hanoï, Vietnam. pp.50-57, ⟨10.1109/RIVF.2007.369135⟩ |
|
A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for TelecommunicationsThe Seventh Metaheuristics International Conference, Jun 2007, Montréal, Canada. pp.43 |
|
On the queen graph coloring problem21 st European Conference on Operational Research, Jul 2006, Reykjavik, Iceland |
|
|
|
Propagation de coûts réduits et énumération implicite pour le problème du sac à dos multidimensionnel en 0-1Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes - Ecole des Mines d'Alès / France |
Cooperative Approach for the Satisfiability Problem17th Triennial Conference of the International Federation of Operational Research Societies IFORS, Jul 2005, Honolulu Hawaï, United States |
|
|
|
Voisinage consistant sur des configurations partielles pour la résolution de problèmes réels de grande taillePremières Journées Francophones de Programmation par Contraintes, CRIL - CNRS FRE 2499, Jun 2005, Lens, pp.439-442 |
Neighbourhood Design by Consistency CheckingIFORS 2005, Jul 2005, Honolulu Hawaï, United States |
|
|
|
Complete and Incomplete Algorithms for the Queen Graph Coloring ProblemECAI 2004: 16th European Conference on Artificial Intelligence, Aug 2004, Valencia, Spain. pp.226-230 |
Solving the selecting and scheduling satellite photographs problem with a consistent neighborhood heuristicICTAI 2004 - 16th IEEE International Conference on Tools with Artificial Intelligence, Nov 2004, Boca Raton, United States. pp.302-309, ⟨10.1109/ICTAI.2004.110⟩ |
|
Improved Results on the 0-1 Multi-Knapsack ProblemThe sixteenth triennal conference of the International Federation of Operational Research Societies, Jul 2002, Edinburgh, United Kingdom. pp.53 |
|
|
|
A Hybrid Approach for SATCP 2002 : principles and practice of constraint programming, Sep 2002, Ithaca NY, United States. pp.172-184, ⟨10.1007/3-540-46135-3_12⟩ |
|
|
A hybrid approach for the 0–1 multidimensional knapsack problemInternational Joint Conference on Artificial Intelligence, Aug 2001, Seattle, United States. pp.328-333 |
|
|
A Tabu Algorithm for Homogeneous Partition of SamplesMIC’2001 - 4th Metaheuristics International Conference, Jul 2001, Porto, Portugal |
On solving the queen graph coloring problemIWOCA 2017: Combinatorial Algorithms. - Lectures Notes in Computer Science n°10765, Chap. 20. - p. 244-251, 2018, 978-3-319-78825-8. ⟨10.1007/978-3-319-78825-8_20⟩ |
|
A Two-Phase Iterative Search Procedure: The GRASP MethodMetaheuristics, Springer International Publishing, pp.99-114, 2016, 978-3-319-45401-6. ⟨10.1007/978-3-319-45403-0_5⟩ |
|
Consistent Neighbourhood in a Tabu SearchMetaheuristics:: Progress as Real Problem Solvers, Springer, pp.369-388, 2006, Operations Research/Computer Science Interfaces Series |
|
|
A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications2007 |