Automated guided vehicles (AGVs) form a large and important part of the logistic transport
systems in today's industry. They are used on a large scale, especially in Europe, for over a …

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the
goal of automating the design of heuristic methods to solve hard computational search …

This paper introduces a new and very simple search methodology called Late Acceptance
Hill-Climbing (LAHC). It is a local search algorithm, which accepts non-improving moves …

This paper addresses an extension of the flexible job shop scheduling problem by
considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this …

We propose a survey of the research contributions on the field of Educational Timetabling
with a specific focus on “standard” formulations and the corresponding benchmark …

The urban transit routing problem (UTRP) focuses on finding efficient travelling routes for
vehicles in a public transportation system. It is one of the most significant problems faced by …

This work addresses the Vehicle Routing Problem with Cross-Docking (VRPCD). The
problem consists in defining a minimum cost set of routes for a fleet of vehicles that meets …

Grouping problems are combinatorial optimization problems, most of them NP-hard, related
to the partition of a set of items into different groups or clusters. Given their numerous real …

Abstract We propose a Simulated Annealing approach for the Examination Timetabling
problem, in the classical uncapacitated formulation of Carter et al.(1996). Our solver is …

Adaptive large neighborhood search (ALNS) is a useful framework for solving difficult
combinatorial optimisation problems. As a metaheuristic, it consists of some components …