Log in

Relevant bibliographies by topics / Traveling Salesman Problem with Time-window

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Traveling Salesman Problem with Time-window'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Traveling Salesman Problem with Time-window.'

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.

Journal articles on the topic "Traveling Salesman Problem with Time-window"

1

Obi, Chris Jojo. "Using genetic algorithm to solve multiple traveling salesman problem and considering Carbon emissions." Indian Journal of Science and Technology 13, no. 36 (2020): 3707–15. http://dx.doi.org/10.17485/ijst/v13i36.1316.

Full text

Abstract:

Objectives: The Multiple Travelling Salesman problem is a complex combinatorial optimization problem which is a variance of the Traveling Salesman Problem,where a lot of salesmen are utilized in the solution. In this work a cold chain logistics and route optimization model with minimum transport cost, carbon cost and Refrigeration cost are constructed. Methods: A genetic algorithm is then proposed to solve for the Multiple Travelling Salesman Problem with time windows while transport cost, carbon emission cost and refrigeration cost is minimized. Findings: It was observed that the algorithm ev

APA, Harvard, Vancouver, ISO, and other styles

2

Essani, Furqan, and Sajjad Haider. "An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets." Algorithms 11, no. 10 (2018): 143. http://dx.doi.org/10.3390/a11100143.

Full text

Abstract:

The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems. The problem becomes more complicated when the cost matrix is not symmetric. In such cases, finding even a feasible solution to the problem becomes a challenging task. In this paper, an algorithm is presented that uses Colored Petri Nets (CPN)—a mathematical modeling language—to represent the Multiple Traveling Salesman Problem. The proposed algorithm map

APA, Harvard, Vancouver, ISO, and other styles

3

Yurtkuran, Alkın, and Erdal Emel. "Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/871242.

Full text

Abstract:

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy,

APA, Harvard, Vancouver, ISO, and other styles

4

Schneider, Johannes. "The time-dependent traveling salesman problem." Physica A: Statistical Mechanics and its Applications 314, no. 1-4 (2002): 151–55. http://dx.doi.org/10.1016/s0378-4371(02)01078-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Silalahi, Bib Paruhum, Nurul Fathiah, and Prapto Tri Supriyo. "Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes." Jurnal Matematika "MANTIK" 5, no. 2 (2019): 100–111. http://dx.doi.org/10.15642/mantik.2019.5.2.100-111.

Full text

Abstract:

Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time compl

APA, Harvard, Vancouver, ISO, and other styles

6

XU, JINHUI, ZHIYONG LIN, YANG YANG, and RONALD BEREZNEY. "TRAVELING SALESMAN PROBLEM OF SEGMENTS." International Journal of Computational Geometry & Applications 14, no. 01n02 (2004): 19–40. http://dx.doi.org/10.1142/s0218195904001342.

Full text

Abstract:

In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n ∊-separated segments in two dimensional space. Our results are based on an interesting combinatorial result which bounds the total number of entry points in an optimal TSP tour and a generalization of Arora's technique5 for Euclidean TSP (of a set of points). The randomized version of our algorithm takes O(n2( log n)O(1/∊2)) time to compute a (1+∊)-approximation with probability ≥l/2, and

APA, Harvard, Vancouver, ISO, and other styles

7

YAPICIOĞLU, Haluk. "MULTIPERIOD MULTI TRAVELING SALESMEN PROBLEM UNDER TIME WINDOW CONSTRAINTS." Anadolu University Journal of Science and Technology-A Applied Sciences and Engineering 15, no. 2 (2015): 113. http://dx.doi.org/10.18038/btd-a.72818.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mingozzi, Aristide, Lucio Bianco, and Salvatore Ricciardelli. "Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints." Operations Research 45, no. 3 (1997): 365–77. http://dx.doi.org/10.1287/opre.45.3.365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Yuliastuti, Gusti Eka, Wayan Firdaus Mahmudy, and Agung Mustika Rizki. "Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika." MATICS 9, no. 1 (2017): 38. http://dx.doi.org/10.18860/mat.v9i1.4072.

