MIC2026: 16TH METAHEURISTICS INTERNATIONAL CONFERENCE
PROGRAM

Days: Monday, June 8th Tuesday, June 9th Wednesday, June 10th Thursday, June 11th

Monday, June 8th

View this program: with abstractssession overviewtalk overview

09:30-10:30 Session 2A: Routing and Logistics I
Location: Pithecusa
09:30
A Cluster-First Route-Second Approach for the Multiple Close-Enough Traveling Salesman Problem (abstract)
09:50
Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem with Heterogeneous Speeds (abstract)
10:10
Multi-Objective Ant Colony Optimization Approach for the Traveling Salesman Problem with Profits (abstract)
09:30-10:30 Session 2B: Decomposition and Search Structures
Location: Primavera
09:30
Parameter-less Step Counting Hill-Climbing (abstract)
09:50
Advancing the 2-Optimality Motif Finding problem: new benchmarks and efficient algorithms (abstract)
10:10
Fourier Transform-based instance decomposition for k-adic Assignment Problems (abstract)
11:00-13:00 Session 3A: Scheduling and Planning I
Location: Pithecusa
11:00
Multi-mode resource-constrained project scheduling problem with time-dependent resource costs and capacities: A bi-objective approach (abstract)
11:20
A multi-objective metaheuristic for the multi-skill resource-constrained project scheduling with heterogeneous efficiencies and resource costs (abstract)
11:40
A Date-Conscious Extension of the Disruption and Repair Method for Shift Scheduling (abstract)
12:00
A Case Study of a Transportation Company Modeled as a Scheduling Problem (abstract)
12:20
Comparing Optimization Models for Radiotherapy Scheduling (abstract)
12:40
A GRASP approach for the Three-Stage Remanufacturing System Scheduling Problem (abstract)
11:00-13:00 Session 3B: Learning and Automated Design I
Location: Primavera
11:00
Can Large Language Models Solve Combinatorial Optimization Problems? An Experimental Study on the Traveling Salesman Problem (abstract)
11:20
Large Language Models for Metaheuristic Implementation: A Case Study with Variable Neighborhood Search (abstract)
11:40
irace-evo: Automatic Algorithm Configuration Extended With LLM-Based Code Evolution (abstract)
12:00
Large Language Models for Automatic Algorithm Configuration - An Empirical Study on Black-Box Optimization (abstract)
12:20
Code World Models for Parameter Control in Evolutionary Algorithms (abstract)
12:40
LLM-Guided Genetic Programming for Automated Constructive Heuristic Design: An Application to the Set Packing Problem (abstract)
14:30-15:30 Session 4: Invited talk by Helena Ramalhinho Lourenço
Location: Pithecusa
14:30
Driving Social Good: How Optimization Enhances Care and Equity (abstract)
16:00-18:00 Session 5A: Routing and Logistics II
Location: Pithecusa
16:00
Large Neighborhood and Hybrid Genetic Search for Inventory Routing Problems (abstract)
16:20
A Biased Random-Key Genetic Algorithm with Rolling Horizon for the Meal Delivery Routing Problem (abstract)
16:40
A Hybrid Genetic Search for the Inventory Routing Problem (abstract)
17:00
An Adaptive Large Neighbourhood Search for the Selective Multi-Commodity Pickup and Delivery Traveling Salesman Problem (abstract)
17:20
A Hybrid Genetic Algorithm for Quality and Emission Aware Perishable Goods Collection (abstract)
17:40
Guided Strategic Oscillation with Reinforcement Learning for the Shared Customer Collaboration Vehicle Routing Problem (abstract)
16:00-18:00 Session 5B: Learning and Automated Design II
Location: Primavera
16:00
Learning to Steer PSO: A Vectorized RL Framework with Subswarm and Restart Control (abstract)
16:20
Triplet-Based Surrogate Assisted Ranking for Multi-objective Neural Architecture Search (abstract)
16:40
Unified Multi-Objective Framework for Simultaneous Feature Selection and MLP Pruning using NSGA-III with Non-Smooth L1/2 Regularization (abstract)
17:00
Impact of temperature-length strategies on Simulated Annealing performance (abstract)
17:20
Enhancing Metaheuristics with Kernel Density Estimation: a Statistical Learning Strategy for Smarter Optimization (abstract)
PRESENTER: Tommaso Pastore
17:40
Reinforcement Learning for Cost Estimation in Two-Level Combinatorial Decision Problems (abstract)
Tuesday, June 9th

View this program: with abstractssession overviewtalk overview

