Please use this identifier to cite or link to this item:
Title: Metaheuristic algorithms for solving the multi-depot arc routing problem
Author: Page Carro, Patricio
Director: Armas Adrián, Jésica de
Tutor: Juan Pérez, Ángel Alejandro
Others: Universitat Oberta de Catalunya
Keywords: arc routing problem
randomized algorithms
Issue Date: 18-Jun-2017
Publisher: Universitat Oberta de Catalunya
Abstract: The main objective of the present work is to elaborate the most effective algorithm for solving the Multi-Depot Arc Routing Problem (MDARP), taking the Randomized Sharp as base algorithm and starting point, and particularly to study different alternatives for developing the edge-to-depot assignment. Concrete applications of this problem are garbage collection, electricity meter reading, mail distribution and door-to-door selling. To accomplish this several edge-to-depot allocation strategies in conjunction with variations on the Randomized Sharp algorithm were implemented in the Java language and tested against one another and using the existing benchmarks for this problem.
Language: English
Appears in Collections:Bachelor thesis, research projects, etc.

Files in This Item:
File Description SizeFormat 
180617_TFM_IngCompMat_PPAGE.doc2.18 MBMicrosoft WordView/Open
ppageTFG06617memory.pdf1.37 MBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.