Full text

Abstract:

<p class="Text"><strong><span lang="EN-US">The route of the travel tour packages offered by travel agents is not considered optimum, so the level of satisfaction the tourist is not maximal. Selection of the route of the travel packages included in the traveling salesman problem (TSP). The problem that occurs is uncertain tourists visiting destinations at the best destinations timing hereinafter be referred to as the fuzzy time window problem. Therefore, the authors apply the genetic algorithm to solve the problem. Based on test results obtained optimum solution with the fitne

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Xiubin, and Amelia C. Regan. "On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints." Computers & Industrial Engineering 56, no. 1 (2009): 161–64. http://dx.doi.org/10.1016/j.cie.2008.04.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Traveling Salesman Problem with Time-window"

1

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

2

Baik, Hojong. "Development of Optimization and Simulation Models for the Analysis of Airfield Operations." Diss., Virginia Tech, 2000. http://hdl.handle.net/10919/28162.

Full text

Abstract:

This research is concerned with the modeling and development of algorithmic approaches for solving airport operational problems that arise in Air Traffic Control (ATC) systems within the terminal area at hub airports. Specifically, the problems addressed include the Aircraft Sequencing Problem (ASP) for runway operations, the Network Assignment Problem (NAP) for taxiway operations, and a simulation model for the evaluation of current or proposed ATC system in detail. For the ASP, we develop a mathematical model and apply the Reformulation-Linearization-Technique (RLT) of Sherali and Adams to c

APA, Harvard, Vancouver, ISO, and other styles

3

Hommadi, Abbas. "Multi-Stop Routing Optimization: A Genetic Algorithm Approach." DigitalCommons@USU, 2018. https://digitalcommons.usu.edu/etd/7048.

Full text

Abstract:

In this research, we investigate and propose new operators to improve Genetic Algorithm’s performance to solve the multi-stop routing problem. In a multi-stop route, a user starts at point x, visits all destinations exactly once, and then return to the same starting point. In this thesis, we are interested in two types of this problem. The first type is when the distance among destinations is fixed. In this case, it is called static traveling salesman problem. The second type is when the cost among destinations is affected by traffic congestion. Thus, the time among destinations changes during

APA, Harvard, Vancouver, ISO, and other styles

4

Asan, N. Evren. "Offline And Online Disk Scheduling Problems." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607909/index.pdf.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

5

Zavichi, Tork Amir. "A real-time crane service scheduling decision support system (CSS-DSS) for construction tower cranes." Doctoral diss., University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/6041.

Full text

Abstract:

The success of construction projects depends on proper use of construction equipment and machinery to a great extent. Thus, appropriate planning and control of the activities that rely on construction equipment could have significant effects on improving the efficiency of project operations. Cranes are the largest and most conspicuous construction equipment, widely used in typical construction sites. They play a major role in relocation of materials in horizontal and vertical directions on construction sites. Given the nature of activities relying on construction cranes in various stages of a

APA, Harvard, Vancouver, ISO, and other styles

6

Ptáčková, Michaela. "Optimalizace tras při rozvozu zásilek." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-264544.

Full text

Abstract:

This thesis deals with optimization problems of the parcels distribution. This issue can be solved on the ground of traveling salesman problem whose mathematical and economic model, including their modifications, are presented in the theoretical part of the thesis. We can solve these problems by using exact methods, heuristic and metaheuristic algorithms. In the theoretical part are described traveling salesman problem, traveling salesman problem with time windows, traveling salesman problem with multiple time windows and dynamic traveling salesman problem including possible ways of solution.

APA, Harvard, Vancouver, ISO, and other styles

7

Kivelevitch, Elad H. "Robust, Real Time, and Scalable Multi-Agent Task Allocation." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337007279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Pavlovič, Dávid. "Problém obchodního cestujícího s časovými okny." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-442819.

