With the continuing growth of the Internet and network protocols, there is a need for Protocol Development Environments. Simulation environments like ns and OPNET require protocol code to be rewritten in a discrete event model. Direct Code Execution Environments (DCEE) solve the Verification and Validation problems by supporting the execution of unmodified protocol code in a controlled environment. Open Network Emulator (ONE) is a system supporting Direct Code Execution in a parallel environment - allowing unmodified protocol code to run on top of a parallel simulation layer, capable of simulating complex network topologies. Traditional approaches to the problem of Parallel Discrete Event Simulation (PDES) broadly fall into two categories. Conservative approaches allow processing of events only after it has been asserted that the event handling would not result in a causality error. Optimistic approaches allow for causality errors and support means of restoring state — i.e., rollback. All standard approaches to the problem of PDES are either flawed by their assumption of existing event patterns in the system or cannot be applied to ONE due to their restricted analysis on simplified models like queues and Petri-nets. The Adaptive Time Window algorithm is a bounded optimistic parallel simulation algorithm with the capability to change the degree of optimism with changes in the degree of causality in the network. The optimism at any instant is bounded by the amount of virtual time called the time window. The algorithm assumes efficient rollback capabilities supported by the â Weaves' framework. The algorithm is reactive and responds to changes in the degree of causality in the system by adjusting the length of its time window. With sufficient history gathered the algorithm adjusts to the increasing causality in the system with a small time window (conservative approach) and increases to a higher value (optimistic approach) during idle periods. The problem of splitting the entire simulation run into time windows of arbitrary length, whereby the total number of rollbacks in the system is minimal, is NP-complete. The Adaptive Time Window algorithm is compared against offline greedy approaches to the NP-complete problem called Oracle Computations. The total number of rollbacks in the system and the total execution time for the Adaptive Time Window algorithm were comparable to the ones for Oracle Computations. / Master of Science

Motivated by the management of sales representatives who visit customers to develop customer relationships, we present a stochastic orienteering problem on a network of queues, in which a hard time window is associated with each customer and the representative may experience uncertain wait time resulting from a queueing process at the customer. In general, given a list of potential customers and a time horizon consisting of several periods, the sales representative needs to decide which customers to visit in each period and how to visit customers within the period, with an objective to maximize the total reward collected by the end of the horizon. We start our study with a daily orienteering problem, which is a subproblem of the general problem. We focus on developing a priori and dynamic routing strategies for the salesperson to implement during a day. In the a priori routing case, the salesperson visits customers in a pre-planned order, and we seek to construct a static sequence of customers that maximizes the expected value collected. We consider two types of recourse actions. One is to skip a customer specified by an a priori route if the representative will arrive late in the customer's time window. The other type is to leave a customer immediately after arriving if observing a sufficiently long queue (balking) or to leave after waiting in queue for a period of time without meeting with the customer (reneging). We propose customer-specific decision rules to facilitate the execution of recourse actions and derive an analytical formula to compute the expected sales from the a priori route. We tailor a variable neighborhood search (VNS) heuristic to find a priori routes. In the dynamic routing case, the salesperson decides which customer to visit and how long to wait at each customer based on realized events. To seek dynamic routing policies, we propose an approximate dynamic programming approach based on rollout algorithms. The method introduces a two-stage heuristic estimation that we refer to as compound rollout. In the first stage, the algorithm decides whether to stay at the current customer or go to another customer. If departing the current customer, it chooses the customer to whom to go in the second stage. We demonstrate the value of our modeling and solution approaches by comparing the dynamic policies to a priori solutions with recourse actions. Finally, we address the multi-period orienteering problem. We consider that each customer's likelihood of adopting the representative's product stochastically evolves over time and is not fully observed by the representative. The representative can only estimate the adoption likelihood by meeting with the customer and the estimation may not be accurate. We model the problem as a partially observed Markov decision process with an objective to maximize the expected sales at the end of the horizon. We propose a heuristic that decomposes the problem into an assignment problem to schedule customers for a period and a routing problem to decide how to visit the scheduled customers within the period.

