12 Metaheuristics International Conference XII...

12th Metaheuristics International Conference

XII Metaheurísticas, Algoritmos Evolutivos y Bioinspirados

Barcelona, Spain 4th - 7th July 2017

MIC / MAEB 2017 Barcelona July 4-7, 20172

© Department of Economics and BusinessUniversitat Pompeu FabraR. Trias Fargas 25-27 | 08005Barcelona, Spain

Graphic design:Albert Pares Jimenez

Barcelona june 2017

MIC / MAEB 2017 Barcelona July 4-7, 2017 3

Contents

Welcome . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1MIC 2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2MIC 2017 Committee . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3MAEB 2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4MAEB 2017 Committee . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5Organization Committee . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6Schedule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7Venue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8Useful Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9Keynote Speakers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10Advances and trends in GRASP:from hybridizations to nonmonocity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10Black-Box Solvers In Combinatorial Optimization . . . 11VNS para Planificación Logística . . . . . . . . . . . . . . . . . . . . . . . 12Discussion Panel in Industrial Applications . . . . . . . . . . . 13Special Issues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14Social Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15Sessions and Titles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16!!


WelcomeDear Colleagues and Friends,

Welcome to Barcelona and to the joint MIC’2017/MAEB conferences. It is our great pleasure to have you here and would like to wish you a pleasant stay in this beautiful city and a fruitful conference.

MIC is now in its 12th edition. Since the first unforgettable meeting in Colorado, it has crossed almost all Continents and, in each new edition, has successfully attracted several new researches with extremely interesting research topics. For MIC’2017, we believe that tradition will not change – we will receive again many old friends that have been present in most of this conference’s editions, and younger research-ers that will continue to explore this topic in the future and show its potential, both from a theoretical and a practical point of view.

MAEB 2017 represents the 12th edition of a Spanish con-ference devoted to be a forum for the exchange, discussion and knowledge transference of researchers in the area of Metaheuristics and Evolutionary Algorithms. Since the first meeting in 2002, it has crossed almost all Autonomous Communities in Spain, being the witness of the evolution of the research area. MAEB 2017 covers a wide variety of top-ics, including methodological contributions and applications for problem solving

In MIC 2017/MAEB there will be presentations covering a wide range of subjects – over 200 high quality presenta-tions, enriched by the presence of four keynote speakers: Paola Festa, Rafel Martí, Manuel Laguna, José Andrés Moreno Pérez and a Discussion Panel in Industrial Applica-tions with the collaboration of Mauricio Resende (Amazon), Nuria Oliver (Vodafone), Ricardo Baeza (NTENT), Henning Wagner (Rhenus), Kristof Roomp (Microsof) and Enrique Alfonseca (Google). We are also very grateful to all authors for contributing to the success of the conferences. We hope that this selection will provide each of you with opportuni-ties to exchange research ideas with other colleagues and to start new collaborations.

Barcelona is a multicultural and cosmopolitan city in the south of Europe. If you enjoy culture, sports, good weather, shopping, gastronomy, etc… Barcelona is the city to visit!

At this moment, we would also like to publicly acknowledge the Program Committee Members and Clusters organizer - the high quality of the programs is also due to their strong engagement in the reviewing process. We are also grateful to all sponsors, for the financial support provided, all mem-bers of the organization committee and employees of UPF that without their help will be not possible to organize it, and all colleagues that accept to participate, which greatly enhances the quality of both conferences.

We wish you all a very productive conference and a pleas-ant and fruitful stay in Barcelona.

Abraham Duarte, Universidad Rey Juan CarlosAna Viana, INESC TEC/ISEP, PortugalAngel Juan, Universitat Oberta de CatalunyaBelén Mélian, Universidad de La LagunaHelena Ramalhinho, Universitat Pompeu Fabra.


MIC 2017The 12th edition of the Metaheuristics International Conference (MIC 2017) and the XII Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB 2017) will be held in Barcelona, Spain, from the 4th to 7th July 2017.The MIC conference series was established in 1995 and this is its 12th edition. MIC is the main event focusing on the progress of the area of Metaheuristics and their ap-plications. As in previous editions, MIC 2017 will provide an opportunity to the international research community in Metaheuristics to discuss recent research results, to devel-op new ideas and collaborations, and to meet old and make new friends in a friendly and relaxed atmosphere.

Presentations covering all aspects of Metaheuristic re-search such as new algorithmic developments, industrial applications, new research challenges, theoretical devel-opments, implementation issues, in-depth experimental studies, hybrid metaheuristics, etc. are welcome.

The MIC 2017 will be organized jointly with the MAEB (Metaheurísticas, Algoritmos Evolutivos y Bioinspirados), the most well-known conference in the area of Metaheuris-tics, Evolutionary and Bio-Inspired Algorithms.

Topics of Interest

Topics of interest include, but are not limited to:

— Techniques such as tabu search, simulated annealing, iterated local search, variable neighborhood search, bio-inspired algorithms, memory-based optimization, evo-lutionary algorithms, memetic algorithms, ant colony opti-mization, particle swarm optimization, scatter search, path relinking, hybrid metaheuristics, simheuristics, matheuris-tics, etc. Including techniques that enhance the usability and increase the potential of metaheuristic algorithms such as parallelization of algorithms, reactive search mechanisms for self-tuning, offline metaheuristic algorithm configuration techniques, algorithm portfolios, etc.

— Empirical and Theoretical Research in metaheuris-tics including large-scale experimental analyses, algo-rithm comparisons, new experimental methodologies, engineering methodologies for stochastic local search algorithms, search space analysis, theoretical insights into properties of metaheuristic algorithms. Including applications of well-known and classical problems as Traveling Salesman Problem, Vehicle Routing Problems, Scheduling Problems, Location Problems, etc.

— Industrial Applications of metaheuristics in fields such as transportation, health care, bioinformatics, data min-ing, planning and scheduling, production and operations management, economics, marketing, telecommunica-tions, logistics and supply chains, etc. Particularly, it is welcomed are innovative applications of metaheuristics with high impact in real business and organization.

— Contributions on the Interface of Metaheuristics with other disciplines, such as agent-based models, integer programming, constraint programming, machine learn-ing, deep learning, etc.

— Challenging New Problems such as big data and large-scale optimization problems, multi-objective, sto-chastic, dynamic problems and new challenge problems.


MIC 2017 CommitteeSteering CommitteeFred Glover, University of Colorado and OptTek Systems, USA Celso Ribeiro, Universidade Federal Fluminense, Brazil Éric Taillard, University of Applied Sciences of Western Switzer-land, Switzerland Stefan Voss, University of Hamburg, Germany

Program CommitteeAna Viana (Chair of the Program Committee MIC 2017), INESC TEC/ISEP, PortugalAbdelkader Sbihi, Ecole de Management de Normandie, France Abraham Duarte, Universidad Rey Juan Carlos, Spain Amir Nakib, Université Paris Est, France Andrea Lodi, Università degli Studi di Bologna, Italy Andrea Schaerf, Università degli Studi di Udine, Italy Andreas Reinholz, German Aerospace Center (DLR), Germany Andrei Tchernykh, CICESE Research Center, Mexico Angel A. Juan, Open University of Catalonia, Spain Bruce Golden, University of Maryland, USA Christine Currie, University of Southampton, UK Christine Solnon, INSA de Lyon, France Christoph Laroque, Zwickau University, Germany Daniel Guimarans, Amsterdam University of Applied Sciences, The Netherlands Djamila Ouelhadj, University of Portsmouth, United Kingdom Eduardo Prado, Universidad Politecnica de Madrid, Spain El-Ghazali Talbi, University of Lille, France Erwin Pesch, Universität Siegen, Germany Fabien Lehuédé, École des Mines de Nantes, France Farouk Yalaoui, Université Technologique de Troyes, France Francisco Rodriguez, Universidad de Granada, Spain Geir Hasle, SINTEF, Norway Graham Kendall, University of Nottingham, United Kingdom Guenther Raidl, TU Wien, Austria Helena Ramalhinho, Universitat Pompeu Fabra, Spain Ibrahim Osman, American University of Beirut, Lebanon Jacek Blazewicz, University of Poznan, Poland Jacques Teghem, Université de Mons, Belgium Jairo Montoya-Torres, Universidad de Los Andes, Colombia Jakob Puchinger, Austrian Institute of Technology, Austria Javier Faulin, Universidad Pública de Navarra, Spain Jin-Kao Hao, University of Angers, France Johann Hurink, University of Twente, Netherlands Jorge E. Mendoza, Université de Tours, France José Fernando Oliveira, Universidade do Porto/INESC TEC, Portugal Karl Dörner, Johannes Kepler University Linz, Austria Kenneth Sörensen, Universiteit Antwerpen, Belgium Laetitia Jourdan, University of Lille 1, INRIA Lille, France Lionel Amodeo, Université Technologique de Troyes, France

Luca Di Gaspero, Università degli Studi di Udine, Italy Lyes Benyoucef, University of Marseille, France Marc Sevaux, Université de Bretagne-Sud, France Marco Caserta, Universität Hamburg, Germany Marco Chiarandini, Syddansk Universitet, Denmark Mario Pavone, University of Catania, Italy Markus Rahe, Technical University Dortmund, Germany Martin Gomez-Ravetti, Universidade Federal de Minas Gerais, Brazil Matthias Prandtstetter, Austrian Institute of Technology, Austria Mauricio Resende, Amazon, USA Mauro Dell’Amico, Università degli Studi di Modena e Reggio Emilia, Italy Michael Trick, Carnegie Mellon, University USA Michel Gendreau, École Polytechnique de Montréal, Canada Mutsunori Yagiura, Nagoya University, Japan Nenad Miadenovic, LAMIH, University of Valenciennes, France Nicolas Monmarché, Université de Tours, France Nicolas Zufferey, University of Geneva, Switzerland Noureddine Melab, University of Lille, France Nysret Musliu, Technische Universität Wien, Austria Paola Festa, Università degli Studi di Napoli, Italy Paolo Toth, Università degli Studi di Bologna, Italy Pascal Van Hentenryck, NICTA and University of Melbourne, Australia Patrick DeCausmaecker, University of Gent, Belgium Patrick Hirsch, University of Natural Resources and Life Scienc-es, Austria Patrick Siarry, Université Paris-Est Créteil, France Peter Greistorfer, Karl-Franzens-Universität Graz, Austria Rachid Chelouah, EISTI Cergy-Pontoise, France Rachid Ellaia, EMI Univeristy Agdal, Morocco Rafael Martí, Universitat de València, Spain Rhyd Lewis, Cardiff University, United Kingdom Richard Hartl, Universität Wien, Austria Rubén Ruiz, Universidad Politécnica de Valencia, Spain Silvano Martello, Università degli Studi di Bologna, Italy Simona Martins, Universidade Federal Fluminense, Brazil Sophie N. Parragh, Vienna University of Economics and Busi-ness, Austria Thomas Jansen, University College Cork, Ireland Thomas Stützle, Université Libre de Bruxelles, Belgium Tommaso Urli, Università degli Studi di Udine, Italy Vittorio Maniezzo, Università degli Studi di Bologna, Italy Walter Gutjahr, Universität Wien, Austria


MAEB 2017XII Congreso Español de Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB 2017)El congreso nacional sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB) pretende ser un foro de encuentro, discusión y transferencia de conocimiento entre investigadores en el campo de las metaheurísticas y los al-goritmos bioinspirados, con el fin de presentar e intercam-biar experiencias y resultados. La XII edición, MAEB’2017, se celebrará en Barcelona, junto con XII Metaheuristic International Conferrence (MIC 2017).

TemasSon trabajos de interés en este congreso los que aborden alguna de las siguientes metodologías de resolución de problemas de optimización (las siglas corresponden a su denominación original en inglés) o sus aplicaciones a la resolución de problemas:

ACO: Algoritmos basados en colonias de hormigasCE: Entropía cruzadaCLA: Algoritmos de clasificación y aprendizajeCP: Programación por restriccionesCH: Heurísticas cooperativasDE: Evolución diferencialECO: Computación evolutivaEDA: Algoritmos basados en estimación de distribucionesEE: Estrategias evolutivasEP: Programación evolutivaFMH: Metaheurísticas basados en lógica difusaGA: Algoritmos genéticosGLS: Búsqueda local guiadaGP: Programación genéticaGRASP: Procedimientos voraces aleatorizadosHA: Algoritmos híbridos

HH: HyperheurísticasILS: Búsqueda local iteradaIS: Algoritmos basados en el sistema inmunitarioMA: Algoritmos meméticosMOMH: Metaheurísticas multiobjetivoMTH: MateheurísticasNC: Computación naturalNN: Redes NeuronalesPA: Algoritmos paralelos y distribuidosPR: Re-encadenamiento de trayectoriasPSO: Algoritmos basados en nubes de partículasSA: Enfriamiento simuladoSI: Algoritmos basados en sociedades/enjambresSS: Búsqueda dispersaTS: Búsqueda tabúVNS: Búsqueda de entornos variable


MAEB 2017 CommitteeSteering CommitteeEnrique Alba, Universidad de Málaga Abraham Duarte, Universidad Rey Juan Carlos Francisco Fernández, Universidad de Extremadura José Antonio Gámez, Universidad de Castilla la Mancha Francisco Herrera, Universidad de Granada César Hervás, Universidad de Córdoba J. Ignacio Hidalgo, Universidad Complutense de Madrid Rafael Martí, Universidad de Valencia Juan Julián Merelo, Universidad de Granada José A. Moreno, Universidad de La Laguna Luciano Sánchez, Universidad de Oviedo

Program Committee Belén Mélian (Chair of the Program Committee MAEB 2017), Universidad de La Laguna Abraham Duarte, Universidad Rey Juan Carlos Ada Álvarez, Universidad Autónoma de Nuevo León Alberto Fernández, University of Granada Alejandro Rosete-Suárez, Instituto Superior Politécnico “José Antonio Echevarría”, CUJAE Alexander Mendiburu, The University of the Basque Country Álvaro Rubio-Largo, Universidad de Extremadura Amelia Zafra, Universidad de Córdoba Ana Viana, INESC Porto/ISEP Angel Juan, Open University of Catalonia Ángel Corberán, Universidad de Valencia Ángel Udías, Universidad Rey Juan Carlos Anna Esparcia, Universidad Politécnica de Valencia Antonio González, Universidad de Granada Antonio Mora-García, Universidad de Granada Antonio Peregrín, Universidad de Huelva Antonio J. Nebro, Universidad de Málaga Antonio J. Fernández, Universidad de Málaga Belen Melian, Universidad de La Laguna Bernabé Dorronsoro, Universidad de Cádiz Carlos García, Universidad de Córdoba Carlos Cotta, Universidad de Málaga Carlos A. Coello, CINVESTAV-IPN Carlos Andrés Romano, Universidad Politécnica de Valencia Cesar Hervás, Universidad de Córdoba Christian Blum, Consejo Superior de Investigaciones Científicas Christopher Expósito-Izquierdo, Universidad de La Laguna Daniel Molina, Universidad de Cádiz Dario Landa-Silva, The University of Nottingham David Camacho, Universidad Autónoma de Madrid David Pelta, Universidad de Granada David L. González-Álvarez, Universidad de Extremadura Eduardo G. Pardo, Universidad Politécnica de Madrid Enrique Alba, Universidad de Málaga

first name last name, organization Francisco Luna, Universidad de Málaga Francisco Parreño, Universidad de Castilla-La Mancha Francisco Chicano, Universidad de Málaga Francisco Chavez, Universidad de Extremadura Francisco Fernández, Universidad de Extremadura Francisco Almeida, Universidad de La Laguna Francisco Herrera, Universidad de Granada Francisco Javier Elorza, Universidad Politécnica de Madrid Gabriel Villa, Universidad de Sevilla Gabriel Winter, Universidad de las Palmas de Gran Canaria Gabriel J. Luque, Universidad de Málaga Helena Ramalhinho, Universitat Pompeu Fabra Isaac Triguero, The University of Nottingham J. Marcos Moreno, Universidad de La Laguna Jaume Bacardit, The University of Nottingham Javier Faulin, Universidad Pública de Navarra Javier Sánchez-Monedero, Universidad de Córdoba Jesús Sánchez-Oro, Universidad Rey Juan Carlos Jesús Aguilar, Universidad Pablo de Olavide Joaquín Pacheco, Universidad de Burgos Joaquín Bautista, Universitat Politècnica de Catalunya Jorge Casillas, Universidad de Granada José Egea, Universidad Politécnica de Cartagena José Otero, Universidad de Oviedo José Riquelme, Universidad de Sevilla Jose A. Lozano, Universidad del País Vasco José A. Moreno, Universidad de La Laguna José Antonio Gámez, Universidad de Castilla-La Mancha José Ignacio Hidalgo, Universidad Complutense de Madrid Jose Luis Risco-Martín, Universidad Complutense de Madrid José Luis González-Velarde, Tecnológico de Monterrey José Luis Verdegay, Universidad de Granada José M. Granado-Criado, Universidad de Extremadura José Manuel Cadenas, Universidad de Murcia José Manuel Colmenar, Universidad Rey Juan Carlos José Manuel Benítez, Universidad de Granada José María Luna, Dept. of Computer Science and Numerical Analysis José Miguel Puerta, Universidad de Castilla-La Mancha Josep M. Garrell, Universitat Ramon Llull Juan Lanchares, Universidad Complutense de Madrid Juan Villegas, Universidad Autónoma Metropolitana Juan A. Gómez, Universidad de Extremadura Juan J. Pantrigo, Universidad Rey Juan Carlos Juan Julián Merelo, Universidad de Granada Juan R. Rabuñal, Universidade da Coruña Julián Dorado, Universidade da Coruña Julián Molina, Universidad de Málaga Julio Brito, Universidad de La Laguna


Julio Ortega, Universidad de GranadaJulio R. Banga, Consejo Superior de Investigaciones CientíficasLeonardo Trujillo, Instituto Tecnológico de TijuanaLourdes Araujo, UNEDLuciano Sánchez, Universidad de OviedoLuis de La Ossa, Universidad de Castilla-La ManchaLuis Magdalena, Universidad Politécnica de MadridM. Elena Pérez, Universidad de ValladolidManuel Laguna, University of ColoradoManuel Lozano, Universidad de GranadaMaria Albareda, Universidad Politécnica de CataluñaMaría Pérez-Ortíz, Universidad de CórdobaMaría Del Carmen Pegalajar, Universidad de GranadaMaría José Del Jesús, Universidad de JaénMario Garcia, Instituto Tecnológico de TijuanaMiguel Ángel-Vega, Universidad de ExtremaduraNicolás García, University of CórdobaOscar Cordón, Universidad de GranadaPablo Moscato, The University of NewcastlePedro Larrañaga, Universidad Politécnica de MadridPedro González, Universidad de JaénPedro Villar, Universidad de GranadaPedro A. Castillo, Universidad de GranadaPedro Antonio Gutiérrez, Universidad de CordobaRafael Martí, Universidad de ValenciaRafael Caballero, Universidad de MálagaRafael M. Luque-Baena, Universidad de ExtremaduraRamón Álvarez-Valdés, Universidad de ValenciaRaúl Giraldez, Universidad Pablo de OlavideRichard Duro, Universidade da CoruñaRoberto Santana, Universidad del País VascoRoger Ríos, Universidad Autónoma de Nuevo LeónRubén Ruiz, Universidad Politécnica de ValenciaSalvador García, Universidad de GranadaSancho Salcedo, Universidad de AlcaláSebastián Ventura, Department of Computer Sciences and Numerical AnalysisSergio Santander-Jiménez, Universidad de ExtremaduraSergio Damas, European Centre for Soft ComputingThomas Stützle, Université Libre de Bruxelles (ULB)Vicente Campos, Universidad de ValenciaVíctor Rivas, Universidad de JaénYago Sáez, Universidad Carlos III de Madrid

