In this online course we’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We still don’t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science. Still, we’ll implement several solutions for real world instances of the travelling salesman problem.
von
Delivery Problem
University of California San DiegoÃœber diesen Kurs
1.532 kürzliche Aufrufe
Flexible Fristen
Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.
Zertifikat zur Vorlage
Erhalten Sie nach Abschluss ein Zertifikat
100Â % online
Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.
Stufe „Anfänger“
Ca. 13 Stunden zum Abschließen
Englisch
Untertitel: Arabischer Raum, Französisch, Portugiesisch (europäisch), Italienisch, Vietnamesisch, Deutsch, Russisch, Englisch, Spanisch
Flexible Fristen
Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.
Zertifikat zur Vorlage
Erhalten Sie nach Abschluss ein Zertifikat
100Â % online
Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.
Stufe „Anfänger“
Ca. 13 Stunden zum Abschließen
Englisch
Untertitel: Arabischer Raum, Französisch, Portugiesisch (europäisch), Italienisch, Vietnamesisch, Deutsch, Russisch, Englisch, Spanisch
von
University of California San Diego
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
Lehrplan - Was Sie in diesem Kurs lernen werden
5 Stunden zum Abschließen
Traveling Salesman Problem
We start this module with the definition of mathematical model of the delivery problem — the classical traveling salesman problem (usually abbreviated as TSP). We'll then review just a few of its many applications: from straightforward ones (delivering goods, planning a trip) to less obvious ones (data storage and compression, genome assembly). After that, we will together take the first steps in implementing programs for TSP.
5 Stunden zum Abschließen
4 Videos (Gesamt 43 min), 1 Lektüre, 5 Quiz
4 Stunden zum Abschließen
Exact Algorithms
We'll see two general techniques applied to the traveling salesman problem. The first one, branch and bound, is a classical approach in combinatorial optimization that is used for various problems. It can be seen as an improvement of the brute force search: we try to construct a permutation piece by piece, but at each step we check whether it still makes sense to continue constructing the permutation (if it doesn't, we just cut off the current branch). The second one, dynamic programming, is arguably the most popular algorithmic technique. It solves a problem by going through a collection of smaller subproblems.
4 Stunden zum Abschließen
4 Videos (Gesamt 49 min)
4 Stunden zum Abschließen
Approximation Algorithms
As we've seen in the previous modules, solving the traveling salesman problem exactly is hard. In fact, we don't even expect an efficient solution in the nearest future. For this reason, it makes sense to ask: is it possible to find efficiently a solution that is probably suboptimal, but at the same time is close to optimal? It turns out that the answer is yes! We'll learn two algorithms. The first one guarantees to find quickly a solution which is at most twice longer than the optimal one. The second algorithms does not have such guarantees, but it is known to work pretty well in practice.
4 Stunden zum Abschließen
2 Videos (Gesamt 20 min)
Bewertungen
- 5 stars76,75Â %
- 4 stars17,92Â %
- 3 stars2,80Â %
- 2 stars2,24Â %
- 1 star0,28Â %
Top-Bewertungen von DELIVERY PROBLEM
von LA30. Okt. 2020
VERY GOOD COURSE IT IS SO BENTIFITIAL TO THE PEOLPLE WHO ARE INTERTESTED TO DEVELOP THE MATHEMATICAL SKILLS
von PH6. Juli 2018
Great way to end a really detailed and engaging specialization that introduces anyone with a minimum background in Python to Algorithms.
von AT19. Nov. 2019
A fun conclusion to the specialization that brings all of the mathematics of combinatorics and graph theory together to show how it can be applied to some real world problems.
von AA14. Aug. 2020
Thank you for such a wonderful specialization course!
Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Was bekomme ich, wenn ich das Zertifikat erwerbe?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Learner Help Center.
