Delivery Problem

  • 4.7
Approx. 14 hours to complete

Course Summary

Learn how to solve delivery problems in supply chain management with this course. Get insights on managing inventory, transportation, and warehousing to improve your delivery services.

Key Learning Points

  • Discover the root causes of delivery problems in supply chain management
  • Explore best practices in inventory management, transportation, and warehousing
  • Learn how to apply data analytics and technology to optimize delivery services

Related Topics for further study


Learning Outcomes

  • Identify and solve delivery problems in supply chain management
  • Implement best practices in inventory management, transportation, and warehousing
  • Utilize data analytics and technology to optimize delivery services

Prerequisites or good to have knowledge before taking this course

  • Basic understanding of supply chain management
  • Familiarity with inventory management and transportation concepts

Course Difficulty Level

Intermediate

Course Format

  • Self-paced
  • Online
  • Video lectures
  • Case studies

Similar Courses

  • Supply Chain Fundamentals
  • Logistics and Transportation
  • Operations Management

Related Education Paths


Related Books

Description

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. While designing these solutions, we will rely heavily on the material learned in the courses of the specialization: proof techniques, combinatorics, probability, graph theory. We’ll see several examples of using discrete mathematics ideas to get more and more efficient solutions.

Outline

  • Traveling Salesman Problem
  • Delivery Problem
  • Shortest Common Superstring Problem
  • Brute Force Search
  • Nearest Neighbor
  • Additional Materials
  • Puzzle: Delivery Problem
  • Cycle Weight
  • Brute Force Algorithm
  • Average Weight
  • Nearest Neighbors
  • Exact Algorithms
  • Branch and Bound
  • Dynamic Programming: Main Ideas
  • Dynamic Programming: Representing Subsets
  • Dynamic Programming: Code
  • Branch and Bound
  • Dynamic Programming
  • Approximation Algorithms
  • Approximation Algorithms
  • Local Search
  • 2-Approximation

Summary of User Reviews

The Delivery Problem course on Coursera has received positive reviews from users, who praise its practical approach and engaging content. Many users found the course helpful in improving their problem-solving skills.

Key Aspect Users Liked About This Course

Practical approach and engaging content

Pros from User Reviews

  • Course content is relevant and practical
  • Instructors are knowledgeable and engaging
  • Assignments and quizzes help reinforce understanding
  • Flexible schedule allows for self-paced learning

Cons from User Reviews

  • Some users felt that the course could benefit from more detailed explanations
  • Course materials could be more organized
  • Occasional technical issues with the platform
  • Limited interaction with other students
English
Available now
Approx. 14 hours to complete
Alexander S. Kulikov
University of California San Diego, HSE University
Coursera

Instructor

Alexander S. Kulikov

  • 4.7 Raiting
Share
Saved Course list
Cancel
Get Course Update
Computer Courses