| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 3.42 MB | Adobe PDF |
Advisor(s)
Abstract(s)
Este projeto foi desenvolvido em contexto teórico com o intuito de criar uma
ferramenta de apoio à decisão na alocação de cacifos para entrega de encomendas
com o objetivo de otimizar a utilização de recursos das empresas que prestam estes
serviços.
Neste projeto foi desenvolvido um algoritmo linear inteiro em junção com heurística
de modo a resolver um problema de alocação de cacifos modulares. Estas torres de
cacifos podem ter várias configurações pois permitem a integração de cacifos de 3
tamanhos diferentes. O objetivo é criar uma ferramenta que em função de uma
determinada procura, retorne o número de torres de no máximo 3 configurações que
nos melhor ajudarão a diminuir a rotura com o menor número de torres possível. Após
a criação deste algoritmo 3 iterações do problema foram estudadas, a primeira onde o
modelo tinha como objetivo responder á média da procura, o segundo onde o objetivo
era responder ao dia em que mais espaço era necessário e o terceiro onde o objetivo
era responder a 95% da procura gerada pela função que a gerou. Os resultados foram
estudados e comentados
This project was developed in a theoretical context in order to create a decision support tool in the allocation of lockers for parcel delivery with the objective of optimizing the use of resources of the companies that provide these services. In this project, an integer linear algorithm was developed in conjunction with heuristics in order to solve a modular locker allocation problem. The locker-towers can have several configurations as they allow the integration all of lockers of 3 different sizes. The objective is to create a tool that, depending on a specific demand, returns the number of towers of a maximum of 3 configurations that will best help us to reduce the breakage with the least number of towers possible. After the creation of this algorithm, 3 iterations of the problem were studied, the first where the model aimed to respond to the average demand, the second where the objective was to respond to the day when more space was needed and the third where the objective was to respond to 95% of the demand generated by the function that generated it. The results were studied and commented
This project was developed in a theoretical context in order to create a decision support tool in the allocation of lockers for parcel delivery with the objective of optimizing the use of resources of the companies that provide these services. In this project, an integer linear algorithm was developed in conjunction with heuristics in order to solve a modular locker allocation problem. The locker-towers can have several configurations as they allow the integration all of lockers of 3 different sizes. The objective is to create a tool that, depending on a specific demand, returns the number of towers of a maximum of 3 configurations that will best help us to reduce the breakage with the least number of towers possible. After the creation of this algorithm, 3 iterations of the problem were studied, the first where the model aimed to respond to the average demand, the second where the objective was to respond to the day when more space was needed and the third where the objective was to respond to 95% of the demand generated by the function that generated it. The results were studied and commented
Description
Keywords
Ferramenta de apoio á decisão Otimizar Ocupação Cacifos Decision support tool Optimizing Occupancy Lockers