This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall 09 Homework 1 Homework 1: TSP Due date: 4:00pm on Wednesday, September 9, 2009 in the ENGRI 1101 box at the west end of the corridor on the second floor of Rhodes Hall, where it connects to Upson. Reading assignment: Handout 2 on the traveling salesman problem. Make sure to put your name on the first page and staple the problems in order. This homework will be entirely about the following problem. Your employer maintains an extremely large warehouse of inventory. The warehouse is configured as a grid - there are 31 very long aisles, broken into 10 equal length stretches, by cross aisles that allow you to connect from any aisle to another without needing to go to the end of an aisle. Each day you are assigned to verify the current inventory level of a specific subset of the shelves in the warehouse, to be sure that the actual stock present agrees with the total recorded in the computer database. Thus, you might be told to check aisle 11 going from cross-aisle 6 to cross-aisle 9 or to check aisle 22 going from cross-aisle 7 to cross-aisle 4. (The traffic protocol in the warehouse is that the aisles are one-way - all traffic in odd aisles must go from lower numbered cross-aisles to higher ones, and all traffic in even aisles must go from higher numbered cross-aisles to lower ones. Traffic in cross-aisles is two-way.) The aisles are numbered from 0 to 30, and the cross-aisles are numbered from 0in cross-aisles is two-way....
View Full Document
- Fall '09
- Operations Research, optimal solution, Travelling salesman problem, Function problem