Delivery routes
Optimise a small vehicle fleet’s routes with a heuristic and measure the gap to the optimum.
All pathsDiscover Coursera PlusAfter step 2 After step 3 After step 4
Physics & maths · 36Intermediate
Operations Research & Optimisation
Engineers in logistics, planning or decision support.
Linear algebra, Stanford algorithms, linear programming and approximation algorithms, then decision-making under uncertainty.
349hours of coursework
35weeks at 10 h
4steps
16courses
4universities
Target skills
AlgorithmsGraph TheoryData StructuresMathematical ModelingAlgebraGeometryLinear AlgebraApplied MathematicsMarkov ModelBioinformaticsSocial Network AnalysisProbability
Skill labels as listed on Coursera.
Target jobs
- Operations research engineer
- Supply chain analyst
- Planning engineer
Progression
- 1Johns Hopkins UniversityBeginner
Stated prerequisites: Basic algebra (no calculus)
Show the 3 courses
Course Level Length Rating (reviews) Linear Algebra: Linear Systems and Matrix Equations Beginner 10 h 4.7 (183) Linear Algebra: Matrix Algebra, Determinants, & Eigenvectors — 15 h 4.8 (79) Linear Algebra: Orthogonality and Diagonalization Intermediate 9 h 4.8 (56) - 2Stanford University (Stanford Online)IntermediateC, Java, Python
Stated prerequisites: Programming in at least one language (C, Java or Python); familiarity with proofs (induction, contradiction); discrete probability
Show the 4 courses
Course Level Length Rating (reviews) Divide and Conquer, Sorting and Searching, and Randomized Algorithms Intermediate 15 h 4.8 (5,342) Graph Search, Shortest Paths, and Data Structures Intermediate 14 h 4.8 (2,002) Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Intermediate 15 h 4.8 (1,279) Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Intermediate 13 h 4.8 (832) - 3University of Colorado BoulderAdvancedPythonacademic credit
Stated prerequisites: Some background in calculus, probability theory and Python programming
Show the 5 courses
Course Level Length Rating (reviews) Algorithms for Searching, Sorting, and Indexing Intermediate 36 h 4.7 (544) Trees and Graphs: Basics Advanced 34 h 4.6 (194) Dynamic Programming, Greedy Algorithms Advanced 38 h 4.7 (282) Approximation Algorithms and Linear Programming Advanced 46 h 4.8 (67) Advanced Data Structures, RSA and Quantum Algorithms Advanced 45 h 4.6 (70) - 4University of MichiganIntermediateGenerative AI tools
Stated prerequisites: None stated (no coding required)
Show the 4 courses
Course Level Length Rating (reviews) Model Thinking Intermediate 28 h 4.8 (2,265) Problem Solving Using Computational Thinking Beginner 12 h 4.6 (1,313) Mindware: Critical Thinking for the Information Age Beginner 13 h 4.8 (1,453) Leveraging GenAI to Develop Critical Thinking Skills Beginner 6 h 4.3 (11)
With Coursera Plus
This path takes 349 hours, about 8 months at 10 hours a week. A Coursera Plus subscription gives access to most of its courses during that time.
Projects to build
Linear program
Model a constrained production problem and solve it with an open-source solver.
Decision under uncertainty
Choose a stock level under random demand and compare several decision rules.
Free textbooks
Introduction to Applied Linear Algebra (VMLS)S. Boyd, L. VandenbergheFree PDF
AlgorithmsJeff EricksonFree, CC BY 4.0
OpenIntro StatisticsD. Diez, M. Çetinkaya-Rundel, C. BarrFree PDF