Log in

Relevant bibliographies by topics / Salesman problem / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Salesman problem.

Dissertations / Theses on the topic 'Salesman problem'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Salesman problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Mattsson, Per. "The Asymmetric Traveling Salesman Problem." Thesis, Uppsala universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624.

Full text

Abstract:

This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the ATSP we are given a set of cities and a function that gives the cost of travelingbetween any pair of cities. The cost function must satisfy the triangle inequality, i.e.the cost of traveling from city A to city B cannot be larger than the cost of travelingfrom A to some other city C and then to B. However, we allow the cost function tobe asymmetric, i.e. the cost of traveling from city A to city B may not equal the costof traveling from B to A. The problem is then t

APA, Harvard, Vancouver, ISO, and other styles

2

Butler, Martin. "2-period travelling salesman problem." Thesis, University of Southampton, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.242250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gupta, Anil Kumar. "On a generalized travelling salesman problem." Thesis, University of Ottawa (Canada), 1986. http://hdl.handle.net/10393/4745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Schmitting, Walter. "Das Traveling-Salesman-Problem Anwendungen und heuristische Nutzung von Voronoi-Delaunay-Strukturen zur Lösung euklidischer, zweidimensionaler Traveling-Salesman-Probleme /." Münster : Schmitting, 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=960608176.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Accorsi, Luca. "L'algoritmo bionomico per il Traveling Salesman Problem." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9396/.

Full text

Abstract:

In questa tesi viene presentato un nuovo metaeuristico per la risoluzione del Traveling Salesman Problem (TSP) simmetrico. Tale metodo, detto algoritmo bionomico, è una variante dell'algoritmo genetico che usa un metodo innovativo di generazione del parents set. Nella tesi vengono proposti diversi metodi di crossover specifici per il TSP ma che possono essere facilmente estesi per altri problemi di ottimizzazione combinatoria. Tali metodi sono stati sperimentati su un insieme di problemi test, i risultati computazionali mostrano l'efficienza dei metodi proposti. In particolare uno dei metodi d

APA, Harvard, Vancouver, ISO, and other styles

6

Simsek, Omur. "The Biobjective Traveling Salesman Problem With Profit." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12608890/index.pdf.

Full text

Abstract:

The traveling salesman problem (TSP) is defined as: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities only once and returning to your starting city. Some variants of TSP are proposed to visit cities depending on the profit gained when the visit occurs. In literature, these kind of problems are named TSP with profit. In TSP with profit, there are two conflicting objectives, one to collect profit and the other to decrease traveling cost. In literature, TSP with profit are addressed as single objective, either

APA, Harvard, Vancouver, ISO, and other styles

7

Shapiro, Jeremy F. 1939. "Convergent Duality for the Traveling Salesman Problem." Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5199.

Full text

Abstract:

A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group theoretic and Lagrangean relaxation constructions. Key Words: Traveling Salesman Problem, Lagrangean relaxation, shortest route problem, generalized linear programming, group theory.

APA, Harvard, Vancouver, ISO, and other styles

8

Cotton, Richard V. "Geometrical heuristics for the traveling salesman problem." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/25573.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hui, Ming-Ki, and 許明琪. "The traveling salesman problem and its applications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B4257707X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hui, Ming-Ki. "The traveling salesman problem and its applications." Click to view the E-thesis via HKUTO, 2002. http://sunzi.lib.hku.hk/hkuto/record/B4257707X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bryant, Kylie. "Genetic Algorithms and the Travelling Salesman Problem." Scholarship @ Claremont, 2000. https://scholarship.claremont.edu/hmc_theses/126.

Full text

Abstract:

Genetic algorithms are an evolutionary technique that use crossover and mutation operators to solve optimization problems using a survival of the fittest idea. They have been used successfully in a variety of different problems, including the traveling salesman problem. In the traveling salesman problem we wish to find a tour of all nodes in a weighted graph so that the total weight is minimized. The traveling salesman problem is NP-hard but has many real world applications so a good solution would be useful. Many different crossover and mutation operators have been devised for the traveling s

APA, Harvard, Vancouver, ISO, and other styles

12

Patil, Geetha. "Compatible tours for the asymmetric traveling salesman problem." Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/27006.

Full text

Abstract:

