Asynchronous teams for solving the loading and routing auto-carrier problem

Detalhes bibliográficos
Ano de defesa: 2016
Autor(a) principal: Parolin, Erick Skorupa
Orientador(a): Meneses, Cláudio Nogueira de
Banca de defesa: Não Informado pela instituição
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: eng
Instituição de defesa: Universidade Federal do ABC
Programa de Pós-Graduação: Programa de Pós-Graduação em Ciência da Computação
Departamento: Não Informado pela instituição
País: Não Informado pela instituição
Link de acesso: http://biblioteca.ufabc.edu.br/index.php?codigo_sophia=102507&midiaext=72697
http://biblioteca.ufabc.edu.br/index.php?codigo_sophia=102507&midiaext=72697/index.php?codigo_sophia=102507&midiaext=72696
Resumo: Beyond a complex real world system composed by a set of sophisticated machines and qualied human resources distributed around manufacturing environment, the Auto In- dustry needs a little more to allow their products to reach the nal costumers. Loading vehicles like cars, trucks and vans into auto-carriers and designing routes to delivery sub- sets of vehicles to auto dealers according to their orders are relevant tasks in automotive value chain performed by transportation companies. Given the set of complex constraints related to diferent vehicle models (with diferent dimensions) to be feasibly loaded into dierent auto-carrier models plus the auto-carrier eet routing task, transportation com- panies must explore strong computational alternatives to address this optimization prob- lem. In fact, we explore in this dissertation a real world complex problem composed by two sub-problems, both belonging to NP-hard class: routing and loading. After formally dening the tackled problem, we adopt, in this dissertation, a previously studied procedure based on enumeration techniques for loading task and we propose an alternative approach employing Asynchronous Teams concept, which combines local search algorithms in order to cooperate to each other to try to resolve the routing sub-problem. Setting the results provided by our implementation of Iterated Local Search (ILS) approach (already proposed in literature for solving the routing sub-problem) as benchmark, we propose computational experiments considering real-world instances, to compare performance of ILS to ve vari- ants of our Asynchronous Teams implementations. Final results evidence the power of this proposed alternative approach for founding quality solutions and its exibility to easily assume diferent configurations.