Skip to Main content

Researcher identifiers

Keywords

Branch & Bound Graph Coloring Scheduling Sac à dos multidimensionnel Dynamic Problem Consistent Neighbourhood Tabu search 0–1 Multidimensional Knapsack Problem Local Search Branch and bound Frequency Assignment Heuristics Knapsack problem Hybrid mode Search algorithm Queen Graph GRASP Resolution Search Local search Reduced costs
› Full list
Number of documents

53

Michel Vasquez

 

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.

Journal articles22 documents

  • Mirsad Buljubašić, Michel Vasquez, Haris Gavranović. Two-phase heuristic for SNCF rolling stock problem. Annals of Operations Research, Springer Verlag, 2018, 271 (2), pp.1107 - 1129. ⟨10.1007/s10479-017-2550-z⟩. ⟨hal-01936483⟩
  • Mirsad Buljubašić, Michel Vasquez. Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Computers and Operations Research, Elsevier, 2016, 76, pp.12 - 21. ⟨10.1016/j.cor.2016.06.009⟩. ⟨hal-01936500⟩
  • Nicolas Zufferey, Michel Vasquez. A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems. RAIRO - Operations Research, EDP Sciences, 2015, 49 (1), pp.99 - 121. ⟨10.1051/ro/2014027⟩. ⟨hal-01936567⟩
  • Michel Vasquez, Nicolas Zufferey. Consistent Neighborhood Search for Combinatorial Optimization.. ISRN Computational Mathematics, 2012, pp.12. ⟨10.5402/2012/671423⟩. ⟨hal-00814814⟩
  • Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut. A GRASP-Based Approach for Technicians and Interventions Scheduling for Telecommunications.. Annals of Operations Research, Springer Verlag, 2011, 193 (4), pp.143-161. ⟨10.1007/s10479-009-0545-0⟩. ⟨hal-00814781⟩
  • Said Hanafi, Ahmed-Riadh Rebai, Michel Vasquez. Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. Journal of Heuristics, Springer Verlag, 2011, pp.19:645--677. ⟨10.1007/s10732-011-9169-z⟩. ⟨hal-00814716⟩
  • Michel Vasquez, Yannick Vimont, Philippe Michelon. A Multi-Level Search Strategy for the 0-1 Multidimensional Knapsack Problem.. Discrete Applied Mathematics, Elsevier, 2010, 158, pp.97-109. ⟨10.1016/j.dam.2009.08.007⟩. ⟨hal-00814762⟩
  • Sylvain Boussier, Hashimoto Hideki, Michel Vasquez, Christophe Wilbaut. Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications. RAIRO - Operations Research, EDP Sciences, 2009, 43 (4), pp.387-407. ⟨10.1051/ro/2009027⟩. ⟨hal-00842407⟩
  • Audrey Dupont, Andréa Linhares, Christian Artigues, Dominique Feillet, Philippe Michelon, et al.. The Dynamic Frequency Assignment Problem. European Journal of Operational Research, Elsevier, 2008, in press. ⟨10.1016/j.ejor.2008.01.028⟩. ⟨hal-00119537⟩
  • Audrey Dupont, Andréa Carneiro Linhares, Christian Artigues, Dominique Feillet, Philippe Michelon, et al.. The dynamic frequency assignment problem. European Journal of Operational Research, Elsevier, 2008, 195 (1), pp.75-88. ⟨10.1016/j.ejor.2008.01.028⟩. ⟨emse-00429500v2⟩
  • Yannick Vimont, Sylvain Boussier, Michel Vasquez. Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. Journal of Combinatorial Optimization, Springer Verlag, 2008, 15 (2), pp.165-178. ⟨10.1007/s10878-007-9074-4⟩. ⟨hal-00353906⟩
  • Djamal Habet, Michel Vasquez, Yannick Vimont. Bounding the Optimum for the Problem of Scheduling the Photographs of an Agile Earth Observing Satellite. Computational Optimization and Applications, Springer Verlag, 2008. ⟨hal-00353797⟩
  • Michel Vasquez. Coloration des graphes de reines. Comptes rendus de l'Académie des sciences. Série I, Mathématique, Elsevier, 2006, 342 (3), pp.157-160. ⟨10.1016/j.crma.2005.11.022⟩. ⟨hal-00353843⟩
  • Michel Vasquez, Yannick Vimont. Improved results on the 0–1 multidimensional knapsack problem. European Journal of Operational Research, Elsevier, 2005, 165, pp.70-81. ⟨10.1016/j.ejor.2004.01.024⟩. ⟨hal-00353909⟩
  • Michel Vasquez. New Results on the Queens n2 Graph Coloring Problem. Journal of Heuristics, Springer Verlag, 2004, 10 (4), pp.407-413. ⟨10.1023/B:HEUR.0000034713.28244.e1⟩. ⟨hal-00353835⟩
  • Audrey Dupont, Eric Alvernhe, Michel Vasquez. Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation. Annals of Operations Research, Springer Verlag, 2004, 130, pp.179-198. ⟨10.1023/B:ANOR.0000032575.38969.ab⟩. ⟨hal-00353829⟩
  • Vasquez Michel., Dupont Audrey., Djamal Habet. Consistency Checking within Local Search Applied to the Frequency Assignment Problem with Polarization. RAIRO Operations Research, 2004, 37, pp.311--323. ⟨hal-01479586⟩
  • Michel Vasquez, Audrey Dupont, Djamal Habet. Consistency checking within local search applied to the frequency assignment with polarization problem. RAIRO - Operations Research, EDP Sciences, 2003, 37 (4), pp.311-323. ⟨10.1051/ro:2004004⟩. ⟨hal-00353825⟩
  • Michel Vasquez, Jin-Kao Hao. Upper bounds for the SPOT 5 daily photograph scheduling problem. Journal of Combinatorial Optimization, Springer Verlag, 2003, 7 (1), pp.87-103. ⟨hal-00359381⟩
  • Michel Vasquez, Jin-Kao Hao. A Heuristic Approach for Antenna Positioning in Cellular Networks. Journal of Heuristics, Springer Verlag, 2001, 7 (5), pp.443-472. ⟨hal-00359366⟩
  • Michel Vasquez, Jin-Kao Hao. A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Computational Optimization and Applications, Springer Verlag, 2001, 20 (2), pp.137-157. ⟨hal-00359386⟩
  • Michel Vasquez, Jin-Kao Hao. Une approche hybride pour le sac à dos multidimensionnel en variables 0-1. Operation Research, 2001, 35 (4), pp.415-438. ⟨hal-00359374⟩