¡§Time¡¨ is fleeting. People tend to ponder the needs in the present and develop procrastination for the future. Because of these tendencies, researchers in marketing examine topics such as impulsive buying and purchase in advance. For companies, understanding how consumers perceive time differently is beneficial to their promotion strategy development. Previous research has investigated the impacts of temporal distance and time window. Based on these time perspectives, this research incorporates two moderators in influencing consumer behavior: mental simulation and product type. The study uses experimental design to explore the advertising effects and gift coupon redemption. With the manipulation of different time perspectives, two experiments are conducted. Experiment 1 is a 2 (temporal distance: near future vs. distant future) ¡Ñ 2 (mental simulation: process simulation vs. outcome simulation) ¡Ñ 2 (product type: search goods vs. experience goods) factorial design. Experiment 2 is a 2 (time window: short vs. long) ¡Ñ 2 (mental simulation: process simulation vs. outcome simulation) ¡Ñ 2 (product type: search goods vs. experience goods) factorial design. With the eight conditions, the participants¡¦ intention and behavior are assessed. Results indicate that when promoting a search good, outcome simulation presented in the ad is more effective to participants who see the near future than those who see the distant future. However, in the coupon redemption behavior, when redeeming an experience good, there will be interaction effect between time window and mental simulation. When redeeming an experience good under the long time window condition, outcome simulation gets higher redemption rate than process simulation. While under the short time window condition, process simulation enhances higher redemption rate than outcome simulation. The findings provide marketing insights regarding how to frame time and mental simulation differently in the promotions while product type is considered.

Introdução e objetivos: A extensão segura da janela terapêutica para o tratamento do acidente vascular cerebral isquêmico (AVCI) agudo com terapia trombolítica endovenosa (EV) é importante, porque mais pacientes podem ser beneficiados com este tratamento. O objetivo é comparar o benefício da trombólise <3 horas e entre 3 e 4,5 horas no mundo real. Métodos: Avaliamos prospectivamente pacientes com AVCI tratados com trombólise em Porto Alegre entre 2002 a 2011. Até 2008, apenas alguns pacientes selecionados foram tratados com mais de 3 horas. Após o estudo ECASS III, estendemos a janela terapêutica com os mesmos critérios para os pacientes tratados entre 3-4,5 h. Nós comparamos a evolução funcional em 3 meses, hemorragia intracerebral sintomática (HIS) e mortalidade do grupo tratado < 3h com o grupo tratado entre 3-4,5h. Resultados: Foram analisados 487 pacientes com AVCI agudo trombolisados. Neste período, 33% dos pacientes foram tratados entre 3 e 4,5 horas. Pacientes tratados mais precocemente eram mais graves: média de idade 68±14 vs. 65±13, P<0,03, escore do NIHSS 12±6 vs. 11±7, P<0,015, ASPECTS ≤ 7 18% vs. 8,5%, P=0,011, hipodensidade maior 1/3 ACM na tomografia (4% vs. 0,9%, P=0,05). Os resultados no grupo < 3 h comparado com o grupo entre 3-4,5h foram, respectivamente: boa evolução funcional 49% vs. 50%, P= 0,82, mortalidade 12% vs. 11%, P= 0,60 e a HIS 5,9% vs. 3,8%, P= 0,52. Após a extensão da janela terapêutica, houve um aumento de 3,8 vezes no número de pacientes trombolisados. Conclusões: Este estudo sugere que trombólise EV para pacientes com AVCI agudo entre 3-4,5h é segura e apresenta bons resultados funcionais, semelhante a pacientes tratados mais precocemente. Deve ser estimulado o tratamento o mais precoce possível, mas pacientes que chegam tardíamente ao hospital também podem receber o benefício do tratamento. / Background and aims: A safe extension of the therapeutic window for treating acute ischemic stroke (AIS) with intravenous thrombolysis is important because it would mean that more patients could receive the benefit of the treatment. Our goal was to compare the safety and functional outcome of thrombolysis between 3 and 4.5 h and ≤ 3 h in patients in the Real World. Methods: We prospectively evaluated a cohort of thrombolyzed patients treated between 2005 and 2011. Following the publication of the results from ECASS III, we extended the therapeutic window, using the same criteria, to patients treated between 3 and 4.5 h after AIS. We compared functional outcomes at 3 months, symptomatic intracranial hemorrhage (SIH) and mortality of the patients treated until 3 h vs. those treated at between 3 and 4.5 h. Results: We analyzed 487 thrombolyzed patients. During this period, 33% of patients were treated between 3 and 4.5 hours. The patients treated at earlier timepoints were more severely affected than the patients treated at later timepoints: mean ages were 68 vs. 65 (P<0.03), NIHSS scale scores were 12 vs. 11 (P<0.015), ASPECTS ≤ 7 were 18% vs. 8.5% (P =0.011) and hypodensity was observed in more than 1/3 of the middle cerebral artery in 4% vs. 0.9% (P=0.05), respectively. When comparing the group < 3 h vs. between 3 and 4.5h, the results showed favorable outcomes in 49% vs. 50% (P=0.82), mortality in 12% vs. 11% (P=0.60) and SIH in 5.9% vs. 3.8% (P=0.52), respectively. After extending the therapeutic window, the number of thrombolyzed patients increased 3.8-fold. Conclusions: This study suggests that intravenous thrombolysis is safe in AIS patients and that it causes favorable functional outcomes, similar to patients treated at earlier timepoints. Thrombolytic treatment should be initiated as soon as possible; however, patients who arrive late may receive treatment benefits.

