Solving Various Classes of Arc Routing Problems with a Memetic Algorithm-based Framework

Arc routing problems are combinatorial optimization problems that have many real-world applications, such as mail delivery, snow plowing, and waste collection. Various variants of this problem are available, as well as algorithms intended to solve them heuristically or exactly. Presented here is a generic algorithmic framework that can be applied to a variety of arc … Read more

Metaheuristic, Models and Software for the Heterogeneous Fleet Pickup and Delivery Problem with Split Loads

This paper addresses a rich variant of the vehicle routing problem (VRP) that involves pickup and delivery activities, customer time windows, heterogeneous fleet, multiple products and the possibility of splitting a customer demand among several routes. This variant generalizes traditional VRP variants by incorporating features that are commonly found in practice. We present two mixed-integer … Read more

A support tool for planning classrooms considering social distancing between students

In this paper, we present the online tool developed to assist the layout planning of classrooms considering the social distance in the context of the COVID-19 pandemic. We address both the allocation problem in rooms where seats are fixed as well as the problem in rooms where seats can be moved freely. For the … Read more