Conference papers27 documents

  • Ali Yaddaden, Sébastien Harispe, Michel Vasquez, Mirsad Buljubasic. Apprentissage automatique pour l'optimisation combinatoire : Étude du problème du voyageur de commerce. CNIA 2020 - Conférence Nationale en Intelligence Artificielle, Jun 2020, Angers, France. ⟨hal-02884235⟩
  • Jocelyn Poncelet, Pierre-Antoine Jean, Michel Vasquez, Jacky Montmain. Formalisation du concept d’assortiment idéal dans la grande distribution. LFA’2020 - 29èmes Rencontres Francophones sur la Logique Floue et ses Applications, Oct 2020, Sète, France. ⟨hal-02969157⟩
  • Jocelyn Poncelet, Pierre-Antoine Jean, Michel Vasquez, Jacky Montmain. Hierarchical reasoning and knapsack problem modelling to design the ideal assortment in retail. IPMU 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⟩. ⟨hal-02518764⟩
  • Michel Vasquez, Mirsad Buljubasic. Un algorithme hybride pour le problème de découpe de verre de Saint-Gobain. ROADEF2020 - 21e congrès annuel de la société française de recherche opérationnelle et d'aide à la décision, Feb 2020, Montpellier, France. ⟨hal-03113898⟩
  • Michel Vasquez, Mirsad Buljubasic. Consistent Neighbourhood Search for Two-Dimensional Vector Packing. 19eme ROADEF, Feb 2018, Lorient, France. ⟨hal-01953514⟩
  • Rodolphe Giroudeau, Michel Vasquez, Tamara Jovanovic. Lower bound on the logistic ratio objective function for bulk distribution inventory-routing problem. VeRoLog: Vehicle Routing and Logistics optimization, Jun 2016, Nantes, France. ⟨lirmm-01378572⟩
  • Michel Vasquez, Mirsad Buljubasic. Pavage d'un polygone rectilinéaire avec des carrés. 17eme congrès ROADEF, Feb 2016, Compiègne, France. ⟨hal-01951620⟩
  • Michel Vasquez, Mirsad Buljubasic. Consistent Neighborhood Search for Bin Packing. 28th European Conference on Operational Research, Jul 2016, Poznan, Poland. ⟨hal-01953509⟩
  • Raca Todosijević, Rachid Benmansour, Said Hanafi, Nenad Mladenovic, Michel Vasquez. Optimizing the periodic maintenance problem using General Variable neighbourhood search. ROADEF - 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. ⟨hal-00946394⟩
  • Michel Vasquez, Nicolas Zufferey. Consistent Neighborhood Search for Constrained Assignment Problems. 9th International Conference on Modeling, Optimization & SIMulation, Jun 2012, Bordeaux, France. ⟨hal-00728647⟩
  • Said Hanafi, Ahmed-Riadh Rebai, Michel Vasquez. Several versions of the Devour Digest Tidy-up Heuristic for Unconstrained Binary Quadratic Problems. 9th Metaheuristics International Conference, Jul 2011, Italy. ⟨hal-00819831⟩
  • Michel Vasquez, Sylvain Boussier, Said Hanafi, Yannick Vimont, Christophe Wilbaut. Combining Resolution Search and Dynamic Programming for the 0-1 Multidimensional Knapsack Problem.. International Federation of Operational Research Societies, Jul 2011, Australia. ⟨hal-00819826⟩
  • Michel Vasquez, Said Hanafi, Yannick Vimont. Improving the 01 Multi Dimensional Knapsack Bounds. 9th Metaheuristics International Conference, Jul 2011, Italy. ⟨hal-00819834⟩
  • Sylvain Boussier, Michel Vasquez, Yannick Vimont. Amélioration des solutions intermédiaires pour la résolution exacte du sac à dos multidimensionnel en 0–1. 10ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2009, Nancy, France. ⟨hal-00361214⟩
  • Sylvain Boussier, Michel Vasquez, Yannick Vimont, Said Hanafi, Philippe Michelon. Solving the 0–1 Multidimensional Knapsack Problem with Resolution Search. VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Dec 2008, Buenos Aires, Argentina. ⟨hal-00356389⟩
  • Sylvain Boussier, Michel Vasquez, Yannick Vimont, Said Hanafi, Philippe Michelon. Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search. VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Dec 2008, Buenos Aires, Argentina. ⟨hal-00381898⟩
  • Sylvain Boussier, Hideki Hashimoto, Michel Vasquez. A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications. The Seventh Metaheuristics International Conference, Jun 2007, Montréal, Canada. pp.43. ⟨hal-00354433⟩
  • Djamal Habet, Michel Vasquez. Improving Local Search for Satisfiability Problem by Integrating Structural Properties. 2007 IEEE International Conference on Research, Innovation and Vision for the Future, Mar 2007, Hanoï, Vietnam. pp.50-57, ⟨10.1109/RIVF.2007.369135⟩. ⟨hal-00354465⟩
  • Michel Vasquez. On the queen graph coloring problem. 21 st European Conference on Operational Research, Jul 2006, Reykjavik, Iceland. ⟨hal-00354882⟩
  • Sylvain Boussier, Yannick Vimont, Michel Vasquez. Propagation de coûts réduits et énumération implicite pour le problème du sac à dos multidimensionnel en 0-1. Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes - Ecole des Mines d'Alès / France. ⟨inria-00085816⟩
  • Djamal Habet, Audrey Dupont, Michel Vasquez. Voisinage consistant sur des configurations partielles pour la résolution de problèmes réels de grande taille. Premières Journées Francophones de Programmation par Contraintes, CRIL - CNRS FRE 2499, Jun 2005, Lens, pp.439-442. ⟨inria-00000083⟩
  • Michel Vasquez, Audrey Dupont, Djamal Habet. Neighbourhood Design by Consistency Checking. IFORS 2005, Jul 2005, Honolulu Hawaï, United States. ⟨hal-00354823⟩
  • Michel Vasquez, Djamal Habet. Cooperative Approach for the Satisfiability Problem. 17th Triennial Conference of the International Federation of Operational Research Societies IFORS, Jul 2005, Honolulu Hawaï, United States. ⟨hal-00354776⟩
  • Michel Vasquez, Djamal Habet. Complete and Incomplete Algorithms for the Queen Graph Coloring Problem. ECAI 2004: 16th European Conference on Artificial Intelligence, Aug 2004, Valencia, Spain. pp.226-230. ⟨hal-00353904⟩
  • Michel Vasquez. Improved Results on the 0-1 Multi-Knapsack Problem. The sixteenth triennal conference of the International Federation of Operational Research Societies, Jul 2002, Edinburgh, United Kingdom. pp.53. ⟨hal-00361217⟩
  • Djamal Habet, Chu Min Li, Laure Brisoux Devendeville, Michel Vasquez. A Hybrid Approach for SAT. CP 2002 : principles and practice of constraint programming, 2002, Ithaca NY, United States. pp.172-184. ⟨hal-00359416⟩
  • Michel Vasquez, Jin-Kao Hao. A hybrid approach for the 0–1 multidimensional knapsack problem. International Joint Conference on Artificial Intelligence, Aug 2001, Seattle, United States. pp.328-333. ⟨hal-00359413⟩

Book sections3 documents

  • Vasquez Michel., Yannick Vimont. On solving the queen graph coloring problem. IWOCA 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⟩. ⟨hal-01936609⟩
  • Michel Vasquez, Mirsad Buljubašić. A Two-Phase Iterative Search Procedure: The GRASP Method. Metaheuristics, Springer International Publishing, pp.99-114, 2016, 978-3-319-45401-6. ⟨10.1007/978-3-319-45403-0_5⟩. ⟨hal-02923739⟩
  • Michel Vasquez, Audrey Dupont, Djamal Habet. Consistent Neighbourhood in a Tabu Search. Metaheuristics:: Progress as Real Problem Solvers, Springer, pp.369-388, 2006, Operations Research/Computer Science Interfaces Series. ⟨hal-00353924⟩

Preprints, Working Papers, ...1 document

  • Sylvain Boussier, Hideki Hashimoto, Michel Vasquez. A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications. 2007. ⟨hal-00168782⟩