Introdução e objetivos: A extensão segura da janela terapêutica para o tratamento do acidente vascular cerebral isquêmico (AVCI) agudo com terapia trombolítica endovenosa (EV) é importante, porque mais pacientes podem ser beneficiados com este tratamento. O objetivo é comparar o benefício da trombólise <3 horas e entre 3 e 4,5 horas no mundo real. Métodos: Avaliamos prospectivamente pacientes com AVCI tratados com trombólise em Porto Alegre entre 2002 a 2011. Até 2008, apenas alguns pacientes selecionados foram tratados com mais de 3 horas. Após o estudo ECASS III, estendemos a janela terapêutica com os mesmos critérios para os pacientes tratados entre 3-4,5 h. Nós comparamos a evolução funcional em 3 meses, hemorragia intracerebral sintomática (HIS) e mortalidade do grupo tratado < 3h com o grupo tratado entre 3-4,5h. Resultados: Foram analisados 487 pacientes com AVCI agudo trombolisados. Neste período, 33% dos pacientes foram tratados entre 3 e 4,5 horas. Pacientes tratados mais precocemente eram mais graves: média de idade 68±14 vs. 65±13, P<0,03, escore do NIHSS 12±6 vs. 11±7, P<0,015, ASPECTS ≤ 7 18% vs. 8,5%, P=0,011, hipodensidade maior 1/3 ACM na tomografia (4% vs. 0,9%, P=0,05). Os resultados no grupo < 3 h comparado com o grupo entre 3-4,5h foram, respectivamente: boa evolução funcional 49% vs. 50%, P= 0,82, mortalidade 12% vs. 11%, P= 0,60 e a HIS 5,9% vs. 3,8%, P= 0,52. Após a extensão da janela terapêutica, houve um aumento de 3,8 vezes no número de pacientes trombolisados. Conclusões: Este estudo sugere que trombólise EV para pacientes com AVCI agudo entre 3-4,5h é segura e apresenta bons resultados funcionais, semelhante a pacientes tratados mais precocemente. Deve ser estimulado o tratamento o mais precoce possível, mas pacientes que chegam tardíamente ao hospital também podem receber o benefício do tratamento. / Background and aims: A safe extension of the therapeutic window for treating acute ischemic stroke (AIS) with intravenous thrombolysis is important because it would mean that more patients could receive the benefit of the treatment. Our goal was to compare the safety and functional outcome of thrombolysis between 3 and 4.5 h and ≤ 3 h in patients in the Real World. Methods: We prospectively evaluated a cohort of thrombolyzed patients treated between 2005 and 2011. Following the publication of the results from ECASS III, we extended the therapeutic window, using the same criteria, to patients treated between 3 and 4.5 h after AIS. We compared functional outcomes at 3 months, symptomatic intracranial hemorrhage (SIH) and mortality of the patients treated until 3 h vs. those treated at between 3 and 4.5 h. Results: We analyzed 487 thrombolyzed patients. During this period, 33% of patients were treated between 3 and 4.5 hours. The patients treated at earlier timepoints were more severely affected than the patients treated at later timepoints: mean ages were 68 vs. 65 (P<0.03), NIHSS scale scores were 12 vs. 11 (P<0.015), ASPECTS ≤ 7 were 18% vs. 8.5% (P =0.011) and hypodensity was observed in more than 1/3 of the middle cerebral artery in 4% vs. 0.9% (P=0.05), respectively. When comparing the group < 3 h vs. between 3 and 4.5h, the results showed favorable outcomes in 49% vs. 50% (P=0.82), mortality in 12% vs. 11% (P=0.60) and SIH in 5.9% vs. 3.8% (P=0.52), respectively. After extending the therapeutic window, the number of thrombolyzed patients increased 3.8-fold. Conclusions: This study suggests that intravenous thrombolysis is safe in AIS patients and that it causes favorable functional outcomes, similar to patients treated at earlier timepoints. Thrombolytic treatment should be initiated as soon as possible; however, patients who arrive late may receive treatment benefits.

