Publicação
A public transport bus assignment problem: parallel metaheuristics assessment
| datacite.subject.fos | Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática | pt_PT |
| dc.contributor.advisor | Barahona, Pedro | |
| dc.contributor.advisor | Medeiros, Pedro | |
| dc.contributor.author | Semedo, David Fernandes | |
| dc.date.accessioned | 2016-01-06T11:52:13Z | |
| dc.date.available | 2016-01-06T11:52:13Z | |
| dc.date.issued | 2015-09 | |
| dc.date.submitted | 2016-01 | |
| dc.description.abstract | Combinatorial Optimization Problems occur in a wide variety of contexts and generally are NP-hard problems. At a corporate level solving this problems is of great importance since they contribute to the optimization of operational costs. In this thesis we propose to solve the Public Transport Bus Assignment problem considering an heterogeneous fleet and line exchanges, a variant of the Multi-Depot Vehicle Scheduling Problem in which additional constraints are enforced to model a real life scenario. The number of constraints involved and the large number of variables makes impracticable solving to optimality using complete search techniques. Therefore, we explore metaheuristics, that sacrifice optimality to produce solutions in feasible time. More concretely, we focus on the development of algorithms based on a sophisticated metaheuristic, Ant-Colony Optimization (ACO), which is based on a stochastic learning mechanism. For complex problems with a considerable number of constraints, sophisticated metaheuristics may fail to produce quality solutions in a reasonable amount of time. Thus, we developed parallel shared-memory (SM) synchronous ACO algorithms, however, synchronism originates the straggler problem. Therefore, we proposed three SM asynchronous algorithms that break the original algorithm semantics and differ on the degree of concurrency allowed while manipulating the learned information. Our results show that our sequential ACO algorithms produced better solutions than a Restarts metaheuristic, the ACO algorithms were able to learn and better solutions were achieved by increasing the amount of cooperation (number of search agents). Regarding parallel algorithms, our asynchronous ACO algorithms outperformed synchronous ones in terms of speedup and solution quality, achieving speedups of 17.6x. The cooperation scheme imposed by asynchronism also achieved a better learning rate than the original one. | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10362/16173 | |
| dc.language.iso | eng | pt_PT |
| dc.relation | COMPETE - POFC with reference 34091 | pt_PT |
| dc.subject | Metaheuristics | pt_PT |
| dc.subject | Parallelism | pt_PT |
| dc.subject | Vehicle Scheduling Problem | pt_PT |
| dc.subject | Ant-colony optimization | pt_PT |
| dc.subject | Local search | pt_PT |
| dc.subject | Asynchronism | pt_PT |
| dc.title | A public transport bus assignment problem: parallel metaheuristics assessment | pt_PT |
| dc.type | master thesis | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | masterThesis | pt_PT |
| thesis.degree.name | Mestrado em Engenharia Informática | pt_PT |