View the program in our Progressive Web App
Program for stream Heuristic Optimization
Sunday
Monday
Tuesday
Tuesday, 10:30-12:00
TB-33: Local search and metaheuristics
Stream: Heuristic Optimization
Room: Virtual Room 33
Chair(s):
Merve Uzuner Sahin
-
Development of a Local Search Method for a Large-Scale Generalized Assignment Problem
Yuto Yoshida -
Artificially Intelligent Evolutionary Algorithms in Designing Multi-Layered Supply Chain Networks: A Comparative Analysis
Sahar Validi -
Ant Colony Optimization for the Network Alignment Problem
Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum -
Redundancy Allocation Optimization with Repairs: A Simulation-Based GA Approach
Merve Uzuner Sahin, Orhan Dengiz, Berna Dengiz
Tuesday, 12:30-14:00
TC-06: Heuristics, mathheuristics and hyperheuristics
Stream: Heuristic Optimization
Room: Building Δ, Room Δ103
Chair(s):
Patrick Huber
-
An adaptive call center routing policy
Siqiao Li, Ger Koole -
Robust Bin Packing with Budgeted Uncertainty
Noam Goldberg, Marin Bougeret, Gyorgy Dosa, Michael Poss -
A redefinition and solution of the Urban Transit Routing problem as a heterogeneous electrical variant
Patrick Huber, Uli Goehner
Tuesday, 14:30-16:00
TD-57: Local search and metaheuristics 2
Stream: Heuristic Optimization
Room: Virtual Room 57
Chair(s):
Duc-Minh Vu, Thanh Tan Doan
-
Solving The Uncapacitated Single Allocation Green p-Hub Center Routing Problem using a Clustering Based Simulated Annealing Heuristic
EL MEHDI IBNOULOUAFI, Mustapha OUDANI, Mounir Ghogho, Tarik Aouam -
New models and ILS-based metaheuristic for the clustered traveling salesman problem with relaxed priority rule
Thanh Tan Doan, Nathalie Bostel, Minh Hoang Ha -
A Grey Wolf Optimizer Algorithm for the Vehicle Routing Problem with Time Windows and Pick-ups and Deliveries
milad faramarzzadeh -
A Practical and Large-Scale Multi-Depot Vehicle Routing Problem
Duc-Minh Vu, Emrah Demir, Vasco S. Rodrigues, Aris Syntetos, Tim Bickley
Tuesday, 16:30-18:00
TE-57: Heuristics and matheuristics
Stream: Heuristic Optimization
Room: Virtual Room 57
Chair(s):
Yun Lu
-
Methodology for Generating Bounded Solutions for the Set K-Covering Problems
Yun Lu, Francis Vasko -
A Discrete Event Multi-Agent Based Approach to the Scheduling and Routing Problems in a RMFS.
Sander Teck, Reginald Dewil -
Solving the Capacitated Location-Routing Problem via an Iterative Matheuristic Algorithm
Theocharis Metzidakis, Panagiotis Repoussis, Manolis Kritikos, George Ioannou -
Metaheuristic Approaches for Generalized Assignment Problem of An Online Education Website
MERVE ÖZER