Introdução e objetivos: A extensão segura da janela terapêutica para o tratamento do acidente vascular cerebral isquêmico (AVCI) agudo com terapia trombolítica endovenosa (EV) é importante, porque mais pacientes podem ser beneficiados com este tratamento. O objetivo é comparar o benefício da trombólise <3 horas e entre 3 e 4,5 horas no mundo real. Métodos: Avaliamos prospectivamente pacientes com AVCI tratados com trombólise em Porto Alegre entre 2002 a 2011. Até 2008, apenas alguns pacientes selecionados foram tratados com mais de 3 horas. Após o estudo ECASS III, estendemos a janela terapêutica com os mesmos critérios para os pacientes tratados entre 3-4,5 h. Nós comparamos a evolução funcional em 3 meses, hemorragia intracerebral sintomática (HIS) e mortalidade do grupo tratado < 3h com o grupo tratado entre 3-4,5h. Resultados: Foram analisados 487 pacientes com AVCI agudo trombolisados. Neste período, 33% dos pacientes foram tratados entre 3 e 4,5 horas. Pacientes tratados mais precocemente eram mais graves: média de idade 68±14 vs. 65±13, P<0,03, escore do NIHSS 12±6 vs. 11±7, P<0,015, ASPECTS ≤ 7 18% vs. 8,5%, P=0,011, hipodensidade maior 1/3 ACM na tomografia (4% vs. 0,9%, P=0,05). Os resultados no grupo < 3 h comparado com o grupo entre 3-4,5h foram, respectivamente: boa evolução funcional 49% vs. 50%, P= 0,82, mortalidade 12% vs. 11%, P= 0,60 e a HIS 5,9% vs. 3,8%, P= 0,52. Após a extensão da janela terapêutica, houve um aumento de 3,8 vezes no número de pacientes trombolisados. Conclusões: Este estudo sugere que trombólise EV para pacientes com AVCI agudo entre 3-4,5h é segura e apresenta bons resultados funcionais, semelhante a pacientes tratados mais precocemente. Deve ser estimulado o tratamento o mais precoce possível, mas pacientes que chegam tardíamente ao hospital também podem receber o benefício do tratamento. / Background and aims: A safe extension of the therapeutic window for treating acute ischemic stroke (AIS) with intravenous thrombolysis is important because it would mean that more patients could receive the benefit of the treatment. Our goal was to compare the safety and functional outcome of thrombolysis between 3 and 4.5 h and ≤ 3 h in patients in the Real World. Methods: We prospectively evaluated a cohort of thrombolyzed patients treated between 2005 and 2011. Following the publication of the results from ECASS III, we extended the therapeutic window, using the same criteria, to patients treated between 3 and 4.5 h after AIS. We compared functional outcomes at 3 months, symptomatic intracranial hemorrhage (SIH) and mortality of the patients treated until 3 h vs. those treated at between 3 and 4.5 h. Results: We analyzed 487 thrombolyzed patients. During this period, 33% of patients were treated between 3 and 4.5 hours. The patients treated at earlier timepoints were more severely affected than the patients treated at later timepoints: mean ages were 68 vs. 65 (P<0.03), NIHSS scale scores were 12 vs. 11 (P<0.015), ASPECTS ≤ 7 were 18% vs. 8.5% (P =0.011) and hypodensity was observed in more than 1/3 of the middle cerebral artery in 4% vs. 0.9% (P=0.05), respectively. When comparing the group < 3 h vs. between 3 and 4.5h, the results showed favorable outcomes in 49% vs. 50% (P=0.82), mortality in 12% vs. 11% (P=0.60) and SIH in 5.9% vs. 3.8% (P=0.52), respectively. After extending the therapeutic window, the number of thrombolyzed patients increased 3.8-fold. Conclusions: This study suggests that intravenous thrombolysis is safe in AIS patients and that it causes favorable functional outcomes, similar to patients treated at earlier timepoints. Thrombolytic treatment should be initiated as soon as possible; however, patients who arrive late may receive treatment benefits.

