Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:50Z
No. of bitstreams: 1
JeanGleisonDeSantanaSilva_DISSERT.pdf: 1141115 bytes, checksum: 891de7a8a9407e8af54f241f1a174785 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T22:09:47Z (GMT) No. of bitstreams: 1
JeanGleisonDeSantanaSilva_DISSERT.pdf: 1141115 bytes, checksum: 891de7a8a9407e8af54f241f1a174785 (MD5) / Made available in DSpace on 2017-11-07T22:09:47Z (GMT). No. of bitstreams: 1
JeanGleisonDeSantanaSilva_DISSERT.pdf: 1141115 bytes, checksum: 891de7a8a9407e8af54f241f1a174785 (MD5)
Previous issue date: 2017-07-31 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior (CAPES) / O Problema do Caixeiro Viajante com Passageiros e Quota pertence ? classe de Problemas
do Caixeiro Viajante com Quota. Neste problema, considera-se uma vantagem econ?mica
quando o caixeiro, viajando em um ve?culo privado, embarca passageiros que passam a
dividir as despesas da viagem com ele. O modelo pode representar situa??es reais onde
o motorista tem uma rota de visita de cidade predefinida, na qual a cada cidade est?
associado um b?nus, sendo demandada a coleta de um valor m?nimo desses b?nus, na
fun??o objetivo da variante investigada leva-se em conta a possibilidade da redu??o dos
custos do caixeiro embarcando pessoas em seu ve?culo. Um modelo matem?tico, seis
algoritmos evolucion?rios, um GRASP e um heur?stico s?o apresentados para o problema.
O comportamento dos algoritmos propostos ? analisado em um experimento computacional
com 48 inst?ncias. / The Traveling Salesman Problem with Ridesharing and Quota belongs to the class of Quota
Traveling Salesman problems. In this problem, it is considered the economic advantage
achieved when the salesman, traveling in a private vehicle, gives ride to passengers who
share travel expenses with him. The model can represent real situations where a driver
programs a route to visit cities, each of which associated with a bonus, with the requirement
of collecting a minimum sum of bonuses and taking into account the possibility of reducing
costs due to people embarked in his vehicle. A math model, six evolutionary algorithms, a
GRASP and one heuristic are presented for the problem addressed. The behavior of the
proposed algorithms is analyzed on a computational experiment with 48 instances.
| Identifer | oai:union.ndltd.org:IBICT/oai:repositorio.ufrn.br:123456789/24207 |
| Date | 31 July 2017 |
| Creators | Silva, Jean Gleison de Santana |
| Contributors | 25841025953, Gouvea, Elizabeth Ferreira, 81652011749, Maia, Silvia Maria Diniz Monteiro, 01397968435, Menezes, Matheus da Silva, 03329300418, Goldbarg, Marco Cesar |
| Publisher | PROGRAMA DE P?S-GRADUA??O EM SISTEMAS E COMPUTA??O, UFRN, Brasil |
| Source Sets | IBICT Brazilian ETDs |
| Language | Portuguese |
| Detected Language | Portuguese |
| Type | info:eu-repo/semantics/publishedVersion, info:eu-repo/semantics/masterThesis |
| Source | reponame:Repositório Institucional da UFRN, instname:Universidade Federal do Rio Grande do Norte, instacron:UFRN |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0019 seconds