Relevant bibliographies by topics / Travelling salesman problem with time windows

Contents

  1. Journal articles

Academic literature on the topic 'Travelling salesman problem with time windows'

Author: Grafiati
Published: 28 June 2021
Last updated: 12 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 'Travelling salesman problem with time windows.'

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 "Travelling salesman problem with time windows"

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 evolved towards the direction of the optimal value of the fitness function. Novelty: There are a number of studies that considered tournament selection strategy but just a few have applied genetic algorithm considering insertion method to solve a Multiple Travelling salesman Problem. This study uses insertion method to obtain optimal solution. Also, the researcher considered time windows, transport cost, carbon emission cost and refrigeration cost. Keywords: Genetic algorithm method; cold-logistics; multiple travelling salesman problem
APA, Harvard, Vancouver, ISO, and other styles
2

López-Ibáñez, Manuel, and Christian Blum. "Beam-ACO for the travelling salesman problem with time windows." Computers & Operations Research 37, no. 9 (2010): 1570–83. http://dx.doi.org/10.1016/j.cor.2009.11.015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mladenovic, Nenad, Raca Todosijevic, and Dragan Urosevic. "An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows." Yugoslav Journal of Operations Research 23, no. 1 (2013): 19–30. http://dx.doi.org/10.2298/yjor120530015m.

Full text
Abstract:
General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems. However, its efficient implementation may play a significant role in solving large size instances. In this paper we suggest new GVNS heuristic for solving Travelling salesman problem with time windows. It uses different set of neighborhoods, new feasibility checking procedure and a more efficient data structure than the recent GVNS method that can be considered as a state-of-the-art heuristic. As a result, our GVNS is much faster and more effective than the previous GVNS. It is able to improve 14 out of 25 best known solutions for large test instances from the literature.
APA, Harvard, Vancouver, ISO, and other styles
4

Tae, Hyun-Chul, and Byung-In Kim. "Dynamic Programming Approach for Prize Colleting Travelling Salesman Problem with Time Windows." IE interfaces 24, no. 2 (2011): 112–18. http://dx.doi.org/10.7232/ieif.2011.24.2.112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ascheuer, Norbert, Matteo Fischetti, and Martin Grötschel. "Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut." Mathematical Programming 90, no. 3 (2001): 475–506. http://dx.doi.org/10.1007/pl00011432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

López-Ibáñez, Manuel, Christian Blum, Jeffrey W. Ohlmann, and Barrett W. Thomas. "The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization." Applied Soft Computing 13, no. 9 (2013): 3806–15. http://dx.doi.org/10.1016/j.asoc.2013.05.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cheng, Chi-Bin, and Chun-Pin Mao. "A modified ant colony system for solving the travelling salesman problem with time windows." Mathematical and Computer Modelling 46, no. 9-10 (2007): 1225–35. http://dx.doi.org/10.1016/j.mcm.2006.11.035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hill, Stephen E., and Marco Lam. "A teaching exercise for the travelling salesman problem with time windows using real-world data." International Journal of Information and Operations Management Education 5, no. 4 (2014): 363. http://dx.doi.org/10.1504/ijiome.2014.067566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Budak, Gerçek, and Xin Chen. "Evaluation of the size of time windows for the travelling salesman problem in delivery operations." Complex & Intelligent Systems 6, no. 3 (2020): 681–95. http://dx.doi.org/10.1007/s40747-020-00167-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Baltz, Andreas, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, and Anand Srivastav. "Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection." Journal of the Operational Research Society 66, no. 4 (2015): 615–26. http://dx.doi.org/10.1057/jors.2014.17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Travelling salesman problem with time windows' for particular source types:
Journal articles
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!

To the bibliography