Full text

Abstract:

This thesis deals with the Travelling salesman problem with time windows. The problem is that the travelling salesman must pass through each defined location exactly once and finally return to the original place for the lowest possible price. The time windows in this problem are that each place can only be visited in a given time range, or it can happen that in a certain period of time there will be no path between some places. The thesis deals with an overview of this problem and problems similar to it. It also deals with the description of various methods by which this problem can be solved.

APA, Harvard, Vancouver, ISO, and other styles

9

Yuan, Yuan. "Modèles et Algorithmes pour les Problèmes de Livraison du Dernier Kilomètre avec Plusieurs Options d'Expédition." Thesis, Ecole centrale de Lille, 2019. http://www.theses.fr/2019ECLI0011.

Full text

Abstract:

Dans cette thèse, nous étudions les problèmes de tournées de véhicules dans le contexte de la livraison du dernier kilomètre lorsque plusieurs options de livraisons sont proposées aux clients. Le mode de livraison le plus commun est la livraison à domicile ou au travail. La livraison peut également être effectuée dans des points de collecte tels que des consignes ou des magasins. Ces dernières années, un nouveau concept appelé livraison dans le coffre / dans la voiture a été proposé. Avec ce mode de livraison, les colis des clients peuvent être livrés directement dans les coffres des voitures.

APA, Harvard, Vancouver, ISO, and other styles

10

Ružička, Vladimír. "Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236578.

Full text

Abstract:

This paper deals with optimal distribution issues. One may find listed problems of real life linked to distribution. Moreover, there are explained travelling salesman problem, vehicle routing problem and its variants. This work brings an overview of different ways how to solve vehicle routing problem. In practical part, there is an analysis of distribution of real company. The concept of application is presented in the second part of this paper. This concept could reduce costs of distribution in analyzed company. Testing is aimed mainly on the variant VRPCL (Vehicle Routing Problem with Contin

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Traveling Salesman Problem with Time-window"

1

Chun, Bock Jin. Algorithms and heuristics for time-window-constrained traveling salesman problems. 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Traveling Salesman Problem with Time-window"

1

Hameed, Ibrahim A. "Multi-objective Solution of Traveling Salesman Problem with Time." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14118-9_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Qin, Hu, Andrew Lim, and Dongsheng Xu. "The Selective Traveling Salesman Problem with Regular Working Time Windows." In Studies in Computational Intelligence. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-92814-0_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bar-Yehuda, Reuven, Guy Even, and Shimon Shahar. "On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows." In Algorithms - ESA 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39658-1_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Tüű-Szabó, Boldizsár, Péter Földesi, and László T. Kóczy. "Discrete Bacterial Memetic Evolutionary Algorithm for the Time Dependent Traveling Salesman Problem." In Communications in Computer and Information Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91473-2_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Boland, Natashia, Mike Hewitt, Duc Minh Vu, and Martin Savelsbergh. "Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks." In Integration of AI and OR Techniques in Constraint Programming. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59776-8_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tüű-Szabó, Boldizsár, Péter Földesi, and László T. Kóczy. "An Efficient New Memetic Method for the Traveling Salesman Problem with Time Windows." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69456-6_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Khachay, Michael, and Katherine Neznakhina. "Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73013-4_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Abeledo, Hernán, Ricardo Fukasawa, Artur Pessoa, and Eduardo Uchoa. "The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm." In Experimental Algorithms. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13193-6_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Yanyan, and Lixin Tang. "Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network." In Advances in Neural Networks – ISNN 2007. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72393-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Rimmel, Arpad, Fabien Teytaud, and Tristan Cazenave. "Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows." In Applications of Evolutionary Computation. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20520-0_51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Traveling Salesman Problem with Time-window"

1

Hurkała, Jarosław. "Time-Dependent Traveling Salesman Problem with Multiple Time Windows." In 2015 Federated Conference on Computer Science and Information Systems. PTI, 2015. http://dx.doi.org/10.15439/2015f311.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wu, Tengyu, and Lin He. "Online Traveling Salesman Problem With Per-Unit-Time Penalty." In 2019 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2019. http://dx.doi.org/10.1109/iesm45758.2019.8948215.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Rongkai, Anatolii Prokhorchuk, and Justin Dauwels. "Deep Reinforcement Learning for Traveling Salesman Problem with Time Windows and Rejections." In 2020 International Joint Conference on Neural Networks (IJCNN). IEEE, 2020. http://dx.doi.org/10.1109/ijcnn48605.2020.9207026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dokania, Shubham, Sunyam Bagga, and Rohit Sharma. "Opportunistic Self Organizing Migrating Algorithm for real-time Dynamic Traveling Salesman Problem." In 2017 51st Annual Conference on Information Sciences and Systems (CISS). IEEE, 2017. http://dx.doi.org/10.1109/ciss.2017.7926065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Stephens, Shawn S., Ramana V. Grandhi, and Donald L. Kunz. "Modified Nonlinear Traveling Salesman Problem with Delivery Time Windows and Item Constraints." In AIAA Scitech 2020 Forum. American Institute of Aeronautics and Astronautics, 2020. http://dx.doi.org/10.2514/6.2020-1088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Erdogdu, Kazim, and Korhan Karabulut. "Distance and Energy Consumption Minimization in Electric Traveling Salesman Problem with Time Windows." In 2020 7th International Conference on Electrical and Electronics Engineering (ICEEE). IEEE, 2020. http://dx.doi.org/10.1109/iceee49618.2020.9102602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Koczy, Laszlo T., Peter Foldesi, Boldizsar Tuu-Szabo, and Ruba Almahasneh. "Modeling of Fuzzy Rule-base Algorithm for the Time Dependent Traveling Salesman Problem." In 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2019. http://dx.doi.org/10.1109/fuzz-ieee.2019.8858853.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Neroni and Tebaldi. "A hybrid heuristic algorithm for solving the Traveling Salesman Problem with Time Windows." In The 20th International Conference on Modeling & Applied Simulation. CAL-TEK srl, 2021. http://dx.doi.org/10.46354/i3m.2021.mas.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Yokoyama, Soichiro, Ikuo Suzuki, Masahito Yamamoto, and Masashi Furukawa. "A New Heuristic for Traveling Salesman Problem Based on LCO." In ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7227.

Full text

Abstract:

The Traveling Salesman Problem (TSP) is one of the most well known combinatorial optimization problem and has wide range of application. Since the TSP is NP-hard, many heuristics for the TSP have been developed. This study proposes a new heuristic for the TSP based on one of these heuristics named Local Clustering Optimization (LCO). LCO is a metaheuristic proposed by Furukawa at el. to give an accurate solution for large scale problems in a reasonable time. However, conventional LCO-based heuristics for the TSP is not suited to solving asymmetric instances. The proposed method iteratively ado

APA, Harvard, Vancouver, ISO, and other styles

10

Hirogaki, Toshiki, Eiichi Aoyama, Keiji Ogawa, Naohide Hashimoto, and Mitsutaka Matsumura. "CAM Systems Based on Traveling Salesman Problem From Time Perspective for High Density Through-Hole Drilling." In ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems collocated with the ASME 2005 Heat Transfer Summer Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/ipack2005-73092.

Full text

Abstract:

This paper focuses on shortening drill-movement time in an X-Y plane. Traveling Salesman Problem (TSP) has been applied to determine a moving route of Printed Wiring Board (PWB) hole arrangements. Thus, some papers dealt with shortening the calculating time and increasing the accuracy of the TSP method to obtain the shortest route in geometrical problems. However, considering both the characteristics of PWB hole arrangements and the feed-control characteristics of machine tools, the shortest route for geometrical problems by TSP is not always in agreement with that of the moving time problem.

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!