08:30-10:30 Session 6A: Location and Facility Design
Location: Pithecusa
08:30
Matheuristic for the multi-source capacitated facility location problem with customer incompatibilities (abstract)
08:50
A window-based matheuristic for the single row facility layout problem (abstract)
09:10
Efficient Metaheuristic Strategies for the Survivable One-Fault Tolerant-Ring Star Problem (abstract)
09:30
A fast metaheuristic for the ordered median tree location problem (abstract)
09:50
The Gradual Minimum Covering Location Problem (abstract)
10:10
A Bi-Objective Formulation of the K-Page Crossing Number Minimization Problem (abstract)
08:30-10:30 Session 6B: Routing and Logistics III
Location: Primavera
08:30
A column generation driven heuristic for order-scheduling and rack-sequencing in robotic mobile fulfillment systems (abstract)
08:50
A Decomposition Framework for Mixed-Integer Linear Models with Routing Subproblems Using Simulated Annealing (abstract)
09:10
Inter-Terminal Truck Routing Optimization Using Lookahead-DQN (abstract)
09:30
A Pruning-Aided Resource-Constrained Search Algorithm for the Weight Constrained Shortest Path Problem with Applications to Urban Digital Twins (abstract)
09:50
Solution Techniques for the Integrated Problem of Warehouse Operations and Delivery Activities (abstract)
10:10
FILO2xe for Galileo: Linking Multiple FILO2x Extended Runs (abstract)
11:00-12:00 Session 7: Tutorial by Roberto Battiti
Location: Pithecusa
11:00
Intelligent Optimization for self-improving reliable Artificial Intelligence (abstract)
12:00-13:00 Session 8A: Special Sessions on Discrete and Quantum-Inspired Metaheuristics I
Location: Pithecusa
12:00
Heuristics for the Periodic Vehicle Routing Problem with Consistency (abstract)
12:20
CMSA with Reinforcement Learning for the Knapsack Problem with Forfeit Sets (abstract)
12:40
Quantum-Enhanced Chaotic Differential Evolution for Oral Cancer Detection with DenseNet-201 (abstract)
PRESENTER: Subhas Mondal
12:00-13:00 Session 8B: Cutting and Packing
Location: Primavera
12:00
A multi-population BRKGA for the three-dimensional strip packing problem (abstract)
12:20
A genetic algorithm approach for the discrete and continuous two-dimensional variable-sized stock problems (abstract)
12:40
A Constructive Heuristic and a Matheuristic for the Distributor's Pallet Loading Problem (abstract)
14:30-15:30 Session 9: Hexaly industrial talk
Location: Pithecusa
14:30
Hexaly, a New Kind of Global Optimization Solver (abstract)
Wednesday, June 10th

View this program: with abstractssession overviewtalk overview

08:30-10:30 Session 10A: Routing and Logistics IV
Location: Pithecusa
08:30
A Matheuristic for the Electric Vehicle Routing Problem with Time Windows, Multiple Recharge Technologies and a Realistic Energy Consumption Model (abstract)
08:50
The value of collaborative exchange in the E-VRPTW with Stochastic Waiting Times (abstract)
09:10
A matheuristic approach for the Collision-Free Multiple Close-Enough Arc Routing Problem (abstract)
09:30
Q-Learning-Guided Variable Neighborhood Search for Vehicle Routing Problems (abstract)
09:50
Learning the Savings Values of the Clarke and Wright Heuristic: an Application to the EVRP-RJ-RT (abstract)
10:10
An enhanced Genetic Algorithm with RL for a rich routing problem with optional cross-dock (abstract)
08:30-10:30 Session 10B: Metaheuristic Design I
Location: Primavera
08:30
A Non-dominated Sorting Biased Random-Key Genetic Algorithm for the Multi-Objective Physical Cell Identity Assignment Problem (abstract)
08:50
Bilevel Optimization for Fair Energy Communities Using a Hybrid Metaheuristic (abstract)
09:10
Guided Differential Evolution through history sliding population (abstract)
09:30
Autoencoder-Based Novelty Search for Instance Generation: A Case Study on the Linear Ordering Problem (abstract)
09:50
Exploring Parameter Sensitivity and Grouping Strategies in Ant Colony Optimization for Weighted Networks (abstract)
10:10
How to apply multiparent path relinking (abstract)
11:00-13:00 Session 11A: Graph and Network Optimization I
Location: Pithecusa
11:00
An Iterated Local Search to the Perfect Awareness Problem (abstract)
11:20
A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization (abstract)
11:40
Effective Metaheuristic Approaches for the Fair Max-Min Diversity Problem (abstract)
12:00
Exploiting ILS for a Simulation-Optimization framework in 5G Networks (abstract)
12:20
A GRASP for the minimum variance k-subset problem (abstract)
12:40
Performance Evaluation of Metaheuristic-Based Routing Strategies in Mobile Ad Hoc Networks (abstract)
11:00-13:00 Session 11B: Special Sessions on Simheuristics, Learnheuristics and Data-Driven Search
Chair:
Location: Primavera
11:00
Simheuristics (abstract)
11:20
Sim-Learnheuristics: A Tool for Decision Making Under Stochastic and Dynamic Conditions. (abstract)
11:40
Using Biased-Randomized Transformers as a Deep Heuristic for Agile Optimization (abstract)
12:00
A metaheuristic framework for solving the 2D flexible stock x cutting stock problem (abstract)
12:20
A Combined Simulation-Based and Relocation Heuristic for Wireless Access Point Localization (abstract)
12:40
A bi-objective time consistent vehicle routing problem for home chemotherapy (abstract)
14:30-15:30 Session 12: Invited talk by Kenneth Sörensen
Location: Pithecusa
14:30
From algorithmic competition to empirical science: a new metaheuristics paradigm (abstract)
16:00-18:00 Session 13A: Scheduling and Planning II
Location: Pithecusa
16:00
AGV Scheduling with Battery Constraints by Multi-Neighborhood Search (abstract)
16:20
Multi-Neighborhood Search for the Train Dispatching Problem (abstract)
16:40
Efficient Algorithms for Energy-Aware Single-Machine Scheduling with Battery Storage (abstract)
17:00
A Comparison of Problem-Agnostic and Problem-Specific Decomposition Strategies: CMSA versus RFO for Lot-Sizing and Scheduling (abstract)
17:20
An Adaptive Large Neighborhood Search For The Automated Guided Vehicle Scheduling With Battery Constraints (abstract)
17:40
Shiftwork Scheduling Problem Incorporating Worker Health and Well-Being conditions under a bi-objective NSGAII approach (abstract)
16:00-18:00 Session 13B: Special Sessions on Discrete and Quantum-Inspired Metaheuristics II
Location: Primavera
16:00
Beyond QUBO: Direct Optimization of Higher-Order Binary Models (abstract)
16:20
Strategic Oscillation Strategies for Set Covering Problem (abstract)
16:40
Ant Colony Optimization Method Incorporating a Probability Density Function Determination Based on Information Entropy (abstract)
17:00
A temperature guided quantum hybrid column generation heuristic for the Agile Sprint Planning Problem (abstract)
17:20
Decomposition Strategies for a Large-Scale Multi-Product Barge Inventory Routing Problem (abstract)
17:40
Quantum-Reinforced Dual-Space Differential Evolution: A Synergistic Integration for Global Optimization (abstract)
PRESENTER: Saptadeep Biswas
Thursday, June 11th

