Jack is a salesperson for Alpine Products. He has his own territory with his house (office) situated approximately in the middle. He tries to visit each of his customer accounts about once every three weeks. Jack has been doing this by dividing his territory into five pie shaped areas, with the point of each touching his house. On Mondays he visits a third of the accounts in one wedge, on Tuesdays he visits a third of the accounts in a second wedge, and so on. Below is a map of his Wednesday wedge showing the distance in miles between each of his customer accounts.
For the past two weeks, Jack has been on vacation with his family, so all of his accounts should be visited as soon as possible. Unfortunately, his car broke down near the end of his vacation and is now in the shop. The good news is that he has a second vehicle that he can use for today - the only electric car in the county. The bad news is that this car can only go a little over 60 miles between charges.
The recharge time for this car is six hours, so it is not feasible to attempt a recharge while on the road. Although the car can usually go a little over 60 miles on a single charge, Jack is unwilling to take any chances of getting stuck and will not risk driving more than 60 miles. He therefore wants to plan his route today so that he can visit the most customers in 60 miles or less. How should Jack route his sales calls for today? Be sure that Jack is able to return to his home office in 60 miles or less so that he can recharge his car.
Recall: closest-next and largest-angle heuristics - use both.