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 Spring ’11 Homework 1 Homework 1: TSP • Due date: 2:00pm on Friday, February 4, 2011 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. • Your name, netID, and assignment number should be written clearly and boxed at the upperright corner of your write up, and problems should be stapled together in order. ( This will be worth 5 bonus points per assignment, on an allornothing scale. ) This homework will be entirely about the following problem. After graduating from Cornell, you’ve decided to make use of your excellent biking skills you acquired riding around Ithaca hills, and become a bicycle messenger in Manhattan. Fortunately, you’ve taken ENGRI 1101, and are a much more efficient messenger than your competition. For simplicity, we will view your service area in Manhattan as a giant grid of street and avenue blocks; the avenues will be assumed to run from 0th Avenue to 10th Avenue, and the perpendicular streets will run from 0th Street to 30th Street. Thus every avenuestreet intersection can be expressed as a pair ( x,y ) , which refers to the corner of x th Ave. and y th St.; thus, the grid of intersection points contains the points bracketed by the rectangle with corner points (0 , 0) , (0 , 30) , (10 , 30) , and (10 , 0) ....
View
Full Document
 Fall '09
 TROTTER
 Operations Research, optimal solution, Travelling salesman problem, salesman problem, Function problem

Click to edit the document details