Organization CommitteeConference ChairsAbraham Duarte (URJC – Universidad Rey Juan Carlos)Angel A. Juan (UOC – Universitat Oberta de Catalunya)Helena Ramalhinho Lourenço (UPF – Universitat Pompeu Fabra)

Local Committee ChairsJésica de Armas (UPF – Universitat Pompeu Fabra)Montserrat Guillem (UB – Universitat de Barcelona)

Special Issues ChairChristian Blum (CSIC-Spanish National Research Council)

Social Media ChairÀlex Grasas (EADA Business School)Vera Pujadas

Proceedings and Posters ChairsAlejandra Cabañas (UAB – Universitat Autonoma de Barcelona)Carles Serrat (UPC – Barcelona Tech)Isabel Serra (CRM – Centre de Recerca Matematica)Maria Albareda(UPC – Barcelona Tech)

Organization TeamAdela Pagés (UdL – Universitat de Lleida)Carlos Quintero (UOC – Universitat Oberta de Catalunya)Eduardo García Pardo (UPM – Universidad Politécnica de Madrid)Eliana González (UOC – Universitat Oberta de Catalunya)Elisa Alós (UPF – Universitat Pompeu Fabra)Fatos Xhafa (UPC – Barcelona Tech)Gema Calleja (UPC – Barcelona Tech)Javier Panadero (UOC – Universitat Oberta de Catalunya)Jesús Sánchez-Oro Calvo (URJC – Universidad Rey Juan Carlos)José Manuel Colmenar Verdugo (URJC – Universidad Rey Juan Carlos)Laura Calvet (UOC – Universitat Oberta de Catalunya)Lorena Reyes (UOC – Universitat Oberta de Catalunya)Marcelus Fabri (UPF – Universitat Pompeu Fabra)Sara Hatami (UOC – Universitat Oberta de Catalunya)Stephanie Alvarez (UOC – Universitat Oberta de Catalunya)Thays Oliveira (UPF – Universitat Pompeu Fabra)Vitor Coelho (UPF – Universitat Pompeu Fabra)


ScheduleOverview

Schedule Tuesday Wednesday Thrusday Friday

8:30 am - 9:00 am Registration Registration Registration

09:00 am - 10:00 am Parallel Session W1 Parallel Session T1 Parallel Session F1

10:00 am - 11:00 am Plenary 3 - Panel

Coffee Break

11:00 am - 12:00 am Plenary 1 - Paola Plenary 2 - Rafa

Coffee Break

12:00 am - 01:00 pm Parallel Session W2 Parallel Session T2 Parallel Session F2

01:00 pm - 02:00 pm

Lunch Lunch Past, Present, Future/Closing session

02:00 pm - 03:00 pm

03:00 pm - 04:00 pm Registration Parallel Session W3 Poster MIC/Plenary MAEB/semi plenary Local Solver

04:00 pm - 05:00 pm Welcome session and Reception

Coffee Break

Coffee Break Parallel Session T4 / "SEIO.RedHeur - Spanish Heuristic Working Group"

05:00 pm - 06:00 pm Parallel Session W4

06:00 pm - 07:00 pm

07:00 pm - 08:00 pm

Women in STEM Cocktail

08:00 pm - 09:00 pm Dinner

09:00 pm - 10:00 pm


Venue Universitat Pompeu FabraThe MIC 2017 and MAEB 2017 will be hold at the Universitat Pompeu Fabra, (UPF) (Ciutadella Campus), Barcelona, Spain, except the welcome reception. The university is very close to the center of the town and two blocks away from the beach.

Ramon Trias Fargas, 25-27 – BarcelonaMetro Line 4 Ciutadella–Vila OlimpicaTram line T4, T5 Wellington and Ciutadella-Vila OlimpicaBuses: 41, H16, and V21


UsefulInformationINTERNET ACCESS— event@upf Password: 17upompf— eduroam

Guideline for Speakers— Each plenary session is 60 minutes, and each contribut-

ed talk is 20 minutes. — Please arrive on time to the session and contact your

chairperson before your session stars. In case the chairperson does not show up. The last speaker of the session is asked to chair this session.

— All session rooms will be equipped with an overhead projector and a computer.

— To avoid wasting time during the session, set up your presentation before the session starts. You can also bring your own computer.

Guideline for Chairs— Chairpersons are asked to open and close the session

on time. Please arrive 10 minutes before the session starts.

— Please introduce the title of the talk and the name of the speaker before each presentation.

— Please let speakers know when their time is running short. If possible, let 5 minutes for discussion.

— The original time schedule should be strictly adhered to. If a talk is canceled or a speaker does not show up, the session should be suspended rather than shifting the succeeding talk forward.

Rooms’ maps "#$%&'#!(#(()&*+!,$#*-./!(#(()&*(!-*0!%&11##!2.#-3!4"#0*#(0-/!-*0!567.(0-/8!

9&:#.!0#!;$7.)-!27)$0)*:!4<=>???8

@-7'#!A!27)$0)*:!4B=>???8


Keynote Speakers"#0*#(0-/+!@7$/!CD6!E!FF-'

Advances and trends in GRASP: from hybridizations to nonmonocityPaola Festa

Abstract

GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for computing good-quality solutions of hard combinatorial optimization problems. Each GRASP iteration is usually made up of a construction phase, where a feasible solution is constructed, and a local search phase which starts at the constructed solution and applies iterative improvement until a locally optimal solution is found. Typically, the construction phase of GRASP is a randomized greedy algorithm, but other types of construction procedures have been also proposed in the literature. Repeated appli-cations of a construction procedure yields diverse starting solutions for the local search and twhe best overall solution is kept as the output. This talk will give an overview of GRASP enhancements to the basic procedure, including reactive GRASP, intensification strategies, and hybridizations with other metaheuristics. It will be also described a new variant of the GRASP framework that uses a new nonmonotone strategy to explore the neighborhood of the current solution.

Paola Festa obtained her Ph.D. degree in Operations Research in 2000 and is currently Associate Professor in Operations Research at the University of Napoli FEDERICO II, Italy. Since 1999, she has been frequently and regularly Research Scholar at several na-tional and international research institutions, including CNRs, MIT Lab. for Information and Decision Systems (USA), AT&T Labs Research (USA), and Department of Industrial and Systems Engineering of the University of Florida (USA). Paola Festa is Associate Editor of several international journals, including Journal of Global Optimization, Optimization Let-ters, ACM Journal on Experimental Algorithmics, and Journal of Biomedical Data Mining. She has been chair or member of the scientific committee of more than 50 international

conferences and workshops and the organizer of more than 10 international scientific events. She is member of the Steering Committee of the International Workshops on Hybrid Metaheuristics. She is author/co-author of more than 100 publications appeared in international journals, books, and peer-reviewed conference proceedings.


