Conference Program

18:30-18:50

A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems

Christian Kloimüllner and Günther Raidl

18:50-19:10

A Statistical Test of Heterogeneous Subgraph Densities To Assess Clusterability

Pierre Miasnikof, Liudmila Prokhorenkova, Alexander Y. Shestopaloff and Andrei M. Raigorodskii

19:10-19:30

How to use Boltzmann Machines and Neural Networks for Covering Array Generation

19:30-19:50

A Similarity Hybrid Harmony Search Algorithm for the Capacitated Team Orienteering Problem

Eleftherios Tsakirakis, Magdalene Marinaki, Yannis Marinakis

10:30-10:50

Adaptive GVNS heuristics for solving the Pollution Location Inventory Routing Problem

Panagiotis Karakostas, Angelo Sifaleras and Michael Georgiadis

10:50-11:10

A simple Dual-RAMP for the Capacitated Facility Location Problem

Telmo Matos, Óscar Oliveira and Dorabela Gamboa

11:10-11:30

Landscape-Aware Constraint Handling Applied to Differential Evolution

Katherine Malan

11:30-11:50

Learning Probabilistic Constraints for Surgery Scheduling using a Support Vector Machine

Thomas Philip Runarsson

11:50-12:10

Adaptive Sequence-based Heuristic for the Three-Dimensional Bin Packing Problem

Oscar Oliveira, Telmo Matos and Dorabela Gamboa

14:00-14:20

Quadratic Unconstrained Binary Optimization (QUBO) with Extremal Optimization

Stefan Boettcher

14:20-14:40

Stochastic efficiency measures for production units with correlated data

Chiang Kao and Shiang-Tai Liu

14:40-15:00

Optimization of Generalized Halton Sequences by Differential Evolution

Pavel Kromer, Jan Platos and Vaclav Snasel

15:00-15:20

A new Mayfly optimization algorithm

Konstantinos Zervoudakis and Stelios Tsafarakis

15:20-15:40

Multi-Method Optimization in Large-Scale Airport Staff Scheduling

Andreas Klinkert

16:10-16:30

A new hybrid Firefly – Genetic Algorithm for the optimal product line design problem

Konstantinos Zervoudakis and Stelios Tsafarakis

16:30-16:50

A RAMP algorithm for large-scale Single Source Capacitated Facility Location Problems

Óscar Oliveira, Telmo Matos and Dorabela Gamboa

16:50-17:10

A Hybrid Immunological Search for the Weighted Feedback Vertex Set Problem

Vincenzo Cutello, Maria Oliva, Mario F. Pavone and Rocco A. Scollo

17:10-17:30

A Hessian Free Neural Networks Training Algorithm with Curvature Scaled Adaptive Momentum

Flora Sakketou and Nicholas Ampazis

10:00-10:20

Model Analysis of Min-Cost Attack-Aware Logical Link Assignment in Software-Defined Networking

A. Rosle, S.C. Tan, S. Ali, C.K. Lee, Z. Yusoff, R. Kapsin

10:20-10:40

On polynomial solvability of one quadratic Euclidean clustering problem on a line

Alexander Kelmanov and Vladimir Khandeev

10:40-11:00

Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence

Alexander Kelmanov, Sergey Khamidullin and Anna Panasenko

11:00-11:20

Asymptotically Optimal Algorithms for the Prize Collecting Traveling Salesman Problem on Random Inputs

Edward Kh. Gimadi and Oxana Tsidulko

10:30-10:50

On a cooperative VNS parallelization strategy for the capacitated vehicle routing problem

Panagiotis Kalatzantonakis, Angelo Sifaleras and Nikolaos Samaras

10:50-11:10

Irreducible bin packing: complexity, solvability and application to the routing open shop

Ilya Chernykh and Artem Pyatkin

11:10-11:30

An Artificial Bee Colony Algorithm for the Multiobjective Energy Reduction Multi-Depot Vehicle Routing Problem

Emmanouela Rapanaki, Iraklis-Dimitrios Psychas, Magdalene Marinaki and Yannis Marinakis

11:30-11:50

Sonar Inspired Optimization in Energy Problems Related to Load and Emission Dispatch

Alexandros Tzanetos and Georgios Dounias

12:30-12:50

Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

Roman Plotnikov and Adil Erzin

12:50-13:10

Optimizing partially defined black-box functions under unknown constraints via Sequential Model Based Optimization: an application to Pump Scheduling Optimization in Water Distribution Networks

Antonio Candelieri, Bruno Galuzzi, Ilaria Giordani, Riccardo Perego and Francesco Archetti

13:10-13:30

Towards Improving Merging Heuristics for Binary Decision Diagrams

Nikolaus Frohner and Günther Raidl

13:30-13:50

Assessing simulated annealing with variable neighborhoods

10:30-10:50

On asymptotically optimal solvability of Euclidean Max m-k-Cycles Cover Problem

Edward Kh. Gimadi and Ivan Rykov

10:50-11:10

A novel solution encoding in the Differential Evolution Algorithm for optimizing Tourist Trip Design Problems

Dimitra Trachanatzi, Manousos Rigakis, Andromachi Taxidou, Magdalene Marinaki, Yannis Marinakis, and Nikolaos Matsatsinis

11:10-11:30

Barrier Covering in 2D Using Mobile Sensors with Circular Coverage Areas

Adil Erzin, Natalya Lagutkina and Nika Ioramishvili

11:30-11:50

Live Soccer Betting Using XGBoost and The Kelly Criterion

I. Ilkay Boduroglu

14:00-14:20

Evolving Gaussian Process kernels for translation editing effort estimation

Ibai Roman, Roberto Santana, Alexander Mendiburu and Jose A. Lozano

14:20-14:40

Bayesian Optimization approaches for massively multi-modal problems

Ibai Roman, Alexander Mendiburu, Roberto Santana and Jose A. Lozano

14:40-15:00

Predicting the execution time of the interior point method for solving linear programming problems using artificial neural networks

Sophia Voulgaropoulou, Nikolaos Ploskas and Nikolaos Samaras

15:00-15:20

A SAT Approach for Finding Sup-Transition-Minors

Benedikt Klocker, Herbert Fleischner and Günther Raidl