ISE 316 • Computer Applications for Industrial Engineers • Midterm

What is Shortest Path Problem?

Terminology

Dijkstra's Algorithm

Djikstra's Algorithm Example 1

Djikstra's Algorithm Example 2

Problem Definition

Solving Problem

Enumeration

Example 1

Nearest Neighbor Algorithm

Example 2

Example 3

Example 4

Example 5

Savings Matrix

Savings Heuristic

Example 1

Example 2

Two-Opt Swap

Important Note on Two-Opt Swaps

Two-Opt Heuristic

Example 3

Example 4

Mathematical Modelling

Example 1

Miller-Tucker-Zemlin

Example 2

Example 3

Dantzig-Fulkerson-Johnson

Example 4

Example 5

Problem Definition

Solution Space of VRP

Example 1

Solving Problem

Cluster-First Route-Second (CFRS)

Example 2

Example 3

Route-First Cluster-Second (RFCS)

Example 4

Example 5

Inter-Route Swap Operation

A Side Note on Inter-Route Swaps

Example 6

Part 1

Part 2

Shortest Path Problems 1

Shortest Path Problems 2

Shortest Path Problems 3

Travelling Salesman Problem 1

Travelling Salesman Problem 2

Travelling Salesman Problem 3

Travelling Salesman Problem 4

Travelling Salesman Problem 5

Travelling Salesman Problem 6

Travelling Salesman Problem 7

Travelling Salesman Problem 8

Travelling Salesman Problem 9

Travelling Salesman Problem 9

Travelling Salesman Problem 10

Travelling Salesman Problem 11

Travelling Salesman Problem 12

Vehicle Routing Problem 1

Vehicle Routing Problem 2

Vehicle Routing Problem 3

Vehicle Routing Problem 4

Vehicle Routing Problem 5