Banca de DEFESA: IGOR EDUARDO SANTOS DE MELO

Uma banca de DEFESA de MESTRADO foi cadastrada pelo programa.
STUDENT : IGOR EDUARDO SANTOS DE MELO
DATE: 24/02/2022
TIME: 16:00
LOCAL: Online
TITLE:
KEY WORDS:

Multi-Period School Bus Routing Problem. Bus Stop Selection. Route Generation.
Heuristic Algorithm

PAGES: 116
BIG AREA: Engenharias
AREA: Engenharia de Produção
SUMMARY:

This dissertation addresses an extension to the School Bus Routing Problem (SBRP), which
includes the subproblems of locating bus stops, students allocating to selected bus stops and
routing of buses involving multiple periods (e.g., days) and a single school, introduced in the
literature by Melo e Kramer (2021). The objective is to minimize the total distance traveled by
the fleet in the set of periods, taking into account vehicle capacity constraint and the maximum
distance which students can walk to the stops. In the context of Multi-Period School Bus
Routing Problem (MP-SBRP), students who have transport demands to (or from) a school
in a subset of periods must be allocated to the same stop in the periods in which they have
demands. First, a mathematical model for the problem is presented, and then an algorithm based
on the metaheuristics Iterated Local Search (ILS) and Variable Neighborhood Descent (VND) is
proposed, as well as heuristics for insertion and removal of stops considering multiple periods,
called Iterated Local Search with Randomized Variable Neighborhood Descent and Remove
(ILS-RVND-R). The proposed algorithm was carried out on 95 instances of SBRP, proposed by
Schittekat et al. (2013), and for 192 instances of MP-SBRP obtained by extending the instances
of Schittekat et al. (2013), showing capable of obtaining a favorable performance and with a low
computational effort for both problems.

BANKING MEMBERS:
Externo à Instituição - ANAND SUBRAMANIAN
Interna - 2732514 - ISIS DIDIER LINS
Presidente - 1078937 - RAPHAEL HARRY FREDERICO RIBEIRO KRAMER