[pt] Nesta tese são propostos diversos algoritmos para resolver as versões estática e dinâmica de roteirização de veículos com janelas de tempo. Estes problemas têm como objetivo determinar rotas de custo mínimo para uma frota homogênea, atendendo a demanda de um conjunto de clientes dentro de intervalos de tempo determinados, chamados de janelas de tempos. Além disto, na versão dinâmica no problema, novos clientes podem ser atendidos durante a execução das rotas pelos veículos. Para a versão estática do problema propôs-se um algoritmo híbrido utilizando otimização por colônias de formigas e o método de descida em vizinhança variável aleatória. Os resultados computacionais mostram que o algoritmo foi capaz de encontrar soluções muito boas ou mesmo as melhores soluções conhecidas de instâncias usadas como benchmarking na literatura. Para a versão dinâmica do problema foram propostos seis algoritmos, baseados em métodos de inserção, de otimização por colônia de formigas e das versões sequencial e aleatória do método de busca em vizinhança variável. Os resultados computacionais mostram que a maior parte dos algoritmos propostos é competitiva com os algoritmos propostos na literatura, pois produzem soluções de boa qualidade e com esforço computacional reduzido. / [en] This thesis proposes several algorithms to solve the vehicle routing with time windows static and dynamic versions. These problems involve determining minimum cost routes for a homogeneous fleet in order to meet the demand of a set of customers within specified time intervals popularly called time windows. In addition, in the dynamic version of the problem, new customers can be assigned to vehicles during the execution of the routes. For the static version it was proposed a hybrid algorithm using ant colony optimization and the random variable neighborhood search method. The computational results show that the algorithm was able to find very good or even the best known solutions to benchmark instances. For the dynamic version it was proposed six algorithms, based on an insertion procedure, ant colony optimization and random and sequential versions of variable neighborhood search methods. Computational results show that most of the proposed algorithms are competitive regarding the state of the art, providing solutions of good quality with low computational effort.

Fornecedores necessitam atender a demanda de seus clientes da forma mais adequada possível e mantendo a qualidade de seu serviço, porém em muitos casos essa demanda é desconhecida. Esse problema pode ser modelado como um problema de roteirização e estoque com demanda estocástica o qual inclui o controle de estoque, transporte do produto e decisões de agendamento da entrega. Existem vários trabalhos na literatura para resolver esse problema, porém nenhum deles lida com janela de tempo de atendimento, capacidade máxima de estoque tanto no cliente quanto no depósito e o nível de confiança de atendimento individualizado para cada cliente. O objetivo principal deste trabalho é propor um novo algoritmo baseado em otimização matemática para lidar com esse problema mais realista. Além disso, este trabalho tem como objetivo secundário melhorar o algoritmo de estado da arte baseado em otimização matemática, visando encontrar soluções com um menor tempo computacional e custo. Foram realizados experimentos com instâncias sintéticas com 15 até 50 clientes, as quais são geradas aleatoriamente, e com uma instância real, baseada na experiência profissional no mercado empresarial e em cenários reais de distribuição na cidade de São Paulo / Providers need to supply the demand of their clients as optimally as possible and maintaining the quality of their service, however in many cases this demand is unknown. This problem can be modeled as a inventory routing problem with stochastic demand, which includes inventory control, product transportation and delivery scheduling decisions. There are several papers in the literature to solve this problem, but none of them deals with service time window, maximum stock capacity for both the customer and the depot and individualized confidence level for each costumer. The main objective of this work is to propose a new algorithm based on mathematical optimization to deal with this more realistic problem. In addition, this work has as secondary objective to improve the state of the art algorithm based on mathematical optimization, aiming to find solutions with a lower computational time and cost. Experiments were performed with synthetic instances with 15 to 50 clients, which are randomly generated, and with a real instance, based on professional experience in the business market and in real distribution scenarios in the city of São Paulo

