Skip to main content

Research Repository

Advanced Search

All Outputs (24)

EUSC: A clustering-based surrogate model to accelerate evolutionary undersampling in imbalanced classification (2020)
Journal Article

© 2020 Learning from imbalanced datasets is highly demanded in real-world applications and a challenge for standard classifiers that tend to be biased towards the classes with the majority of the examples. Undersampling approaches reduce the size of... Read More about EUSC: A clustering-based surrogate model to accelerate evolutionary undersampling in imbalanced classification.

Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows (2018)
Journal Article

© 2018, The Author(s). An effective and fast hybrid metaheuristic is proposed for solving the pickup and delivery problem with time windows. The proposed approach combines local search, large neighbourhood search and guided ejection search in a novel... Read More about Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows.

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm (2017)
Journal Article

The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristi... Read More about Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm.

A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems (2017)
Journal Article

Understanding the relationships between objectives in a multiobjective optimisation problem is important for developing tailored and efficient solving techniques. In particular, when tackling combinatorial optimisation problems with many objectives t... Read More about A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems.

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems (2013)
Journal Article

This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many ap... Read More about Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems.