Program for Wednesday, June 5th: Talk View

PROGRAM FOR WEDNESDAY, JUNE 5TH: TALK VIEW

Days:

previous day

next day

all days

View: with abstracts session overview

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

16:30

17:00

17:30

18:00

18:30

08:45-09:45 Plenary Daniele VIGO

10:15-10:45

Breakout Local Search for Heaviest Subgraph Problem

He Zheng, Jin-Kao Hao

10:45-11:15

A matheuristic for a maintenance planning problem with non-convex objective function

Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi

11:15-11:45

Fixed set search matheuristic applied to the min-Knapsack problem with compactness constraints and penalty

Ahmet Cürebal, Stefan Voss, Raka Jovanovic

11:45-12:15

Matheuristic variants of DSATUR for the vertex coloring problem

Nicolas Dupin

10:15-10:45

Hexaly Optimizer 12.5: A model & run solver based on heuristics and exact technics.

Julien Darlay

10:45-11:15

Behaviour Analysis of Trajectory and Population-based Metaheuristics on Flexible Assembly Scheduling

O. Maghiar, A. Copie, T. Selea, M. Marin, F. Micota, D. Zaharie, I. Tepeneu

11:15-11:45

Solving an Integrated Bi-objective Container Terminal Integrated Planning with Transshipment

Marwa Samrout, Abdelkader Sbihi, Adnan Yassine

11:45-12:15

Job-Shop Scheduling with robot synchronization for transport operations

Gayon Jean-Philippe, Lacomme Philippe, Oussama Amine

10:15-10:45

A variable neighborhood search approach for the S-labeling problem

Marcos Robles, Sergio Cavero, Eduardo G. Pardo

10:45-11:15

Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination

A. Casado Ceballos, J. Sánchez-Oro Calvo, A. Martínez Gavara, A. Duarte

11:15-11:45

A Variable Formulation Search Approach for Three Graph Layout Problems

Sergio Cavero, J. Manuel Colmenar, Eduardo García Pardo

11:45-12:15

VNS-based matheuristic approach to Group Steiner Tree with problem-specific node release strategy

Tatjana Davidovic, Slobodan Jelić

10:15-10:45

Reactive path relinking algorithm

A.D. López-Sánchez, I. Lozano-Osorio, J. Sánchez-Oro, A. Duarte

10:45-11:15

VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem

Miguel Reula, Consuelo Parreño-Torres, Anna Martínez-Gavara, Rafael Martí

11:15-11:45

A historical review of GRASP with Path Relinking

A. Martínez-Gavara, M. Laguna, R. Marti, S. Pérez-Peló, M. Resende

11:45-12:15

Combining Neighborhood Search with Path Relinking: a statistical evaluation of path relinking

Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux

10:15-10:45

Tabu Search for Solving Covering Salesman Problem with Nodes and Segments

Takafumi Matsuura

10:45-11:15

Investigation of the Benefit of Extracting Patterns from Local Optima to solve a Bi-objective VRPTW

Clément Legrand, Diego Cattaruzza, Laetitia Jourdan, Marie-Eleonore Kessaci

11:15-11:45

A Memetic Algorithm for Large-Scale Real-World Vehicle Routing Problems with Simultaneous Pickup and Delivery with Time

Ethan Gibbons, Beatrice Ombuki-Berman

11:45-12:15

Improving Hybrid-Genetic-Search for the Capacited Vehicle Routing Problem: a deep learning approach

Adrien Pichon, Alexandru-Liviu Olteanu, Marc Sevaux

14:00-15:00 Plenary Belén MELIÁN-BATISTA

15:05-16:00 Julia tutorial: metaheuristic implementation

16:30-17:00

Learning Sparse-lets for Interpretable Classification of Event-interval Sequences

Lorenzo Bonasera, Davide Duma, Stefano Gualandi

17:00-17:30

Extended set covering for time series segmentation

Vittorio Maniezzo

17:30-18:00

A Chaotic Search Method by Using Adaptive Penalty Coefficient with Temperature Annealing for the Vehicle Routing Problem with Time

Syunsuke Haga, Kazuma Nakajima, Takayuki Kimura

16:30-17:00

AdaptQUBO: A New Quantum-inspired Metaheuristic QUBO Solver

Yu Du

17:00-17:30

Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver

Vorapong Suppakitpaisarn, Jin-Kao Hao

17:30-18:00

Comparing Integer Encodings in QUBO for Quantum and Digital Annealing: The Travelling Salesman

Philippe Codognet

16:30-17:00

Optimization of fairness and accuracy on Logistic Regression models

Javier Yuste, Eduardo G. Pardo, Abraham Duarte

17:00-17:30

Exploring the integration of General Variable Neighborhood Search with exact procedures for the optimization of the Order Batching

Sergio Gil Borrás, Eduardo García Pardo

16:30-17:00

A vertex weighting-based double-tabu search for the classical p-center problem

Qingyun Zhang, Zhipeng Lu, Zhouxing Su, Chumin Li

17:00-17:30

An Empirical Analysis of Tabu Lists

Francesca Da Ros, Luca Di Gaspero

17:30-18:00

Multi-operator driven iterated tabu search for collaborative operating room scheduling

Yang Wang, Daiqiang Yin, Abraham Punnen

16:30-17:00

Optimization models for fair horizontal collaboration in demand-responsive transportation

Morandi, M.Grazia Speranza, Enrico Angelelli

17:00-17:30

A Matheuristic Multi-Start Algorithm for a Novel Static Repositioning Problem in Public Bike-Sharing

Julio-Mario Daza-Escorcia, David Alvarez Martinez

17:30-18:00

A decomposition-based metaheuristic to evaluate large-scale ride-sharing systems

Gerhard Hiermann, Maximilian Schiffer

18:00-18:30

Optimization of A Last Mile Delivery Model with A Truck and A Drone Using Mathematical Formulation and A VNS

Batool Madani, Malick Ndiaye, Said Salhi

18:00-18:30 ICVNS: Future paths

09:45-10:15 Coffee Break

12:15-14:00 Lunch Break

16:00-16:30 Coffee Break