Fornecedores necessitam atender a demanda de seus clientes da forma mais adequada possível e mantendo a qualidade de seu serviço, porém em muitos casos essa demanda é desconhecida. Esse problema pode ser modelado como um problema de roteirização e estoque com demanda estocástica o qual inclui o controle de estoque, transporte do produto e decisões de agendamento da entrega. Existem vários trabalhos na literatura para resolver esse problema, porém nenhum deles lida com janela de tempo de atendimento, capacidade máxima de estoque tanto no cliente quanto no depósito e o nível de confiança de atendimento individualizado para cada cliente. O objetivo principal deste trabalho é propor um novo algoritmo baseado em otimização matemática para lidar com esse problema mais realista. Além disso, este trabalho tem como objetivo secundário melhorar o algoritmo de estado da arte baseado em otimização matemática, visando encontrar soluções com um menor tempo computacional e custo. Foram realizados experimentos com instâncias sintéticas com 15 até 50 clientes, as quais são geradas aleatoriamente, e com uma instância real, baseada na experiência profissional no mercado empresarial e em cenários reais de distribuição na cidade de São Paulo / Providers need to supply the demand of their clients as optimally as possible and maintaining the quality of their service, however in many cases this demand is unknown. This problem can be modeled as a inventory routing problem with stochastic demand, which includes inventory control, product transportation and delivery scheduling decisions. There are several papers in the literature to solve this problem, but none of them deals with service time window, maximum stock capacity for both the customer and the depot and individualized confidence level for each costumer. The main objective of this work is to propose a new algorithm based on mathematical optimization to deal with this more realistic problem. In addition, this work has as secondary objective to improve the state of the art algorithm based on mathematical optimization, aiming to find solutions with a lower computational time and cost. Experiments were performed with synthetic instances with 15 to 50 clients, which are randomly generated, and with a real instance, based on professional experience in the business market and in real distribution scenarios in the city of São Paulo

Submitted by Maykon Nascimento (maykon.albani@hotmail.com) on 2015-10-19T19:19:50Z No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Modelo matematico e meta heuristica simulated annealing para elaboração de roteiros turísticos com base no tourist trip design problem.pdf: 2271247 bytes, checksum: faaad9e85f6978197ce7c7b03933a2ca (MD5) / Approved for entry into archive by Elizabete Silva (elizabete.silva@ufes.br) on 2015-11-03T19:59:38Z (GMT) No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Modelo matematico e meta heuristica simulated annealing para elaboração de roteiros turísticos com base no tourist trip design problem.pdf: 2271247 bytes, checksum: faaad9e85f6978197ce7c7b03933a2ca (MD5) / Made available in DSpace on 2015-11-03T19:59:38Z (GMT). No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Modelo matematico e meta heuristica simulated annealing para elaboração de roteiros turísticos com base no tourist trip design problem.pdf: 2271247 bytes, checksum: faaad9e85f6978197ce7c7b03933a2ca (MD5) Previous issue date: 2015 / O turismo é um importante setor para economia mundial e vem crescendo consistentemente nos últimos anos. Porém, um fator determinante para escolha do destino de um turista é a existência de pontos de interesse que ele deseja visitar na região e, para tanto, as informações dos pontos de interesse de uma região devem estar disponíveis. Dada às limitações de tempo do turista, não é possível para ele visitar todos os atrativos e, por essa razão, se faz necessário a criação de roteiros turísticos. Muito embora existam diversos pacotes de viagens com destinos predefinidos, contemplando locais mais populares, nos últimos anos tem crescido a procura por soluções que criem roteiros personalizados voltados às necessidades de cada turista. Para suprir essa nova demanda, Van Oudheusden e Vansteenwegen (2007) propuseram o Tourist Trip Design Problem (TTDP) e sugeriram o uso do Orienteering Problem (OP) e suas extensões para resolução do TTDP. Esta dissertação tem por objetivo o desenvolvimento de um modelo matemático e de uma meta-heurística Simulated Annealing (SA) para resolução do TTDP. O objetivo considerado consiste em gerar roteiros que maximizem a soma das notas atribuídas aos atrativos em função do grau de interesse do turista, levando em conta o período que ele tem disponível na localidade e o horário que cada atrativo está disponível para ser visitado. / Tourism is an important sector for the world economy and has been growing steadily over recent years. However, a decisive factor for the choice of a tourist destination is the existence of points of interest in the region he wants to visit and, therefore, the information from points of interest in a region should be available. Given the tourist time constraints, it is not possible for him to visit all the attractions and, therefore, it is necessary the creation of tourist routes. Although there are several packages with predefined destinations contemplating most popular locations in recent years has increased the demand for solutions that create custom tours for the needs of each tourist. To meet this new demand Van Oudheusden and Vansteenwegen (2007) proposed the Tourist Trip Design Problem (TTDP) and they suggested that the use of the Orienteering Problem (OP) and its extensions is the best approach to the TTDP. This thesis proposes the development of a mathematical model and a Simulated Annealing (SA) metaheuristic to solve the TTDP. The objective considered is to generate routes that maximize the sum of scores awarded to the attractions based on the degree of interest of the tourist taking into account the time that he has in the locality and the time that each attraction is available to be visited.