View this program: with abstractssession overviewtalk overview

08:30-10:30 Session 14A: Routing and Logistics V
Location: Pithecusa
08:30
A Scalable Nonlinear Clarke–Wright Savings Method for Bi-Objective Capacitated Vehicle Routing Problem (abstract)
08:50
A Hybrid Chaotic Search Method for Solving CVRP (abstract)
09:10
Solving the Periodic-TSP Using Lin-Kernighan-Helsgaun-3 Algorithm (abstract)
PRESENTER: Tarek Boufar
09:30
Best-improving Local Search using candidate list strategies: An empirical analysis for the Traveling Salesman Problem (abstract)
09:50
Impact of Scaling and Rounding on Metaheuristic Performance for the Vehicle Routing Problem with Time Windows (abstract)
10:10
CVRPLIB BKS Challenge: attempt, defeat and feedback (abstract)
PRESENTER: Marc Sevaux
08:30-10:30 Session 14B: Graph and Network Optimization II
Location: Primavera
08:30
Variable Neighborhood Search for the Minimum k-Dominating Set Problem (abstract)
08:50
Subgraph Sampling Scheme heuristics for the solution of the Max-Cut problem (abstract)
09:10
The Data-Dependent Carousel Greedy Algorithm for the Minimum Vertex Cover Problem (abstract)
09:30
Greedy Randomized Adaptive Search Procedure for the Partial Set Covering Problem (abstract)
09:50
A Comparative Study of Simulated Annealing-Based Methods for the Multi-Objective Hub Location Problem (abstract)
11:00-12:00 Session 15: Tutorial by Mauricio G. C. Resende
Location: Pithecusa
11:00
Random-Key Otimizers: Problem Independent Combinatorial Optimization (abstract)
12:00-13:00 Session 16A: Learning and Automated Design III
Location: Pithecusa
12:00
Machine Learning–Driven Objective Function Optimization Using Simulated Annealing (abstract)
12:20
Solving the Steiner Tree Problem in Graphs Using ReLU Chaotic Neural Network (abstract)
12:40
3DHybrid: A Transformer-Based Framework with Cross-Frame Interaction for Monocular Human Pose Estimation (abstract)
12:00-13:00 Session 16B: Metaheuristic Design II
Location: Primavera
12:00
Constructive heuristics for the Single Request Virtual Network Embedding Problem (abstract)
12:20
QonSAll: Quantum-Based Resolution of Optimization and Decision Problems via Relaxed Problem Optima (abstract)
12:40
Multi-Objective Basic Variable Neighborhood Search for model inference in software systems (abstract)