Yahoo Suche Web Suche

Anmelden

Suchergebnisse

  1. Suchergebnisse:

  1. www.fernuni-hagen.de › bwlquam › studiumDie Lösung des Rundreiseproblems - FernUniversität in Hagen

    10. Mai 2024 · Das Problem der Bestimmung einer Rundreise minimaler Länge bezeichnet man als Traveling-Salesman-Problem (TSP). Domschke, W., A. Drexl, R. Klein und A. Scholl: Einführung in Operations Research (9. Aufl., Springer Gabler, 2015). JavaScript-Applikation zum Verfahren »Nächster Nachbar« und »A*«

  2. Videos

    Alle anzeigen

  3. www.geeksforgeeks.org › traveling-salesman-problem-tsp-in-pythonTraveling Salesman Problem (TSP) in Python - GeeksforGeeks

    31. Mai 2024 · The Traveling Salesman Problem (TSP) is a classic algorithmic problem in the fields of computer science and operations research. It involves finding the shortest possible route that visits a set of cities and returns to the origin city. The challenge of TSP lies in its NP-hard nature, meaning that as the number of cities increases, the problem ...

  4. www.britannica.com › science › traveling-salesman-problemTraveling salesman problem | Solution: NP-hard, Optimization ...

    20. Mai 2024 · Learn about the traveling salesman problem, a graph theory optimization problem that involves finding the shortest path among a set of cities. Explore its history, complexity, and applications in mathematics and computer science.

  5. onexception.dev › news › 1281341Fixed Values vs. Increasing Values in Variables: TSP Problem with...

    Vor 5 Tagen · Traveling Salesman Problem (TSP) The Traveling Salesman Problem (TSP) is a classic algorithmic problem in the field of computer science and operations research. It focuses on optimization. In this problem, a salesman is given a list of cities, and must determine the shortest possible route that allows him to visit each city once and return to ...

  6. www.sciencedirect.com › science › articleThe bipartite travelling salesman problem: A ... - ScienceDirect

    27. Mai 2024 · Given k blue cities, k red cities and a 2 k × 2 k distance matrix, the task in the bipartite travelling salesman problem is to find a shortest tour which alternately visits blue and red cities.

  7. link.springer.com › chapter › 10Pseudogeometric Version of the Traveling Salesman Problem ... -...

    24. Mai 2024 · The Traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points (or cities) and returns to the starting point. The TSP can be formulated in different ways, depending on the problem instance [ 1 , 2 , 3 , 4 , 5 ].

  8. dl.acm.org › doi › 10Unsupervised learning for solving the travelling salesman problem...

    30. Mai 2024 · An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University, pages 24-50, 2017. Google Scholar; Chaitanya K Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent. Learning the travelling salesperson problem requires rethinking generalization.