Spelling suggestions: "subject:"traveling salesman"" "subject:"raveling salesman""
81 |
A constraint programming approach for the time dependent traveling salesman problem / Une approche de programmation par contraintes du problème du voyageur de commerce dépendant du tempsMelgarejo, Penélope Aguiar 16 December 2016 (has links)
L'optimisation des tournées de livraison est souvent modélisée par un problème de voyageur de commerce (Traveling Salesman Problem / TSP). Pour ce problème, il est fréquent d’avoir des contraintes additionnelles telles que, par exemple, des fenêtres horaires limitant les heures de livraison chez le client ou des pauses obligatoires pour les conducteurs des camions. Le temps est une dimension importante à prendre en compte pour respecter ces contraintes. Cependant, les durées des trajets ne sont généralement pas constantes mais varient en fonction des congestions, et cette variabilité doit être intégrée au moment de l’optimisation des tournées. Ainsi, le problème du voyageur de commerce dépendant du temps (Time Dependent TSP / TD-TSP) est la version étendue du TSP où le coût d'un arc dépend de l'heure à laquelle cet arc est emprunté. Dans cet thèse nous proposons un nouveau benchmark pour le TD-TSP basé sur des données réelles de trafic (fournies par la Métropole de Lyon) et nous montrons l'intérêt de prendre en compte la variabilité des durées dans ce problème. Nous étudions comment mieux modéliser les fonctions de durée de trajet dépendantes du temps. Nous introduisons et comparons différents modèles pour résoudre le TD-TSP avec la programmation par contraintes (Constraint Programming / CP). Un premier modèle est directement dérivé du modèle CP classique pour le TSP. Nous montrons que ce modèle ne permet pas de raisonner avec des relations de précédence indirectes, ce qui pénalise sa performance sur notre benchmark. Nous introduisons une nouvelle contrainte globale qui est capable d'exploiter des relations de précédence indirectes sur des données dépendantes du temps et nous introduisons un nouveau modèle CP basé sur notre nouvelle contrainte. Nous comparons expérimentalement les deux modèles sur notre benchmark, et nous montrons que notre nouvelle contrainte permet de résoudre le TD-TSP plus efficacement. / In the context of urban deliveries, the optimization of delivery tours is usually modeled as a Traveling Salesman Problem (TSP). Side constraints like time-windows constraining the delivery times at the client or breaks for the drivers are also common in this kind of problem and time is an important dimension to take into account to respect these constraints. With travel times' variability in big cities time also tends to have a greater influence in costs and therefore it should be included in the optimization of delivery routes. The Time-Dependent Traveling Salesman Problem (TDTSP) is the extended version of the Traveling Salesman Problem (TSP) where arc costs depend on the time when the arc is traveled. In this thesis we propose a set of benchmarks for the TDTSP based on real traffic data (obtained from the city of Lyon) and show the interest of handling time dependency in the problem. A study of how to better model time-dependent travel functions in general and specifically for our approach is performed. We introduce and compare different models to solve the TDTSP with Constraint Programming (CP). A first model is derived in a straightforward way from the classical CP model for the TSP. We show that this model is not able to reason on indirect precedence relations, so that it has poor performance on our benchmark. We introduce a new global constraint which is able to exploit indirect precedence relations on time-dependent data, and we introduce a second model which is based on our new constraint. We experimentally compare the two models on our benchmark.
|
82 |
A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders / Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiquesBarbato, Michele 05 October 2016 (has links)
Dans cette thèse nous considérons deux problèmes d'optimisation combinatoire.Le premier s'appelle problème du double voyageur de commerce avec contraintes de piles. Dans ce problème, un véhicule doit ramasser un certain nombre d'objets dans une région pour les livrer à des clients situés dans une autre région. Lors du ramassage, les objets sont stockés dans les différentes piles du véhicule et la livraison des objets se fait selon une politique de type last-in-first-out. Le ramassage et la livraison consistent chacune en une tournée Hamiltonienne effectuée par le véhicule dans la région correspondante.Nous donnons une formulation linéaire en nombres entiers pour ce problème. Elle est basée sur des variables de précédence et sur des contraintes de chemins infaisables. Nous donnons par la suite des résultats polyédraux sur l'enveloppe convexe des solutions de notre formulation. En particulier, nous montrons des liens forts avec un polytope associé au problème du voyageur de commerce et des liens avec un polytope de type set covering. Cette étude polyédrale nous permet de renforcer la formulation initiale et de développer un algorithme de coupes et branchements efficace. Le deuxième problème que nous considérons consiste à trouver la description des polytopes lexicographiques. Ces derniers sont les enveloppes convexes des points entiers lexicographiquement compris entre deux points entiers fixés. Nous donnons une description complète de ces polytopes en termes d'inégalités linéaires. Nous démontrons que la famille des polytopes lexicographiques est fermée par intersection. / In this thesis we consider two problems arising in combinatorial optimization.The first one is the double traveling salesman problem with multiple stacks. In this problem a vehicle picks up a given set of items in a region and subsequently delivers them to demanding customers in another region. When an item is picked up, it is put in a stack of the vehicle. The items are delivered observing a last-in-first-out policy. The pickup phase and the delivery phase consist in two Hamiltonian circuits, each performed by the vehicle in the corresponding region. We give a new integer linear programming formulation for this problem. Its main features are the presence of precedence variables and new infeasible path constraints. We provide polyhedral results on the convex hull of the solutions to our formulation. In particular, we show strong links with a specific TSPpolytope and a specific set covering polytope. We deduce strengthening inequalities for the initial formulation, subsequently embedded in an efficient branch-and-cut algorithm. The second problem we consider consists in finding the description of the lexicographical polytopes. These are convex hulls of the integer points lexicographically between two given integer points. We give a complete description of these polytopes by means of linear inequalities. We show that the lexicographical polytope family is closed under intersection.
|
83 |
Offline And Online Disk Scheduling ProblemsAsan, N. Evren 01 December 2006 (has links) (PDF)
This thesis considers the disk scheduling problem. The problem is investigated in two types of settings: offline and online. We first adopt the traveling salesman problem with time windows in the scheduling literature for solving the offline problem. Then we develop a decision epoch scheme in which offline problems are iteratively used in solving the online problem. We perform an experimental study for our approach and two well-known disk scheduling algorithms, and compare them according to several performance criteria.
|
84 |
A Variable Neighborhood Search Procedure For The Combined Location With Partial Coverage And Selective Traveling Salesman ProblemRahim, Fatih 01 May 2010 (has links) (PDF)
In this study, a metaheuristic procedure, particularly a variable neighborhood search procedure, is proposed to solve the combined location and selective traveling salesman problem in glass recycling. The collection of used glass is done by a collecting vehicle that visits a number of predefined collection centers, like restaurants and hospitals that are going to be referred to as compulsory points. Meanwhile, it is desired to locate a predetermined number of bottle banks to
residential areas. The aim is to determine the location of these bottle banks and the route of the collecting vehicle so that all compulsory points and all bottle banks are visited and the maximum profit is obtained. Population zones are defined in residential areas and it is assumed that the people in a particular population zone will recycle their used glass to the closest bottle bank that fully or partially covers their zone. A Variable Neighborhood Search algorithm and its variant have been utilized for the solution of the problem. Computational
experiments have been made on small and medium scale test problems, randomly generated and adapted from the literature.
|
85 |
Dirbtinės bičių kolonijos algoritmai ir jų taikymai maršrutų optimizavimo uždaviniams spręsti / Artificial Bee Colony Algorithms and their Application to Route Optimisation ProblemsKavaliauskas, Donatas 29 July 2013 (has links)
Šiame darbe yra trumpai apžvelgiami dalelių spiečių sistemų algoritmai, maršrutų optimizavimo uždaviniai ir jų formuluotės, bei praktinės interpretacijos. Plačiau apžvelgiami dirbtinių bičių kolonijų algoritmai ir jų pritaikymas keliaujančio pirklio uždaviniams spręsti. Taip pat šiame darbe galima rasti dirbtinių bičių kolonijų algoritmo pritaikymą keliaujančio pirklio uždaviniams spręsti, bei sukurtos programos skaičiavimo rezultatų analizę. / This paper consists of short description of swarm systems algorithms, route optimisation problems overview and longer description of artificial bee colony algorithms adaptation for traveling salesman problem. Moreover, you can find an artificial bee colony algorithm's application to traveling salesman problem and analysis of computational results.
|
86 |
Estatégias para incorporação das deçisões de sequenciamento em um problema integrado de produção de bebidasDefalque, Cristiane Maria [UNESP] 23 February 2010 (has links) (PDF)
Made available in DSpace on 2014-06-11T19:26:55Z (GMT). No. of bitstreams: 0
Previous issue date: 2010-02-23Bitstream added on 2014-06-13T20:55:42Z : No. of bitstreams: 1
defalque_cm_me_sjrp.pdf: 681826 bytes, checksum: 4534893f3d08420f599caa3a4835df06 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho, propomos um modelo integrado de dimensionamento de lotes e programação da produção para uma fábrica de refrigerantes de pequeno porte denominado P1S1MTS. Neste modelo, as decisões de dimensionamento foram baseadas no modelo P1S1M encontrado na literatura, formulado com base no modelo GLSP. As decisões de sequenciamento foram modeladas utilizando restrições do problema do caixeiro viajante assimétrico. Para validação do modelo proposto e comparação entre os modelos P1S1MTS e P1S1M foram feitos testes computacionais com exemplares ilustrativos. Foram realizados também testes com exemplares baseados em dados reais da fábrica de refrigerantes e exemplares gerados aleatoriamente. Os testes foram resolvidos pelo método Branch-and-Cut incluído no pacote computacional CPLEX 10.0. Notamos que com algumas modificações, é possível que ambos os modelos retratem a mesma situação. A partir destas modificações e com os resultados obtidos, concluímos que a resolução de exempalres do modelo P1S1MTS apresentou um tempo de execução computacioanl menor que a resolução de exemplares do modelo P1S1M gerados com os mesmos dados. / In this work we propose a lot sizing and scheduling model, P1S1MTS, for a smallscale soft drink plant. In this model, the lot sising decisions were based on the P1s!m model found in the literaure. To model the scheduling decisions constraints of the asynmetric traveling salesman problem are used. For the validation of the proposed model and a comparison between the P1S1MTS and the P1S1M models computational tests were executed with illustratuve examples. Tests were also executed with examples based on real data and randomly generated instances. Tests were also executed with examples based on real data and randomly in the software CPLEX 10.0. The results showed taht, with some minor modifications, it is possible that both models depict same situation. From the results obtained we concluded that the P1s!MTS model presented a computational time performance better than the P1S1M model.
|
87 |
A replay driven model of spatial sequence learning in the hippocampus-prefrontal cortex network using reservoir computing / Un modèle de rejeu de séquences spatiales dans un réseau Hippocampe-Cortex préfrontal utilisant le reservoir computingCazin, Nicolas 12 July 2018 (has links)
Alors que le rat apprend à chercher de multiples sources de nourriture ou d'eau, des processus d'apprentissage de séquences spatiales et de rejeu ont lieu dans l'hippocampe et le cortex préfrontal.Des études récentes (De Jong et al. 2011; Carr, Jadhav, and Frank 2011) mettent en évidence que la navigation spatiale dans l'hippocampe de rat implique le rejeu de l'activation de cellules de lieu durant les étant de sommeil et d'éveil en générant des petites sous séquences contigues d'activation de cellules de lieu cohérentes entre elles. Ces fragments sont observés en particulier lors d'évènements sharp wave ripple (SPWR).Les phénomènes de rejeu lors du sommeil dans le contexte de la consolidation de la mémoire à long terme ont beaucoup attiré l'attention. Ici nous nous focalisons sur le rôle du rejeu pendant l'état d'éveil.Nous formulons l'hypothèse que ces fragments peuvent être utilisés par le cortex préfrontal pour réaliser une tâche d'apprentissage spatial comprenant plusieurs buts.Nous proposons de développer un modèle intégré d'hippocampe et de cortex préfrontal capable de générer des séquences d'activation de cellules de lieu.Le travail collaboratif proposé prolonge les travaux existants sur un modèle de cognition spatiale pour des tâches orientés but plus simples (Barrera and Weitzenfeld 2008; Barrera et al. 2015) avec un nouveau modèle basé sur le rejeu pour la formation de mémoire dans l'hippocampe et l'apprentissage et génération de séquences spatiales par le cortex préfrontal.En contraste avec les travaux existants d'apprentissage de séquence qui repose sur des règles d'apprentissage sophistiquées, nous proposons d'utiliser un paradigme calculatoire appelé calcul par réservoir (Dominey 1995) dans lequel des groupes importants de neurones artificiels dont la connectivité est fixe traitent dynamiquement l'information au travers de réverbérations. Ce modèle calculatoire par réservoir consolide les fragments de séquence d'activations de cellule de lieu en une plus grande séquence qui pourra être rappelée elle-même par des fragments de séquence.Le travail proposé est supposé contribuer à une nouvelle compréhension du rôle du phénomène de rejeu dans l'acquisition de la mémoire dans une tâche complexe liée à l'apprentissage de séquence.Cette compréhension opérationnelle sera mise à profit et testée dans l'architecture cognitive incarnée d'un robot mobile selon l'approche animat (Wilson 1991) [etc...] / As rats learn to search for multiple sources of food or water in a complex environment, processes of spatial sequence learning and recall in the hippocampus (HC) and prefrontal cortex (PFC) are taking place. Recent studies (De Jong et al. 2011; Carr, Jadhav, and Frank 2011) show that spatial navigation in the rat hippocampus involves the replay of place-cell firing during awake and sleep states generating small contiguous subsequences of spatially related place-cell activations that we will call "snippets". These "snippets" occur primarily during sharp-wave-ripple (SPWR) events. Much attention has been paid to replay during sleep in the context of long-term memory consolidation. Here we focus on the role of replay during the awake state, as the animal is learning across multiple trials.We hypothesize that these "snippets" can be used by the PFC to achieve multi-goal spatial sequence learning.We propose to develop an integrated model of HC and PFC that is able to form place-cell activation sequences based on snippet replay. The proposed collaborative research will extend existing spatial cognition model for simpler goal-oriented tasks (Barrera and Weitzenfeld 2008; Barrera et al. 2015) with a new replay-driven model for memory formation in the hippocampus and spatial sequence learning and recall in PFC.In contrast to existing work on sequence learning that relies heavily on sophisticated learning algorithms and synaptic modification rules, we propose to use an alternative computational framework known as reservoir computing (Dominey 1995) in which large pools of prewired neural elements process information dynamically through reverberations. This reservoir computational model will consolidate snippets into larger place-cell activation sequences that may be later recalled by subsets of the original sequences.The proposed work is expected to generate a new understanding of the role of replay in memory acquisition in complex tasks such as sequence learning. That operational understanding will be leveraged and tested on a an embodied-cognitive real-time framework of a robot, related to the animat paradigm (Wilson 1991) [etc...]
|
88 |
ALGORITMO EVOLUTIVO PARA O PROBLEMA DO CAIXEIRO VIAJANTE COM DEMANDAS HETEROGÊNEAS / ALGORITHM EVOLUTIONARY FOR THE TRAVELLING SALESMAN PROBLEM WITH HETEROGENEOUS DEMANDSVieira, Luis Eduardo 23 November 2006 (has links)
The work proposed in this dissertation is the field of combinatorial optimization, which aims to find a solution to these types of problems at a low computational time and effectively. The combinatorial optimization studies a set of discrete solutions, which have a finite number of elements, to find the best viable solution to the problems of this magnitude. One of the main approaches that area is the Traveling Salesman Problem (TSP), mainly due to the size of possible solutions to the problem, so that is intractable computation by exhaustive search methods. Given all these features, this work is to study and develop evolutionary strategies for the resolution of the Problem of Traveling Salesman with Heterogeneous Demands (TSPHD), a variation of the classic TSP. The evolutionary strategies belong to the class of evolutionary computation, and methods of search based on the theory of the evolution of species, where the best individuals compete for survival. The evolutionary strategies differ from other optimization techniques, as the search is conducted in a population of solutions, not a single point. To solve the problem are proposed four evolutionary algorithms, using heuristics techniques and metaheurísticas for its implementation. The results were obtained from tests using instances of low density (low connection), and compared with the exact solution (optimal solution) and other progressive methods in the literature. These results are evaluated on the basis of their quality and time for its implementation. / O trabalho proposto nessa dissertação pertence à área de otimização combinatória, a qual visa encontrar uma solução para esses tipos de problema em um tempo computacional baixo e de forma eficaz. A otimização combinatória estuda um conjunto discreto de soluções, os quais possuem um número finito de elementos, para se poder encontrar a melhor solução viável para os problemas dessa grandeza. Uma das principais abordagens dessa área é o Problema do Caixeiro Viajante (PCV), principalmente devido à dimensão de possíveis soluções para o problema, fazendo com que seja intratável computacionalmente por métodos de buscas exaustivas. Face a todas essas características, este trabalho tem por objetivo estudar e desenvolver estratégias evolutivas para a resolução do Problema do Caixeiro Viajante com Demandas Heterogêneas (PCVDH), uma variação do PCV clássico. As estratégias evolutivas pertencem à classe da computação evolutiva, sendo métodos de busca inspirados na teoria da evolução das espécies, onde os melhores indivíduos competem pela sobrevivência. As estratégias evolutivas diferem das demais técnicas de otimização, pois a busca é realizada em uma população de soluções, não em um único ponto. Para a resolução do problema são propostos quatro algoritmos evolutivos, utilizando técnicas heurísticas e metaheurísticas para sua aplicação. Os resultados foram obtidos com testes utilizando instâncias de baixa densidade (baixa conexão), e comparados com a sua solução exata (solução ótima) e com outros métodos evolutivos encontrados na literatura. Esses resultados são avaliados com base na sua qualidade e tempo decorrido para sua execução.
|
89 |
Formulações fortes para o problema integrado de dimensionamento e sequenciamento da produção /Carretero, Michelli Maldonado. January 2011 (has links)
Orientador: Maria do Socorro Nogueira Rangel / Banca: Alistair Clark / Banca: Silvio Alexandre de Araujo / Resumo: Em alguns setores, o planejamento da produção envolve dois aspectos: o dimensionamento do tamanho dos lotes e a programação da produção (sequenciamento dos lotes). O primeiro problema consiste em determinar o tamanho dos lotes de produção de cada item a ser produzido em uma ou mais máquinas em cada período ao longo de um horizonte de planejamento finito. O segundo problema consiste em encontrar a ordem em que os lotes devem ser produzidos em um dado conjunto de máquinas. Estes dois aspectos do planejamento da produção podem ser tratados de forma independente: em um estágio é resolvido o problema de dimensionamento dos lotes e no outro, realizado antes ou depois, é resolvido o problema de seqüenciamento. No entanto, uma tendência recente na literatura são trabalhos que apresentam modelos matemáticos que capturam simultaneamente as relações entre os dois problemas. Na literatura pode-se encontrar modelos integrados que incluem restrições de eliminação de subrotas, propostas para o Problema do Caixeiro Viajante (PCV), para formular as restrições de sequenciamento. No entanto, alguns dos modelos propostos usam restrições de ordem polinomial que fornecem uma relaxação linear fraca. O objetivo desse trabalho é avaliar o uso de inequações válidas, propostas na literatura, para obtenção de formulações mais fortes para o problema integrado de dimensionamento e sequenciamento da produção. Resultados computacionais usando exemplares aleatórios e exemplares da literatura mostram que as reformulações propostas são eficientes para cenários em que o modelo original não é eficiente. / Abstract: Often, the production planning involves the lot sizing and scheduling of items. The first problem is to determine the lot size of each item to be produced in one or more machines in each period over a finite planning horizon. The second problem is to find the order in which the items will be produced. These two aspects of the production planning can be treated independently: in one stage the lot sizing problem is solved, and in the other, that can be executed before or after, the scheduling problem is solved. A recent trend in the literature is to propose mathematical models that capture the relationships between these two problems. In the literature one can find integrated models that include subtour elimination constraints, proposed for the Traveling Salesman Problem, to formulate the scheduling decisions. However, in some of these models, constraints of polynomial order, that provides a weak linear relaxation, are used.The purpose of this study is to evaluate the use of valid inequalities proposed in the literature to obtain stronger formulations to the lot and scheduling problem. Computational results using random instances and instances from the literature show that the proposed formulations have a better performance in scenarios where the original model is not efficient. / Mestre
|
90 |
Estatégias para incorporação das deçisões de sequenciamento em um problema integrado de produção de bebidas /Defalque, Cristiane Maria. January 2010 (has links)
Orientador: Maria do Socorro Nogueira Rangel / Banca: Deisemara Ferreira / Banca: Silvio Alexandre Araujo / Resumo: Neste trabalho, propomos um modelo integrado de dimensionamento de lotes e programação da produção para uma fábrica de refrigerantes de pequeno porte denominado P1S1MTS. Neste modelo, as decisões de dimensionamento foram baseadas no modelo P1S1M encontrado na literatura, formulado com base no modelo GLSP. As decisões de sequenciamento foram modeladas utilizando restrições do problema do caixeiro viajante assimétrico. Para validação do modelo proposto e comparação entre os modelos P1S1MTS e P1S1M foram feitos testes computacionais com exemplares ilustrativos. Foram realizados também testes com exemplares baseados em dados reais da fábrica de refrigerantes e exemplares gerados aleatoriamente. Os testes foram resolvidos pelo método Branch-and-Cut incluído no pacote computacional CPLEX 10.0. Notamos que com algumas modificações, é possível que ambos os modelos retratem a mesma situação. A partir destas modificações e com os resultados obtidos, concluímos que a resolução de exempalres do modelo P1S1MTS apresentou um tempo de execução computacioanl menor que a resolução de exemplares do modelo P1S1M gerados com os mesmos dados. / Abstract: In this work we propose a lot sizing and scheduling model, P1S1MTS, for a smallscale soft drink plant. In this model, the lot sising decisions were based on the P1s!m model found in the literaure. To model the scheduling decisions constraints of the asynmetric traveling salesman problem are used. For the validation of the proposed model and a comparison between the P1S1MTS and the P1S1M models computational tests were executed with illustratuve examples. Tests were also executed with examples based on real data and randomly generated instances. Tests were also executed with examples based on real data and randomly in the software CPLEX 10.0. The results showed taht, with some minor modifications, it is possible that both models depict same situation. From the results obtained we concluded that the P1s!MTS model presented a computational time performance better than the P1S1M model. / Mestre
|
Page generated in 0.0719 seconds