Ch10_11 Routing to Reduce Travel and Workflow and Balance 仓储和配送 英文版讲解材料.pptVIP

;;Learning Objectives;Shortest Route Problem;Traveling Salesman Problem;TSP Model ;Results of the Traveling Salesman Tour;What if have two vehicles?;Two Optimal Routes w Capacity Constraint;So what about TSP for a warehouse?;Heuristics;Serpentine Example;Branch and Pick Example;Branch and Pick Alternatives;Branch and Pick Alternatives;Routing Heuristic;Example Problem for Routing Heuristic;Shortest Path Problem with 9 Nodes;1st Sub-problem: Aisle 1 to 2;2nd Sub-problem: Aisle 2 to 3;2nd Sub-problem: Aisle 2 to 3;2nd Sub-problem: Aisle 2 to 3;3rd Sub-problem: Aisle 3 to 4;3rd Sub-problem: Aisle 3 to 4;4th Sub-problem: Aisle 4 to End;Shortest Path;For any problem, the cross arcs will be the same The end arcs will change depending on the locations to visit;Can you find the shortest path for this?;How much is optimization worth?;Where is Optimal Routing most Beneficial?;;Learning Objectives;Self Organized Teams;Bucket Brigades in Action;Sample Flow Line;;;;Some Advantages of Bucket Brigades;Replacing Zones with Bucket Brigades;Distribution of Average Pick Rate;Bucket Brigades are most appropriate when