In this thesis, we consider this question through the study of a problem called the Compatible Tour Problem (CTP). Given an optimal ASEP solution x*, a compatible tour for x* is a directed Hamiltonian cycle that has exactly one edge coming in and one edge going out of the node set (henceforth called a tight set) of every tight cut of value 2 of x*. The compatible tour problem is the problem of finding a minimum cost compatible tour for x*, where x* is the optimal solution of the ASEP. Note that it is suspected that CTP is an NP-hard problem. We consider the problem of finding a minimum cost "

APA, Harvard, Vancouver, ISO, and other styles

13

Fortini, Matteo <1975&gt. "LP-based heuristics for the Traveling Salesman Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/339/1/tesi.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Fortini, Matteo <1975&gt. "LP-based heuristics for the Traveling Salesman Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/339/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Lim, Huay Huay. "Period traveling salesman with customer stratification." Diss., Columbia, Mo. : University of Missouri-Columbia, 2006. http://hdl.handle.net/10355/5857.

Full text

Abstract:

Thesis (Ph. D.)--University of Missouri-Columbia, 2006.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 10, 2007) Vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

16

Schmitting, Walter [Verfasser]. "Das Traveling-Salesman-Problem : Anwendungen und heuristische Nutzung von Voronoi-Delaunay-Strukturen zur Lösung euklidischer, zweidimensionaler Traveling-Salesman-Probleme / Walter Schmitting." Münster : Schmitting, 2000. http://d-nb.info/960608176/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Baltz, Andreas. "Algorithmic and probabilistic aspects of the bipartite traveling salesman problem." [S.l. : s.n.], 2001. http://e-diss.uni-kiel.de/diss]/d423.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Chio, Chou Hei. "Apply algorithm of changes to solve traveling salesman problem." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Lee, Seung Ho. "Greedy randomized adaptive search procedure for traveling salesman problem." Texas A&M University, 2005. http://hdl.handle.net/1969.1/3735.

Full text

Abstract:

In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-relinking method for the initial tour improvement. To increase 2-opt search speed, fixed-radius near neighbor search and don0t − look bit techniques are introduced. For the same reason a new efficient data structure, the reverse array, is proposed to represent the TSP tour. Computational results show that GRASP gives fairly good solutions in a short time.

APA, Harvard, Vancouver, ISO, and other styles

20

Ribeiro, Wesley Elias. "Algoritmos heuristicos para o prize collecting traveling salesman problem." [s.n.], 1997. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275971.

Full text

Abstract:

Orientadores: Pedro Sergio de Souza, Cid Carvalho de Souza<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-07-23T06:12:54Z (GMT). No. of bitstreams: 1 Ribeiro_WesleyElias_M.pdf: 3030614 bytes, checksum: 36a45d851a8415069c93b66b7f8b80da (MD5) Previous issue date: 1997<br>Resumo: Esta dissertação trata do Problema do Caixeiro Viajante Coletor de Prêmios (Prize Collecting Traveling Salesman Problem-PCTSP). Este problema é uma generalização do bastante conhecido Problema do Caixeiro Viajante (Traveling Salesman Problem -

APA, Harvard, Vancouver, ISO, and other styles

21

Ahrens, Barry. "A Tour Construction Framework for the Travelling Salesman Problem." NSUWorks, 2012. http://nsuworks.nova.edu/gscis_etd/74.

Full text

Abstract:

The Tour Construction Framework (TCF) integrates both global and local heuristics in a complementary framework in order to efficiently solve the Travelling Salesman Problem (TSP). Most tour construction heuristics are strictly local in nature. However, the experimental method presented in this research includes a global heuristic to efficiently solve the TSP. The Global Path (GP) component and Super Node (SN) component comprise the TCF. Each component heuristic is tuned with one or more parameters. Genetic Algorithms (GA) are used to train the collection of parameters for the TCF components on

APA, Harvard, Vancouver, ISO, and other styles

22

Adler, Aviv. "The Traveling Salesman Problem and orienteering for kinodynamic vehicles." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113975.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 55-56).<br>The Traveling Salesman Problem is a major foundational problem in the fields of Computer Science, Operations Research, and Applied Mathematics, in which an agent wants to visit a set of target points with the shortest path possible. This problem is of the highest interest both theoretically in practice. When the agent is a vehicle whose trajectory must satisfy a set of dynamic cons

APA, Harvard, Vancouver, ISO, and other styles

23