567.(0-/+!@7$/!GD6!E!FF-'

Black-Box Solvers In Combinatorial Optimization Rafael Martí & Manuel Laguna

Abstract

Black box optimizers have a long tradition in the field of operations research. These procedures treat the objective function evaluation as a black box and therefore do not take advantage of its specific structure. Black-box optimization refers to the process in which there is a complete separation between the evaluation of the objective function —and perhaps other functions used to enforce constraints— and the solution procedure. The challenge of optimizing black boxes is to develop methods that can produce outcomes of reasonable quality without taking advantage of problem structure and employing a computational effort that is adequate for the context. Holland’s (1975) genetic algorithms proposal was in fact a black-box optimizer that used an array of bits as the generic representation. The proposed procedure did not include local search and the standard genetic operators (such as single-point crossover) were not linked to the problem context. As GAs became more popular and researchers and practitioner applied them to many hard optimization problems, the context-in-dependent nature of the original proposal began to vanish when improved outcomes were obtained by the addition of problem structure. During the last years we worked on the adaptation of metaheuristic methodologies to deal with black-box combinatorial optimization. We classified the problems according to their solution representation: permutation, binary, and integer to create solvers in each family. In this talk we will review commercial black-box solvers, such as Opttek’s OptQuest, Palisade’s Evolver and Frontline’s Premium Solver, and compare their performance with our metaheuristic im-plementations based on the Scatter Search methodology on many different optimization problems.

Rafael Martí is Professor of Statistics and Operations Research at the University of Valencia, Spain. He received a doctoral degree in Mathematics from the University of Valencia in 1994. He has done extensive research in metaheuristics for hard optimization problems. Dr Martí has about 200 publications, half of them in indexed journals (JCR), including EJOR, Informs JoC, IIE Transactions, JOGO, C&OR, and Discrete and Applied Maths. He is the co-author of Scatter Search (Kluwer 2003) and The Linear Ordering Problem (Springer 2011) monographs, and has secured an American patent. Prof. Martí is currently Area Editor in the Journal of Heu-ristics, Associate Editor in the Math. Prog. Computation, and the Int. Journal of Metaheuristics. He is Senior Research Associate of OptTek Systems (USA), and has given about 50 invited

and plenary talks. Dr. Martí has been invited Professor at the University of Colorado (USA), University of Molde (Norway), University of Graz (Austria), and University of Bretagne-Sud (France).

Manuel Laguna is the MediaOne Professor of Management Science and Director of Global Initiatives at the Leeds School of Business of the University of Colorado Boulder. He started his academic career at the University of Colorado in 1990, after receiving master’s (1987) and doctoral (1990) degrees in Operations Research and Industrial Engineering from the University of Texas at Austin. He has done extensive research in the interface between computer sci-ence, artificial intelligence and operations research, resulting in over one hundred publications, including four books. He has received research funding from private industry and government agencies such as the National Science Foundation, the Office of Naval Research and the En-vironmental Protection Agency. He is co-founder of OptTek Systems, a Boulder-based software

and consulting company that provides optimization solutions. He is the editor-in-chief of the Journal of Heuristics and has been Division Chair, Senior Associate Dean and Interim Dean at the Leeds School of Business.


567.(0-/+!@7$/!GD6!E!H,'

VNS para Planificación Logística

José Andrés Moreno Pérez

Resumen (talk in Spanish)

A pesar de su simplicidad, la metaheurística VNS (Búsqueda por Entorno Variable) se ha mostrado muy efectiva en optimización combinatoria y global. Está basada en un cambio sistemático en la estructura de entornos, tanto en la fase de mejora para alcanzar óptimos locales, como en la etapa de agitación para escapar de su atracción. La VNS ha sido aplicada con éxito a una gran cantidad de problemas de optimización con aplicaciones reales, proporcionando soluciones de alta calidad en un tiempo de cómputo razonable. Resulta especialmente indicada para apoyar la toma de decisiones en este ámbito a niveles estratégico, táctico y operativo dado su excelente rendimiento en una gran variedad de prob-lemas de planificación logística. Varios análisis comparativos experimentales han demostrado la superioridad de los algoritmos heurísticos obtenidos utilizando esta joven metaheurística frente a otras alternativas en la solución de prob-lemas estándares de optimización logística. Examinamos los elementos esenciales en la aplicación exitosa de la VNS a los problemas más importantes de optimización logística y se revisan las contribuciones más importantes en esta línea aparecidas en la literatura.

Professor Moreno has published about 100 scientific papers or chapter of books most of them in the area of metaheuristic optimization. He is editor of the journals “Memetic Computing” and the “Int. J. of Information and Decision Sciences” and has been referee of the most relevant journal in the field of Optimization. He is co-author of the several relevant papers on Variable Neighbourhood Search (VNS) and with applications in Logistics Optimization. He is co-author of dozens of papers in location and routing problems in the high quality journals in the last 40 years. In the other side, He is co-author of the first paper on Parallel VNS in 2002, the first review paper on VNS in Spanish in 2003, the recent reviews in VNS in 4OR in 2008 and in Annals of OR in 2010, the Chapter on VNS in the Handbook of Metaheuristics in 2010. He has

given several invited talks on VNS. He has been the organizer of the first mini EURO Conference on VNS in 2005 and co-chair of the second mini EURO Conference on VNS in 2012.


Discussion Panelin IndustrialApplications

I.)0-/+!@7$/!JD6!E!F=-'

Mauricio Resende

Mauricio Resende is the Principal Research Scientist in the transportation area at Amazon, USA.

Nuria Oliver

Nuria Oliver is the Data Science Director of Vodafone and the Chief Data Scientist at Data-Pop Alliance.

Ricardo Baeza-Yates

Ricardo Baeza-Yates is the CTO of NTENT, a semantic search technology company based in California, USA.

Henning Wagner

Henning Wagner is the Head of IT Service Management at Rhenus Freight Logistics.

Kristof Roomp

Kristof Roomp is the Principal Software Architect working at Microsoft on the Exchange cloud-based email system in Office 365.

Enrique Alfonseca

Enrique Alfonseca is the Staff Research Scientist at Google.


Special IssuesInternational Transactions in Operational Research (ITOR)http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1475-3995 Impact factor 2015: 1.255 Special Issue on Metaheuristics Call for papers ITOR

Journal on Vehicle Routing Algorithms (JVRA)Journal details: http://www.springer.com/41604/, ISSN: 2367-3591 (print version) Submission site: https://www.editorialmanager.com/jvra/ Special Issue “Metaheuristic Algorithms for Vehicle Routing” Call for papers JVRA

Open Mathematics (OM)https://www.degruyter.com/view/j/math Impact factor 2015: 0.521 Special Issue on Metaheuristics. Call for papers OM

International Journal of Metaheuristics (IJMheur)http://www.inderscience.com/jhome.php?jcode=ijmheur Special Issue on Applications of Metaheuristics and Simheuristics in solving Rich and Real-Life Problems Call for papers IJMheur http://www.inderscience.com/info/ingeneral/cfp.php?id=3707

More information: http://mic2017.upf.edu/special-issues/


2017 EURO / MIC-MAEB Award to the best student presentation

The EURO General Support Fund (http://www.euro-online.org/) is proud to collaborate in supporting MIC-MAEB’17 (http://mic2017.upf.edu/). This support includes, among other things, the creation of an award to the best student presentation at the 2017 MIC-MAEB joint conference. The award will consist in a free registration at the 2018 EURO Conference (or any similar conference, with approximately the same registration fees, that takes place on or before June 2018).

Who are eligible for this award? Any PhD student who presents a work at MIC-MAEB’17 (the work has to be actually presented by the student himself/herself).

How to participate in this contest? Just send an e-mail, on or before June 30 2017, to [email protected] with the following info: (i) name of the presenting student; (ii) number and title of the associated paper. Note: only those students that have actually submitted that e-mail on due time will be considered.

Which criteria will be used to decide the winner? The Evaluation Committee will be composed by Dr. Ana Viana, Dr. Belén Melián, and Dr. Angel A. Juan. The Committee will require a short report from the Chairs of each session where a candidate is presenting a registered work. Then, they will evaluate these reports, together with the actual works, in order to take a joint decision (this decision will be final, par-ticipation in this context implies the implicit acceptance of these rules).

When will the winner be announced? During the MIC-MAEB’17 closing act (Friday, July 7th 2017).


Social EventsLunches and Coffee BreaksLunches will be served Wednesday and Thursday at Cafeteria (Roger de Lluria building). Coffee breaks will be served Wednesday and Thursday at 30.S02 Exposition Room and Friday at Patio Jaume I building.

Registration and Welcome Session and Reception 57#(0-/!@7$/!<D6+!B=FJ!-D!<,'K!9#:)(D.-D)&*!L)$$!(D-.D!-D!H,'>!

Welcome session will be held Tuesday at 4pm at 30.S01 Auditorium, followed by a Reception at 30.S02 Exposition Room

Registration will open at 3pm and will be located in front of the Auditorium Tuesday and the rest of the days at 30.S02 Exposition Room.

Women in STEM Cocktail "#0*#(0-/!@7$/!CD6+!B=FJ!-D!J>H=,'>

In recent years the fields of science, technology, engineering, and mathematics—collectively known as STEM—have received much attention for their critical role in maintaining the competitive edge in the global economy. Women are highly underrepresented in STEM field professions and this problem is well documented by research. Although there have been several efforts to remedy this issue, men are still dominant forces in the STEM world. Girls and young women should certainly be encouraged to consider STEM courses and careers and further close the so-called gender gap. This cocktail aim to promote and support the gender equality in STEM, by making awareness of this issue, and by making visible and promote researchers and professionals in the field (or related field). The event will have two parts: a presentation and pan-el discussion on “Women in STEM” topic presented by several speakers; followed by a cocktail to promote networking and awareness of this important issue. Women and men are welcomed to the event.

Speakers:— Joaquina Alvarez-Marron, President AMIT— Helena Ramalhinho, Chair MIC/MAEB 2017, Universitat Pompeu Fabra— Natalia Castellana, Societat Catalana de Matemàtiques— Regina Llopis, CEO & President Group AIA— Ana Freire, Universitat Pompeu Fabra— Ana Viana, Chair of the Program Committee MIC 2017, INESC TEC/ISEP, Portugal— Belén Mélian Chair of the Program Committee MAEB 2017, Universidad de La Laguna

The event will take place July 5th, 2017 (19h-22h) at Institut d’Estudis Catalans. Carrer del Carme, 47; 08001 Barcelona.

Soccer GameWednesday July 5th, 2017 from 7.00pm to 8:00pm. Limited to 7+2 players by team, two teams: MIC versus MAEB! The field is the CE Vila Olimpica – Camp Municipal de Futbol Agapito Fernàndez.

Dinner567.(0-/!@7$/!GD6+!B=FJ!-D!M>==,'>!

The conference dinner will take place at the beautiful Restaurant 1881 (Sagardi) at Museu d’Història de Catalunya, Palau de Mar – Plaça Pau Vila, 3 (4a floor) 08003 Barcelona.


Sessions and TitlesMIC’201712TH METAHEURISTICS INTERNATIONAL CONFERENCE

57#(0-/+!@7$/!<D6

16:00-18:30 Session: Welcome Session and Reception LOCATION: 30.S01 Auditorium

"#0*#(0-/+!@7$/!CD6

09:00-10:30 Session W1.1: Transportation CHAIR: Javier Faulin LOCATION: 40.002

09:00 Lorena Silvana Reyes-Rubiano, Laura Calvet Liñan, Angel A. Juan and Francisco Javier Faulin Fajardo Sustainable Urban Freight Transport Considering Multiple Capacitated Depots

09:20 Maurizio Bruglieri, Ferdinando Pezzella and Ornella Pisacane An Adaptive Large Neighborhood Search for Relocating Vehicles in Electric Carsharing Services

09:40 David Raba, Aljoscha Gruler, Daniel Riera, Jaume Gelada and Angel Juan Combining real-time information with a variable neighborhood search metaheuristic for the inventory routing problem: a case study at UBIKWA systems

10:00 Jorge E. Mendoza, Alejandro Montoya, Christelle Guéret and Juan G. Villegas R. A parallel matheuristic for the technician routing problem with conventional and electric vehicles

09:00-10:30 Session W1.2: Scheduling CHAIR: Ruben Ruiz LOCATION: 40.004

09:00 Gonzalo Mejía, Eduardo Lalla-Ruiz, Stefan Voss and Francisco Yuraszeck A Genetic Algorithm for the Flexible Open Shop Scheduling Problem with Setup and Trans-portation Times

09:20 Aymen Sioud and Caroline Gagné A new migrating birds optimization algorithm to solve a permutation flowshop problem

09:40 Lucien Mousin, Marie-Eleonore Kessaci-Marmion and Clarisse Dhaenens An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem

10:00 José L. C. Silva, Gerardo V. R. Viana and Bruno Castro H. Silva An efficient algorithm based on metaheuristic for the no-wait flowshop scheduling problem


09:00-10:30 Session W1.3: Tabu Search CHAIR: Fred Glover LOCATION: 40.006

09:00 Oualid Guemri, Said Hanafi, Placide Nduwayo, Fred Glover and Christophe Wilbaut Probabilistic Tabu Search for the Cross-Docking Assignment Problem

09:20 Fred Glover, Said Hanafi, Oualid Guemri and Igor Crevits A Simple Multi-Wave Algorithm for the Uncapacitated Facility Location Problem

09:40 Haibo Wang, Yang Wang, Fred Glover, Mauricio Resende and Gary Kochenberger Tabu Search with Path-Relinking for the Quadratic Assignment Problem

10:00 Yosuke Takada, Yuta Takeuchi, Yannan Hu, Hideki Hashimoto and Mutsunori Yagiura A tabu search algorithm for the multi-vehicle covering tour problem

09:00-10:30 Session W1.4: GRASP CHAIR: Mauricio Resende LOCATION: 40.008

09:00 Jorge Moreno Ramírez and Simone de Lima Martins GRASP for the Weighted Target Set Selection problem

09:20 Daniele Ferone, Aljoscha Gruler, Paola Festa and Angel A. Juan Introducing biased randomization in GRASP

09:40 Paola Festa, Antonio Napoletano, Tommaso Pastore, Daniele Ferone and Davide Marino A GRASP for the Max Cut-Clique Problem

10:00 Celso Ribeiro and Ruben Interian A GRASP with restarts heuristic for the Steiner traveling salesman problem

09:00-10:30 Session W1.5: Simheuristics CHAIR: Markus Rabe LOCATION: 40.010

09:00 Markus Rabe, Felix Dross and Alexander Wuttke Combining a Discrete-event Simulation Model of a Logistics Network with Deep Reinforcement Learning

09:20 David Schmaranzer, Roland Braune and Karl F. Doerner Simulation-based headway optimization of the Viennese urban subway network

09:40 Christoph Laroque and Jens Weber A Concept to Combine PSO with Industrial Tooling Machine Setup Issues as Practical Approach for Simulation Based Optimization

10:00 Eliana María Gonzalez-Neira, Ana Maria Urrego-Torres, Ana Maria Cruz-Riveros, Catalina Hen-ao-Garcia, Lina Paola Molina-Sanchez and Jairo R. Montoya-Torres A simheuristic for bi-objective permutation flow shop problem with stochastic processing times


09:00-10:30 Session W1.6: Metaheurísticas en Ciencias de Datos y Aprendizaje (MAEB) CHAIR: José Antonio Gámez LOCATION: 40.012

09:00 Juan Ignacio Alonso Barba, Luis De La Ossa, Jose Gamez and Jose M Puerta Uso de Metaheristicas Locales para Mejora de Rendimiento del Algoritmo GES en el Aprendizaje Estructural de Redes Bayesianas

09:20 A. M. Garcia-Vico, C. J. Carmona and M. J. Del Jesus Análisis de Diferentes Tipos de Reglas en Sistemas Difusos Evolutivos para Minería de Patrones Emergentes

09:40 Daniel Molina Cabrera, Francisco Moreno García and Francisco Herrera Triguero ¿Existe una mejora continua entre los algoritmos ganadores de las competiciones de optimización real del IEEE CEC?

10:30-11:00 Session : Coffee Break LOCATION: 30.S02 S. Exposition

11:00-12:00 Session Plenary: “Advances and trends in GRASP: from hybridizations to nonmonocity” Paola Festa

CHAIR: Mauricio Resende LOCATION: 30.S01 Auditorium

PAOLA FESTA, University of Napoli FEDERICO II, Italy

GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for computing good-quality solutions of hard combinatorial optimization problems. Each GRASP iteration is usually made up of a construction phase, where a feasible solution is constructed, and a local search phase which starts at the constructed solution and applies iterative improvement until a locally optimal solution is found. Typi-cally, the construction phase of GRASP is a randomized greedy algorithm, but other types of construction procedures have been also proposed in the literature. Repeated applications of a construction procedure yields diverse starting solutions for the local search and the best overall solution is kept as the output. This talk will give an overview of GRASP enhancements to the basic procedure, including reactive GRASP, intensification strategies, and hybridizations with other metaheuristics. It will be also described a new vari-ant of the GRASP framework that uses a new nonmonotone strategy to explore the neighborhood of the current solution.

12:00-13:30 Session W2.1: Transportation CHAIR: Richard F. Hartl LOCATION: 40.002

12:00 Javier Belloso, Angel Juan, Javier Faulin and Adrian Serrano An iterative biased-randomized heuristic for the fleet size and mix vehicle routing problem with backhauls

12:20 Sebastian Reil and Lars Moench Solving Multi-trip Vehicle Routing Problems with Backhauls, Time Windows, and Release Dates

12:40 Michel Gendreau, Vahid Famildardashti and Jean-Yves Potvin Tactical Time Slot Management Problem with Split Deliveries

13:00 Adria Soriano, Maragaretha Gansterer and Richard F. Hartl The two clustered multi depot pick up and delivery problem with time windows


12:00-13:30 Session W2.2: Scheduling CHAIR: Pedro Alfaro-Fernández LOCATION: 40.004

12:00 Ruben Ruiz, Quan-Ke Pan and Naderi Bahman Revisiting the Distributed Permutation Flowshop Problem

12:20 Mohanad Al-Behadili, Djamila Ouelhadj and Dylan Jones Multi-objective Model and Iterated Greedy Algorithm for Robust Permutation Flow Shop Scheduling in the presence of uncertainties

12:40 Imane Laribi, Farouk Yalaoui, Faycal Belkaid and Zaki Sari Metaheuristics for non-renewable resources constraints flow shop scheduling problems

13:00 Pedro Alfaro-Fernández, Rubén Ruiz, Federico Pagnozzi and Thomas Stützle Exploring Automatic Algorithm Design for the Hybrid Flowshop Problem

12:00-13:30 Session W2.3: Tabu Search CHAIR: Gary Kochenberger LOCATION: 40.006

12:00 Alain Hertz, Agnieszka Rybarczyk, Jacek Blazewicz and Marta Kasprzak Tabu search for the RNA partial degradation problem

12:20 Bahram Alidaee and Haibo Wang Unrelated Parallel Machine Selection and Job Scheduling with the Objective of Minimizing Total Workload and Machine Fixed Costs, in Presence of Outsourcing

12:40 Yan Jin, Una Benlic and Kun He Variable neighborhood tabu search for the vertex bisection minimization problem

13:00 Edison Luiz Bonotto and Lucídio Cabral A hybrid algorithm based on Particle Swarm Optimization and Tabu Search for the Maxi-mum Diversity Problem

12:00-13:30 Session W2.4: GRASP & VNS CHAIR: Celso Ribeiro LOCATION: 40.008

12:00 Sergio Gil Borrás, Borja Menéndez Moreno, Abraham Duarte and Eduardo García Pardo Online Order Batching Problem

12:20 Ricardo M A Silva, Mariana A Moura, Mauricio G C Resende, Joao L Faco and Raul M Falcao Generalized GRASP for Mixed-Integer Nonlinear Optimization

12:40 Jana Doering, Javier Panadero, Angel A. Juan, Renatas Kizys and Àngels Fitó A Simulation-enriched Variable Neighborhood Search for the Stochastic Project Portfolio Selection Prob-lem

13:00 Mostafa Darwiche, Donatello Conte, Romain Raveaux and Vincent T’Kindt The Graph Edit Distance Problem treated by the Local Branching Heuristic


12:00-13:30 Session W2.5: Metaheurísticas en Producción (MAEB) CHAIR: Joaquín Bautista LOCATION: 40.010

12:00 Krzysztof Trawinski, Manuel Chica, David P. Pancho, Sergio Damas and Oscar Cordon Non-dominated solutions visualization in multiobjective optimization: application to assem-bly line balancing

12:20 Joaquín Bautista and Rocio Alfaro-Pozo Minimizing the ergonomic risk and its dispersion in a mixed model assembly line using GRASP

12:40 Néstor García, Jan Rosell and Raúl Suárez Aplicación de algoritmos RRT en la planificación de movimientos óptimos en robótica

13:30-14:00 Session : Lunch LOCATION: Cafeteria (Roger de Lluria building)

15:00-16:30 Session W3.1: Transportation CHAIR: Raymond S. K. Kwan LOCATION: 40.002

15:00 Juan-Ignacio Latorre-Biel, Javier Faulin and Angel. A Juan Simheuristics-based selection of the optimal production strategy for a manufacturing facil-ity under the influence of corrective maintenance operations

15:20 Pedro Jesus Copado Mendez, Zhiyuan Lin and Raymond S. K. Kwan Size Limited Iterative Method (SLIM) for Train Unit Scheduling

15:40 Julia Silva, Priscila Rampazzo and Akebo Yamakami Evolutionary Multi-Objective Optimization for the Multimodal Transport Problem

16:00 Alina-Gabriela Dragomir and Karl F. Doerner A dual hub-and-spoke problem with fixed and flexible long-hauls

15:00-16:30 Session W3.2: Scheduling CHAIR: Jean-Charles Billaut LOCATION: 40.004

15:00 Adela Pagès Bernaus, Lluís Miquel Plà, Virna Ortiz-Araya, Jordi Mateo and Francesc Solsona Optimal scheduling of production tasks in an animal feed mill

15:20 Eva Vallada, Fulgencia Villa and Luis Fanjul Heuristics for the parallel machines scheduling problem with additional resources

15:40 Faiza Sadi, Ameur Soukhal and Jean-Charles Billaut Scheduling two interfering job sets on parallel machines with makespan and total comple-tion time minimization

16:00 Junwen Ding, Liji Shen and Zhipeng Lü A hybrid memetic algorithm for parallel machine scheduling problems with deteriorating effects


15:00-16:30 Session W3.3: Logistics and Supply Chain Management CHAIR: Maria Albareda LOCATION: 40.006

15:00 Maria Albareda-Sambola, Luisa I. Martínez-Merino and Antonio M. Rodriguez-Chia Heuristic solutions to the Probabilistic p-Center Problem

15:20 Sara Hatami, Majid Eskandarpour, Manuel Chica, Angel Juan and Djamila Ouelhadj Green Heterogeneous Vehicle Routing Problem with Multiple Driving Ranges

15:40 Edwin Montes-Orozco, Roman-Anselmo Mora-Gutiérrez and Javier Ramírez-Rodríguez Metaheuristics for the vehicle routing problem with time windows

16:00 Aljoscha Gruler, Carlos Quintero-Araujo, Laura Calvet and Angel Juan Waste Collection under Uncertainty: A Simheuristic based on Variable Neighborhood Search

15:00-16:30 Session W3.4: Matheuristics CHAIR: Vittorio Maniezzo LOCATION: 40.008

15:00 Patrick Gerhards Using mixed integer programming techniques within a large neighborhood search as a hybrid metaheuristic for the multi-mode resource investment problem

15:20 Vittorio Maniezzo, Marco Boschetti, Antonella Carbonaro, Moreno Marzolla and Francesco Strap-paveccia Client-side combinatorial optimization

15:40 Simona Mancini and Giuseppe Stecca A Large Neighborhood Search Matheuristic for Tourist Trip Design Problems

16:00 Sandra Huber, Jean-François Cordeau and Martin Josef Geiger A Matheuristic for the Swap-body Vehicle Routing Problem

15:00-16:30 Session W3.5: Metaheurísticas en Producción (MAEB) CHAIR: Joaquín Bautista LOCATION: 40.010

15:00 Antonio Manuel Durán- Rosal, Pedro Antonio Gutiérrez, Francisco José Martínez-Estudillo and César Hervás-Martínez Multiobjective time series segmentation by improving clustering quality and reducing approximation error

15:20 Joaquín Bautista and Rocio Alfaro-Pozo GRASP para secuencias regulares de modelos mixtos con sobrecarga mínima e interrup-ción forzada de operaciones

15:40 Manuel Mateo, Jacques Teghem and Jordi Camps Exploración de vecindarios mediante búsqueda ramificada para un problema bicriterio con eligibilidad en máquinas paralelas



17:00-18:30 Session W4.1: Transportation CHAIR: Jose-Fernando Oliveira LOCATION: 40.002

17:00 Philipp Salzmann, Michael Schilde and Karl Doerner Clustering is the key to security related routing problems

17:20 Tommaso Urli and Philip Kilby Scheduling a large fleet of rental vehicles using multi-neighbourhood local search

17:40 Julio Brito, Airam Exposito, Simona Mancini and José A. Moreno A GRASP for the Tourist Trip Design with Clustered POIs

18:00 Ana Graça Ribeiro, Beatriz Brito Oliveira, Maria Antónia Carravilla and José Fernando Oliveira A biased random-key genetic algorithm for the car rental vehicle-reservation assignment problem

17:00-18:30 Session W4.2: Scheduling CHAIR: Christian Stürck LOCATION: 40.004

17:00 Gustavo Alves Fernandes and Sergio Ricardo De Souza A CLONALG-inspired algorithm with adaptive large neighborhood search for the multi-mode resource-constrained project scheduling problem

17:20 Aria Shahsavar, Babak Abbasi and Nima Zoraghi Integration of resource investment problem with quantity discount problem in material ordering for minimizing resource costs of projects

17:40 Christian Stürck Applying the Corridor Method to the Multi-Mode Resource-Constrained Project Scheduling Problem

18:00 Xixi Wang, Farouk Yalaoui and Frederic Dugardin A mapping technique to improve solutions for a Multi-Objective Resource Constraint Proj-ect Scheduling Problem

17:00-18:30 Session W4.3: Simheuristics and ILS CHAIR: Jesica de Armas LOCATION: 40.006

17:00 Andreas Reinholz, Christof Husenbeth, Peter Schwarzbözl and Reiner Buck Dynamic Scalable Models in Simulation Optimization: Optimizing Heliostat Positions for Solar Power Tower Plants

17:20 Aljoscha Gruler, Javier Panadero, Jesica de Armas, José Andrés Moreno Pérez and Markus Rabe A simulation-optimization approach for the single-period inventory routing problem with stochastic demands

17:40 Stephanie Alvarez Fernandez, Angel A. Juan, Daniel Riera, Jésica de Armas and Daniel Silva A Simheuristic Algorithm for the Uncapacitated and Stochastic Hub Location Problem

18:00 Jesica de Armas, Angel A. Juan, Joan M. Marquès and João Pedro Pedroso Solving the Deterministic and Stochastic Uncapacitated Facility Location Problem: from a heuristic to a simheuristic


17:00-18:30 Session W4.4: Matheuristics CHAIR: Peter Greistorfer LOCATION: 40.008

17:00 Rostislav Stan#k, K laus Ladner, Peter Greistorfer and Ulrich Pferschy Meta- and Matheuristic Approaches for the Symmetric Quadratic Traveling Salesman Prob-lem

17:20 Misa Fujita, Takayuki Kimura and Tohru Ikeguchi Solving the Steiner Tree Problem in Graphs by Chaotic Neural Network using Key Path Neighborhood

17:40 Renata Turkeš, Daniel Palhazi Cuervo and Kenneth Sörensen Matheuristics for the problem of pre-positioning emergency supplies

18:00 Nicolas Dupin and Talbi El-Ghazali Matheuristics for a VRPTW with competence constraints

17:00-18:30 Session W4.5: Bioinformática usando Metaheruísticas, Algoritmos Evolutivos y Bioinspirados (MAEB)

CHAIR: Miguel A. Vega-Rodríguez LOCATION: 40.010

17:00 Daniel Gallego-Sánchez, Álvaro Rubio-Largo, Jose M. Granado Criado, Miguel A. Vega-Rodrí-guez and Sergio Santander-Jiménez Optimización Multiobjetivo para el Estudio de Asociaciones Genéticas

17:20 Álvaro Rubio-Largo and Miguel A. Vega-Rodríguez Inteligencia Colectiva de Abejas Multiobjetivo para Alinear Múltiples Secuencias Biológi-cas

17:40 Sergio Santander-Jiménez and Miguel A. Vega-Rodríguez Integrando Paralelismo en la Metaheurística Indicator-Based Multiobjective Bat Algorithm para Reconstrucción Filogenética

567.(0-/+!@7$/!GD6

09:00-10:30 Session T1.1: Transportation CHAIR: Roberto Tadei LOCATION: 40.004

09:00 Bhupesh Shetty, Jeffrey Ohlmann and Luca Bertazzi A Heuristic for the Period Vehicle Routing Problem with Inventory

09:20 Emilio Jose Alarcon Ortega, Michael Schilde and Karl F. Doerner An Adaptive Large Neighborhood Search for the Consistent Inventory Routing Problem

09:40 Biljana Roljic, Fabien Tricoire and Karl Doerner A Large Neighborhood Search for a Rich Vehicle Routing Problem arising in the Steel Industry

10:00 Carlos Vega-Mejía and Jairo R. Montoya-Torres A Hybrid Heuristic for a Balanced Vehicle Routing Problem with Time Windows and Load-ing Constraints


09:00-10:30 Session T1.2: Scheduling CHAIR: Luciana Pessôa LOCATION: 40.006

09:00 Victor Cunha, Iuri Santos, Silvio Hamacher and Luciana Pessôa An ILS heuristic for a real-life ship scheduling problem

09:20 Nhan-Quy Nguyen, Farouk Yalaoui, Lionel Amodeo, Hicham Chehade and Pascal Toggenburger Predictive baseline schedule for electrical vehicles charging in dedicated residential zone parking

09:40 César Augusto Marín Moreno, Antonio Escobar, John Willmer Escobar and Luis Miguel Escobar Falcón Algoritmos Constructivos Mateheurísticos para Solucionar el Problema de Programación de Vehículos de Transporte Público de Pasajeros con Múltiples Depósitos

10:00 Alexander Kiefer, Michael Schilde and Karl Doerner Strategic planning of maintenance work of a large-scale tramway network

09:00-10:30 Session T1.3: Metaheuristics in Retail Operations CHAIR: Sara Hatami LOCATION: 40.008

09:00 Guillermo Alberto Camacho MuÑoz, David Alvarez Martinez and Daniel Cuellar A heuristic approach for the Pallet Building and Loading Problem

09:20 Albert Ferrer, Jesica de Armas, Angel A. Juan and Eduardo Lalla-Ruiz A Biased-randomized algorithm for non-smooth arc routing problems with realistic soft constraints

09:40 Manuel Ostermeier, Sara Martins, Pedro Amorim and Alexander Hübner Solution Approaches for the Consideration of Loading Constraints for MCVRP

10:00 Sara Martins, Manuel Ostermeier, Alexander Hübner and Pedro Amorim An ALNS for solving the MCVRP with Product-Specific Time-Windows Assignment

09:00-10:30 Session T1.4: Ph.D Colloquim CHAIR: Manuel Mateo LOCATION: 40.010

09:00 J.D. Quintana, Eduardo G. Pardo, Abraham Duarte and Manuel Laguna Cyclic Cutwidth Minimization Problem

09:20 Tommaso Schettini, Federico Malucelli and Helena Ramalhinho Scheduling of a line manager using Iterated Local Search

09:40 Marcelus Lima and Helena Ramalhinho Routes design from warehouses towards the delivery points

10:00 Julia Lange A neighborhood for the blocking job-shop problem embedded in a simulated annealing


09:00-10:30 Session T1.5: Metaheuristics in Port Logistics and Related Problems (MAEB) CHAIR: Belen Melian LOCATION: 40.012

09:00 Alan Dávila de León, Eduardo Lalla-Ruiz, Belén Melián-Batista and J. Marcos Moreno-Vega Artificial Intelligence System for supporting the management of berthing operations

09:20 Airam Expósito Márquez, Christopher Expósito Izquierdo, Belén Melián Batista and J. Marcos Moreno Vega Multi-agent based Model for the Simulation of Yard Crane Operations at Maritime Container Terminals

09:40 Francisco Parreño, Dario Pacino and Ramon Alvarez-Valdes A GRASP algorithm for the container stowage slot planning problem

10:00 Consuelo Parreño, Ramón Álvarez-Valdés and Francisco Parreño Heuristic and metaheuristic algorithms for a multi-port container ship stowage problem


11:00-12:00 Session Plenary: “Black-Box Solvers In Combinatorial Optimization” Rafael Martí and Manuel Laguna

CHAIR: Marc Sevaux LOCATION: 30.S01 Auditorium

RAFAEL MARTI, University of Valencia, SpainManuel Laguna, Leeds School of Business of the University of Colorado Boulder. USA

Black box optimizers have a long tradition in the field of operations research. These procedures treat the objective function evaluation as a black box and therefore do not take advantage of its specific structure. Black-box optimization refers to the process in which there is a complete separation between the evaluation of the objective function —and perhaps other functions used to enforce constraints— and the solution procedure. The challenge of optimizing black boxes is to develop methods that can produce outcomes of reasonable quality without taking advantage of problem structure and employing a computational effort that is adequate for the context. Holland’s (1975) genetic algorithms proposal was in fact a black-box optimizer that used an array of bits as the generic representation. The proposed procedure did not include local search and the standard genetic operators (such as single-point crossover) were not linked to the problem context. As GAs became more popular and researchers and practitioner applied them to many hard optimization problems, the context-in-dependent nature of the original proposal began to vanish when improved outcomes were obtained by the addition of problem structure. During the last years we worked on the adaptation of metaheuristic methodologies to deal with black-box combinatorial optimization. We classified the problems according to their solution representation: permutation, bina-ry, and integer to create solvers in each family. In this talk we will review commercial black-box solvers, such as Opttek’s OptQuest, Palisade’s Evolver and Frontline’s Premium Solver, and compare their performance with our metaheuristic implementations based on the Scatter Search methodology on many different optimization problems.


12:00-13:30 SESSION T2.1: VARIABLE NEIRGBORHOOD SEARCH CHAIR: Vitor Coelho LOCATION: 40.004

12:00 Alberto Herrán, José Manuel Colmenar, Rafael Martí and Abraham Duarte A Parallel Variable Neighborhood Search Approach for the Obnoxious p-Median Problem

12:20 Rachid Benmansour, Said Hanafi and Oliver Braun A variable neighborhood search for single machine scheduling problem with time restric-tions

12:40 Matthieu De Laere, San Pham and Patrick De Causmaecker Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent

13:00 Artem Kondakov and Yuri Kochetov A hybrid VNS matheuristic for a bin packing problem with a color constraint

13:20 Nenad Mladenovic Solving the maximum min-sum dispersion by alternating formulations of two different problems

12:00-13:30 Session T2.2: Scheduling CHAIR: Luca Di Gaspero LOCATION: 40.006

12:00 Julia Bennell, Toni Martinez-Sykora and Chris Potts Scheduling for the Growing of Crops to Meet Demand

12:20 José Maurício Costa, Pedro P. Paniago, Thiago F. Noronha and Marcos A. M. Vieira A biased random-key genetic algorithm for the Multi-period, Multi-rate and Multi-channels with variable bandwidth Scheduling Problem

12:40 Michele Battistutta, Michael Bisson, Fabio De Cesco and Andrea Schaerf Referee Assignment for a Basketball League with Multiple Divisions using Local Search

13:00 Davide Armellini, Paolo Borzone, Sara Ceschia, Luca Di Gaspero and Andrea Schaerf A Metaheuristic Approach for Scheduling Steelmaking and Casting Plants

12:00-13:30 Session T2.3: Metaheuristics - General CHAIR: Eric D. Taillard LOCATION: 40.008

12:00 José Andrés Moreno Pérez and Sergio Consoli Minimum Labelling bi-Connectivity

12:20 Eric D Taillard TSP Neighbourhood Reduction with POPMUSIC

12:40 Yuuki Morita and Takayuki Kimura A metaheuristic algorithm using chaotic neurodynamics with degree information for the dynamic combinatorial optimization problem: a packet routing problem

13:00 Andrzej Jaszkiewicz and Thibaut Lust Proper balance between search towards and along Pareto front: biobjective TSP case study


12:00-13:30 Session T2.4: Smart Cities CHAIR: Talbi El-Ghazali LOCATION: 40.010

12:00 Jonay Suárez-Armas, Pino Caballero-Gil, José Á. Concepción-Sánchez and Néstor Álvarez-Díaz Beacon-based solution for dynamic traffic light management

12:20 Zineb Garroussi, Rachid Ellaia, El-Ghazali Talbi and Jean-Yves Lucas Hybrid Metaheuristics for Multiobjective Thermal and Electrical Energy Management in a Smart Home

12:40 José Á. Concepción-Sánchez, Pino Caballero-Gil, Jonay Suárez-Armas and Néstor Álvarez-Díaz Travel Assistance Application for Seniors

12:00-13:30 Session T2.5: Metaheuristics General (MAEB) CHAIR: Abraham Duarte LOCATION: 40.012

12:00 José Manuel Colmenar, Arild Hoff, Rafael Martí and Abraham Duarte Scatter search para el problema multi-objetivo p-median y p-dispersion.

12:20 Christian Blum, Maria J. Blesa, Abraham Duarte and Jesús Sánchez-Oro An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem

12:40 Anna Martínez-Gavara, Vicente Campos Aucejo, Dario Landa-Silva and Rafael Marti Multi-Start Methods for the Capacitated Clustering Problem

13:00 Carlos García-Martínez and Sebastián Ventura Un algoritmo de programación genética multivista para inducir clasificadores basados en reglas en contextos semi-supervisados

13:30-15:00 Session : Lunch LOCATION: Cafeteria (Roger de Lluria building)

15:00-16:00 Session Plenary (MAEB): “VNS para Planificación Logística” José Andrés Moreno Pérez CHAIR: Abraham Duarte LOCATION: 30.S01 Auditorium

JOSÉ ANDRÉS MORENO PÉREZ, Universidad de La Laguna, España

A pesar de su simplicidad, la metaheurística VNS (Búsqueda por Entorno Variable) se ha mostrado muy efectiva en optimización combinatoria y global. Está basada en un cambio sistemático en la estructura de entornos, tanto en la fase de mejora para alcanzar óptimos locales, como en la etapa de agitación para escapar de su atracción. La VNS ha sido aplicada con éxito a una gran cantidad de problemas de optimización con aplicaciones reales, proporcionando soluciones de alta calidad en un tiempo de cómputo razonable. Resulta especialmente indicada para apoyar la toma de decisiones en este ámbito a niveles estratégico, táctico y operativo dado su excelente rendimiento en una gran variedad de prob-lemas de planificación logística. Varios análisis comparativos experimentales han demostrado la superioridad de los algoritmos heurísticos obtenidos utilizando esta joven metaheurística frente a otras alternativas en la solución de prob-lemas estándares de optimización logística. Examinamos los elementos esenciales en la aplicación exitosa de la VNS a los problemas más importantes de optimización logística y se revisan las contribuciones más importantes en esta línea aparecidas en la literatura.

15:00-16:00 Session Semi Plenary: Local Solver - Julien Darlay CHAIR: Angel Juan LOCATION: 40.012



16:30-18:00 Session T4.1: Automated Algorithm Design CHAIR: Thomas Stützle LOCATION: 40.004

16:30 Hoong Chuin Lau, Mustafa Misir, Xiang Li and Lingxiao Jiang ADVISER+: Toward a Usable Web-based Algorithm Portfolio Deviser

16:50 Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari and Thomas Stützle The irace Package: Iterated Racing for Automatic Algorithm Configuration

17:10 Alberto Franzin and Thomas Stützle Revisiting Simulated Annealing: From a Component-Based Analysis to an Automated De-sign of Simulated Annealing Algorithms

17:30 Aymeric Blot, Marie-Eleonore Kessaci-Marmion and Laetitia Jourdan AMH: a new Framework to Design Adaptive Metaheuristics

16:30-18:00 Session T4.2: Metaheuristics in Cloud Computing CHAIR: Eduardo Lalla-Ruiz LOCATION: 40.006

16:30 Leonard Heilig, Eduardo Lalla-Ruiz and Stefan Voß A Brokering Approach for Multi-Objective Resource Allocation in Cloud Computing

16:50 Augusto Amarilla, Leonardo Benitez, Saul Zalimben, Fabio López-Pires and Benjamin Baran Evaluating a Two-Phase Virtual Machine Placement Optimization Scheme for Cloud Com-puting Datacenters

17:10 Szymon Wasik, Maciej Antczak, Jan Badura, Artur Laskowski, Maciej Olszowy, Tomasz Sternal and Krzysztof Wedrowicz Optil.io Platform: Evaluation as a Service for Metaheuristics

17:30 Sergio Nesmachnow, Javier Alsina, Santiago Iturriaga, Bernabe Dorronsoro and Andrei Tch-ernykh Evolutionary planning for IaaS virtual brokering in the cloud

16:30-18:00 Session T4.3: Metaheuristics - General CHAIR: Christopher Expósito Izquierdo LOCATION: 40.008

16:30 Hugo Deschênes and Caroline Gagné Hybridizing Particle Swarm Optimization Variants on Continuous Optimization Functions

16:50 José Pedro Aguerre, Rodrigo Bayá, Renzo Massobrio and Sergio Nesmachnow An evolutionary algorithm for harmonic music composition

17:10 Vasileios Tatsis and Konstantinos Parsopoulos Grid-Based Parameter Adaptation in Particle Swarm Optimization

17:30 Feristah Ozcelik A differential evolution algorithm for single model U-type assembly line balancing problem


16:30-18:00 Session T4.4: Logistics and Supply Chain Management CHAIR: Carlos Quintero LOCATION: 40.010

16:30 Francesca Guerriero, Luigi Di Puglia Pugliese and Giusy Macrina An iterated local search precedure for the green vehicle routing problem with heteroge-neous fleet and time windows

16:50 David Alvarez Martinez, Luis Miguel Escobar Falcón and John Willmer Escobar A hybrid metaheuristic approach for the two-dimensional loading vehicle routing problem with heterogeneous fleet (2L-HFVRP)

17:10 Reza Tavakkoli-Moghaddam, Fatemeh Faghih-Mohammadi, Hamed Shakouri-Ganjavi and Mo-hammad Mahdi Nasiri Solving a supply chain design problem by the krill herd algorithm

17:30 Christin Schumacher, Moritz Pöting, Jonas Rau and Christian Tesch Combining DES with metaheuristics to improve scheduling and workloads in parcel trans-shipment terminals

16:30-18:00 Session T4.5: SEIO.RedHeur - Spanish Heuristic Working Group CHAIR: Rafael Marti LOCATION: 40.012

20:00-23:00 Session: Dinner

I.)0-/+!@7$/!JD6

09:00-10:00 Session F1.1: Metaheuristics and Machine Learning CHAIR: Talbi El-Ghazali LOCATION: 20.017

09:00 Laura Calvet, Jésica de Armas, David Masip and Angel A. Juan Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs

09:20 Maik Deininger, Markus Rabe and Angel A. Juan Setting the Number of Simulation Runs in a Simheuristic Algorithm: a statistical-based approach

09:40 Mauricio Solar, Philippe Michelon and John Atkinson Artificial Immunne Systems based Astronomy Scheduling

09:00-10:00 Session F1.2: Metaheuristics in Education CHAIR: Eva Vallada LOCATION: 20.019

09:00 Laura Calvet and Angel A. Juan Teaching metaheuristics online: experiences at the Open University of Catalonia

09:20 Javier Panadero, Laura Calvet, Joan Manuel Marquès and Angel Juan Introducing Metaheuristics in an e-learning Course on Distributed Systems


09:00-10:00 Session F1.3: Metaheuristics in Port Logistics and Related Problems CHAIR: Ramón Álvarez-Valdés LOCATION: 20.021

09:00 Israel López Plata, Christopher Expósito Izquierdo, Belen Melián Batista and José Marcos Moreno Vega A General Framework for Handling Synchronization when Scheduling Automated Guided Vehicles

09:20 Jairo Junior Rangel Redondo, Zulay Onelys Sarmiento Arévalo and Daniel Alfonso Mendoza-Casseres Programación de un sistema portuario implementando algoritmos genéticos con un modelo de simulación

09:40 Juan Francisco Correcher and Ramon Alvarez-Valdes A Biased Random-Key Genetic Algorithm for the Berth Allocation and Quay Crane Assignment Problem

09:00-10:00 Session F1.4: Metaheuristics - General CHAIR: Ibrahim Hassan Osman LOCATION: 20.023

09:00 Ibrahim H. Osman and Karl T. Sawaya An improved Cuckoo Search Algorithm for the cardinality constraint portfolio optimization problem

09:20 Piotr Matl, Richard F. Hartl and Thibaut Vidal Can single-objective metaheuristics efficiently solve multi-objective problems?

09:40 Maxence Vandromme, Julie Jacques, Julien Taillard, Laetitia Jourdan and Clarisse Dhaenens A local search-based multi-objective metaheuristic for biclustering on heterogeneous data

09:00-10:00 Session F1.5: Metaheuristics General (MAEB) CHAIR: José Manuel Colmenar LOCATION: 20.025

09:00 José Manuel Colmenar and José Ignacio Hidalgo Análisis de algoritmos de evolución gramatical en problemas de regresión simbólica

09:20 Sancho Salcedo-Sanz, Adrian Aybar-Ruiz, Carlos Camacho-Gómez and Emiliano Pereira A Fractal-based Mutation Operator from Iterated Function Systems

09:40 Juan F. Valenzuela-Valdés, Francisco Luna, Pablo Padilla, José Luis Padilla and Rafael M. Luque-Baena Redes de sensores seguras y eficientes con beamforming

10:00-11:30 Session Plenary: Panel Discussion in Industrial Applications CHAIR: Ana Viana and Angel A. Juan LOCATION: 30.S01 Auditorium

MAURICIO RESENDE, Principal Research Scientist in the transportation area at Amazon, USA. NURIA OLIVER, Data Science Director of Vodafone and the Chief Data Scientist at Data-Pop Alliance. RICARDO BAEZA-YATES, CTO of NTENT, a semantic search technology company based in California, USA. HENNING WAGNER, Head of IT Service Management at Rhenus Freight Logistics. KRISTOF ROOMP, Principal Software Architect working at Microsoft. ENRIQUE ALFONSECA, Staff Research Scientist at Google.


11:30-12:00 Session : Coffee Break LOCATION: Patio Jaume I building

12:00-13:30 Session F2.1: Scheduling CHAIR: Reza Tavakkoli-Moghaddam LOCATION: 20.017

12:00 Petra Vogl, Roland Braune and Karl Doerner A Comparison of Genetic Algorithm and Local Search Based Algorithms for Scheduling Recurring Radiotherapy Treatment Activities with Time Window Constraints and Optional Activities

12:20 Fermin Mallor and Pedro Mateo A GRASP ALGORITHM FOR SCHEDULING EMERGENCY ROOM PHYSICIANS

12:40 Johannes Maschler, Thomas Hackl, Martin Riedler and Günther Raidl An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem

13:00 Jean-Charles Billaut, Federico Della Croce and Quang Chieu Ta Tabu search and matheuristic algorithms for solving an integrated flow shop and vehicle routing problem

12:00-13:30 Session F2.2: Air Transportation and Airport Logistics / Smart Cities CHAIR: Daniel Guimarans LOCATION: 20.019

12:00 Jamal Toutouh, Javier Arellano-Verdejo and Enrique Alba Enabling Low Cost Smart Road Traffic Sensing

12:20 Edoardo Fadda, Guido Perboli, Mariangela Rosano and Roberto Tadei Internet of Things in urban waste collection

12:40 Daniel Guimarans, Pol Arias and Wenjing Zhao A simheuristic approach for solving the Aircraft Recovery Problem with stochastic delays

13:00 Pol Arias, Daniel Guimarans and Angel A. Juan A Simple and Efficient Metaheuristic for the Dynamic Flight Scheduling Problem

12:00-13:30 Session F2.3: Metaheuristics - General CHAIR: Christian Blum LOCATION: 20.021

12:00 Rafael Martí, Anna Martínez-Gavara, Jesús Sánchez-Oro and Abraham Duarte Heuristics for the Dynamic Bipartite Drawing Problem

12:20 Yuri C. P. Soares, Pedro J. de Rezende and Cid C. de Souza Computing Short Edge-Flipping Sequences Between Triangulations: a Heuristic Approach

12:40 Sergio Consoli, Jan Korst, Gijs Geleijnse and Steffen Pauws On the minimum quartet tree cost problem

13:00 Mohamed Rahmouni and Anissa Omrane Equitable Coloring of Graphe: New genetic method


12:00-13:30 Session F2.4: Metaheuristics - General CHAIR: Celso Ribeiro LOCATION: 20.023

12:00 Michele Ciavotta, Srdjan Krstić and Damian A. Tamburri HyperSpark: A Software Engineering Approach to Parallel Metaheuristics

12:20 Julian Molina, Ana Dolores López-Sánchez, Alfredo G. Hernández-Díaz and Iris A. Martínez-Sala-zar A Multi-Start Algorithm with Intelligent Neighborhood Selection

12:40 Evelia Lizárraga, Maria J. Blesa and Christian Blum On the comparison of CMSA versus LNS for solving Combinatorial Optimization problems with different solution sizes

13:00 Celso Ribeiro and Alberto Reyes Extending time-to-target plots to multiple instances and targets: mttt-plots

12:00-13:30 Session F2.5: Metaheuristics General (MAEB) CHAIR: Carlos Andrés Romano LOCATION: 20.025

12:00 Airam Expósito Márquez, Günther R. Raidl, Julio Brito Santana and José A. Moreno Pérez Un GRASP/VNS para un problema de recogida de leche modelado como PVRPTW

12:20 Juan A. Aledo, Jose Gamez and Alejandro Rosete Nuevas heurísticas de construcción para el problema del ordenamiento óptimo de buckets

12:40 Carlos Andres, Julien Maheut and José Pedro García Un algoritmo genético para resolver el problema de se-cuenciación en carruseles con huecos

13:30-14:30 Session Closing: History and Future of Metaheuristics. 2017 EURO / MIC-MAEB Award to the best student. MIC 2019?

CHAIRS: Belén Mélian and Helena Ramalhinho LOCATION: 30.S01 Auditorium

Sponsors

mic2017.upf.edu

12 Metaheuristics International Conference XII...

Documents

Transcript of 12 Metaheuristics International Conference XII...