Return to search

Algoritmos meta-heur?sticos para a solu??o do problema do caixeiro viajante com m?ltiplas caronas / Metaheuristic algorithms for the solution of the traveling salesman with multiple ridesharing

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-08-16T20:15:31Z
No. of bitstreams: 1
GuilhermeFernandesDeAraujo_DISSERT.pdf: 1848505 bytes, checksum: eaa10d2add37ab0c93d005b148c492ee (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2016-08-17T22:17:58Z (GMT) No. of bitstreams: 1
GuilhermeFernandesDeAraujo_DISSERT.pdf: 1848505 bytes, checksum: eaa10d2add37ab0c93d005b148c492ee (MD5) / Made available in DSpace on 2016-08-17T22:17:58Z (GMT). No. of bitstreams: 1
GuilhermeFernandesDeAraujo_DISSERT.pdf: 1848505 bytes, checksum: eaa10d2add37ab0c93d005b148c492ee (MD5)
Previous issue date: 2016-02-12 / O Problema do Caixeiro Viajante com Caronas M?ltiplas (PCV-MCa) ? uma classe do Caixeiro Viajante Capacitado que apresenta a possibilidade de compartilhamento de assentos para passageiros aproveitando os deslocamentos do caixeiro entre as localidades do ciclo. O caixeiro divide o custo do trajeto com os passageiros embarcados. O modelo pode representar uma situa??o real em que, por exemplo, motoristas est?o dispostos a compartilhas trechos de sua viagem com turistas que pretendem se deslocar entre duas localidades visitadas pela rota do motorista, aceitando compartilhar o ve?culo com outros indiv?duos e visitando outras localidades do ciclo. / The Traveling Salesman with Multiple Ridesharing (TSP-MR) is a type of the Capacitated Traveling Salesman, which presents the possibility of sharing seats with passengers taking advantage of the paths the salesman travels through his cycle. The salesman shares the cost of a path with the boarded passengers. This model can portray a real situation in which, for example, drivers are willing to share parts of a trip with tourists that wish to move between two locations visited by the driver?s route, accepting to share the vehicle with other individuals visiting other locations within the cycle. This work proposes a mathematical formulation for the problem, and an exact and metaheuristics algorithms for its solution, comparing them.

Identiferoai:union.ndltd.org:IBICT/oai:repositorio.ufrn.br:123456789/21166
Date12 February 2016
CreatorsAra?jo, Guilherme Fernandes de
Contributors25841025953, http://lattes.cnpq.br/1371199678541174, Gouvea, Elizabeth Ferreira, 81652011749, http://lattes.cnpq.br/2888641121265608, Maia, Silvia Maria Diniz Monteiro, 01397968435, http://lattes.cnpq.br/1498104590221901, Cabral, Luc?dio dos Anjos Formiga, 37383388372, http://lattes.cnpq.br/6699185881827288, Goldbarg, Marco Cesar
PublisherUniversidade Federal do Rio Grande do Norte, PROGRAMA DE P?S-GRADUA??O EM SISTEMAS E COMPUTA??O, UFRN, Brasil
Source SetsIBICT Brazilian ETDs
LanguagePortuguese
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/publishedVersion, info:eu-repo/semantics/masterThesis
Sourcereponame:Repositório Institucional da UFRN, instname:Universidade Federal do Rio Grande do Norte, instacron:UFRN
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0021 seconds