Zhong, Xianghui [Verfasser]. "Approximation Algorithms for the Traveling Salesman Problem / Xianghui Zhong." Bonn : Universitäts- und Landesbibliothek Bonn, 2021. http://d-nb.info/1238729193/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Biron, David. "The traveling salesman problem : deceptively easy to state; notoriously hard to solve /." Lynchburg, VA : Liberty University, 2006. http://digitalcommons.liberty.edu.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bonifaci, Vincenzo. "Models and algorithms for online server routing." Doctoral thesis, La Sapienza, 2007. http://hdl.handle.net/11573/917056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

KHAN, Muhammad Umair. "Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem." Thesis, Högskolan Dalarna, Datateknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4910.

Full text

Abstract:

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have

APA, Harvard, Vancouver, ISO, and other styles

27

DASTMARD, SOHOF. "The Asymmetric Travelling Salesman Problem : A Linear Programming Solution Approach." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157412.

Full text

Abstract:

The travelling salesman problem is a well known optimization problem. The goal is to nd theshortest tour that visits each city in a given list exactly once. Despite the simple problem statementit belongs to the class of NP-complete problems. Its importance arises from a plethora of applicationsas well as a theoretical appeal. The asymmetric TSP is not as well researched as the symmetric TSP,in this paper we focus on a solution approach suitable for the asymmetric case. We demonstrate howa linear programming formulation can be used to solve the problem. We also show the limitationsof this solut

APA, Harvard, Vancouver, ISO, and other styles

28

Krishnamoorthy, Mohan. "Contributions to the solution of the symmetric travelling salesman problem." Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46875.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Itani, Sleiman M. "On the Stochastic Travelling Salesman problem for the Dubin's vehicle." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37932.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 53-56).<br>In this thesis, I solve the following problem: Given a rectangular region R in which n (n is large) targets are distributed according to some continuous or piece-wise continuous distribution, find the length of the optimal Stochastic Travelling Salesperson tour of a Dubin vehicle over the n targets and design an algorithm that performs within a. constant factor of the optimal expected tour length. We first solve the problem for

APA, Harvard, Vancouver, ISO, and other styles

30

Höck, Barbar Katja. "An examination of heuristic algorithms for the travelling salesman problem." Master's thesis, University of Cape Town, 1988. http://hdl.handle.net/11427/22268.

Full text

Abstract:

The role of heuristics in combinatorial optimization is discussed. Published heuristics for the Travelling Salesman Problem (TSP) were reviewed and morphological boxes were used to develop new heuristics for the TSP. New and published heuristics were programmed for symmetric TSPs where the triangle inequality holds, and were tested on micro computer. The best of the quickest heuristics was the furthest insertion heuristic, finding tours 3 to 9% above the best known solutions (2 minutes for 100 nodes). Better results were found by longer running heuristics, e.g. the cheapest angle heuristic (CC

APA, Harvard, Vancouver, ISO, and other styles

31

Tsai, Pei-Fang. "Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems." Diss., Virginia Tech, 2006. http://hdl.handle.net/10919/27863.

Full text

Abstract:

This dissertation is devoted to the development of new flow-based formulations for the asymmetric traveling salesman problem (ATSP) and to the demonstration of their applicability in effectively solving some scheduling problems. The ATSP is commonly encountered in the areas of manufacturing planning and scheduling, and transportation logistics. The integration of decisions pertaining to production and shipping, in the supply chain context, has given rise to an additional and practical relevance to this problem especially in situations involving sequence-dependent setups and routing of vehicl

APA, Harvard, Vancouver, ISO, and other styles

32

Rohleder, Andreas. "Kandidatenmengen für das TSP : ein neuer heuristischer Ansatz /." Lohmar [u.a.] : Eul, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2837955&prov=M&dok_var=1&dok_ext=htm.

Full text

Abstract:

Universiẗat, Diss., 2005 u.d.T.: Rohleder, Andreas: Ein Vorschlag zur Erzeugung von Kandidatenmengen zur Unterstützung der heuristischen Lösung des geometrischen zweidimensionalen Traveling Salesman Problems--Münster (Westfalen).

APA, Harvard, Vancouver, ISO, and other styles

33

Rohleder, Andreas. "Kandidatenmengen für das TSP ein neuer heuristischer Ansatz." Lohmar Köln Eul, 2005. http://deposit.d-nb.de/cgi-bin/dokserv?id=2837955&prov=M&dok_var=1&dok_ext=htm.

Full text

Abstract:

Zugl.: Münster (Westfalen), Univ., Diss., 2005 u.d.T.: Rohleder, Andreas: Ein Vorschlag zur Erzeugung von Kandidatenmengen zur Unterstützung der heuristischen Lösung des geometrischen zweidimensionalen Traveling Salesman Problems

APA, Harvard, Vancouver, ISO, and other styles

34

Keuthen, Ralf. "Heuristic approaches for routing optimisation." Thesis, University of Nottingham, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275960.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Melgarejo, Penélope Aguiar. "A constraint programming approach for the time dependent traveling salesman problem." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSEI142.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

36

Hahsler, Michael, and Kurt Hornik. "TSP - Infrastructure for the Traveling Salesperson Problem." American Statistical Association, 2007. http://epub.wu.ac.at/3990/1/TSP.pdf.

Full text

Abstract:

The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NP-complete problems. The importance of the TSP arises besides from its theoretical appeal from the variety of its applications. Typical applications in operations research include vehicle routing, computer wiring, cutting wallpaper and job seq

APA, Harvard, Vancouver, ISO, and other styles

37

Karademir, Serdar. "A Genetic Algorithm For The Biobjective Traveling Salesman Problem With Profits." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609729/index.pdf.

Full text

Abstract:

In Traveling Salesman Problem (TSP) with profits, a profit is associated with each city and the requirement to visit all cities is removed. The purpose is to simultaneously minimize cost (excluding as many cities as possible) and maximize profit (including as many cities as possible). Although the reduced single-objective case of the problem has been well-studied, the true biobjective problem has been studied only by a few researchers. In this paper we study the true biobjective problem using the Multiobjective Genetic Algorithm NSGA II and the Lin-Kernighan Heuristic. We propose several impro

APA, Harvard, Vancouver, ISO, and other styles

38

Jonsson, Håkan. "The Euclidean traveling salesman problem with neighborhoods and a connecting fence." Doctoral thesis, Luleå tekniska universitet, Datavetenskap, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26604.

Full text

Abstract:

An important class of problems in robotics deals with the planning of paths. In this thesis, we study this class of problems from an algorithmic point of view by considering cases where we have complete knowledge of the environment and each solution must ensure that a point-sized robot capable of moving continuously and turning arbitrarily accomplishes the following: (1) visits a given set of objects attached to an impenetrable simple polygon in the plane, and (2) travels along a path of minimum length over all the possible paths that visit the objects without crossing the polygon. In its gene

APA, Harvard, Vancouver, ISO, and other styles

39

Phillips, Jeffrey Mark. "The bottleneck traveling salesman problem on a Halin graph and extensions." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0003/MQ35518.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Jonsson, Håkan. "The euclidean traveling salesman problem with neighborhoods and a connecting fence /." Luleå, 2000. http://epubl.luth.se/1402-1544/2000/36/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Almulla, Mohammed Ali. "A class of greedy algorithms for solving the travelling salesman problem /." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59557.

Full text

Abstract:

The travelling salesman problem is one of the NP-complete problems. It has been under consideration in computer science for at least forty years. Solving this hard problem using search methods can be accomplished by choosing: a starting point, a solution generation scheme and a termination rule. When the termination rule is such that search stops if and only if the tour is optimal, we call the method "exact". When the termination rule is such that the search stops but not necessarily with an optimal tour, we call the method "approximate".<br>This thesis looks closely at one of the approximate

APA, Harvard, Vancouver, ISO, and other styles

42

Bernardino, Raquel. "The family traveling salesman problem." Doctoral thesis, 2019. http://hdl.handle.net/10451/42303.

Full text

Abstract:

Consider a depot, a partition of the set of nodes into subsets, called families, and a cost matrix. The objective of the family traveling salesman problem (FTSP) is to find the minimum cost circuit that starts and ends at the depot and visits a given number of nodes per family. The FTSP was motivated by the order picking problem in warehouses where products of the same type are stored in different places and it is a recent problem. Nevertheless, the FTSP is an extension of well-known problems, such as the traveling salesman problem. Since the benchmark instances available are in small number

APA, Harvard, Vancouver, ISO, and other styles

43

Liu, Yu-Shao, and 劉昱劭. "Traveling Salesman Problem with Order Delivery." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/w8m62q.

Full text

Abstract:

碩士<br>國立交通大學<br>資訊管理研究所<br>96<br>This thesis considers the traveling salesman problem incorporating order delivery. There is a set of nodes to be visited and each node belongs to a specific group. The completion time of a group is the moment when all nodes belonging to it have been visited. The problem is to determine a visitation sequence of the nodes such that the weighted sum of completion times over all groups is minimized. We present a binary linear programming model to formulate the studied problem and then develop an O(n22n) dynamic programming algorithm for determining optimal solution

APA, Harvard, Vancouver, ISO, and other styles

44

GAHLOT, TANYA. "TRAVELLING SALESMAN PROBLEM AND CALL ROUTING." Thesis, 2022. http://dspace.dtu.ac.in:8080/jspui/handle/repository/19715.

Full text

Abstract:

In this paper we have briefed the minimum cost or to maximum profit of the routing network calls using travelling salesman problem. Our problem is somehow related to least cost routing, we will use heuristics method for travelling salesman problem to solve our formulated problem. All the network calls are transported via different routes between base stations. Service providers lay down their networks or sign an agreement with other provider services to customer while establish a connection, selecting the route associated with minimum cost is the ultimate solution. Telecommunicatio

APA, Harvard, Vancouver, ISO, and other styles

45

Liu, Chung-Hao, and 劉宗豪. "The Moving-Target Traveling Salesman Problem with Resupply." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/29895811044133459299.

Full text

Abstract:

碩士<br>國立中正大學<br>應用數學研究所<br>95<br>In the classical Traveling Salesman Problem (TSP), the targets to be visited are stationary. However, several practical scenarios give rise to TSP instances where the targets to be visited are themselves in motion. We introduce a time-dependent generalization of TSP called Moving-Target TSP. In this paper, we will discuss Moving-Target TSP with resupply and present an algorithm for the Moving-Target TSP with resupply where all targets are moving towards the origin with constant velocities. We also propose an algorithm for Moving-Target TSP with resupply while o

APA, Harvard, Vancouver, ISO, and other styles

46

Kuo, Chiu-Kan, and 郭秋泔. "Probabilistic traveling salesman problem with route duration restrictions." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/92026628861996847528.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>運輸倉儲營運所<br>92<br>For international express service industry, it is very import to delivery good efficiently. The efficiency of pick-up service is mainly influenced by the courier service route design and duty area partition. The presence of uncertain customer demand creates the need to design a priori tour instead of finding optimal tour everyday. This thesis focuses on route design for courier service. The objective is to minimize the probability of that the total tour duration exceeds the given duration constraints, with the strategy of service a random subset of custo

APA, Harvard, Vancouver, ISO, and other styles

47

Lee, Chieh-Lung, and 李捷隆. "distributed genetic algorithm apply to travel salesman problem." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/45274364932569216187.

Full text

Abstract:

碩士<br>中原大學<br>資訊工程研究所<br>92<br>In this paper, we propose a distributed genetic algorithm to solve Travel Salesman Problem , The purpose is to parallelize serial GA efficiently and then the final answer could be more acceptable .For Data migration method , we use asynchronous and synchronous ways to implement migration , and do some experiments to compare the results . In asynchronous migration , we present a global gene pool in the master node for all slaves , while migration happen between master and slave , the gene pool get better individual and raise it’s value , that kind of evaluation is

APA, Harvard, Vancouver, ISO, and other styles

48

Shing, Lee Ying, and 李穎勳. "The Study of Bicriterion-Multivariants Traveling Salesman Problem." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/21797211548803378921.

Full text

Abstract:

碩士<br>東海大學<br>工業工程研究所<br>81<br>The classical Traveling Salesman Problem (TSP) has been sucessfully applied to a broad variety of real word situation from tour scheduling and production scheduling problems. The tour scheduling problem is a typical bicriterion TSP containing both of time and cost criteria. The tour scheduling problem consists of itinerary and travel tools between each city pairs. The classical TSP considers only a single tool between cities that limits practical application.

APA, Harvard, Vancouver, ISO, and other styles

49

ZENG, YI-DE, and 曾以德. "Rectilinear polygon decomposition algorithms and travelling salesman problem." Thesis, 1987. http://ndltd.ncl.edu.tw/handle/83145283798878181140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Hsiao, Ho-Yuan, and 蕭賀元. "The Traveling Salesman Problem with Time Window Constraints." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/10971137226081629414.

Full text

Abstract:

碩士<br>東海大學<br>資訊管理學系<br>99<br>The traveling salesman problem with time window constraints is an extension research of the traveling salesman problem. It also joined the process control issues and the customer-oriented concept. To provide the service within a specific service time window that suits the needs of customers. Because of considering the time window constraints, the traveling salesman problem would be more practical in the daily life. There are two research topics in this study. The first one is the traveling salesman problem that considers sleep within hard time window constraints.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!