Postman Problem: Max 10 Delivering to 19 Houses

  • Thread starter lilhaz
  • Start date
So, in summary, the maximum number of days the postman can deliver without repeating the pattern is 18 days.
  • #1
lilhaz
2
0
Suppose there's a single terraced street that contains 19 houses. The postman notices that no 2 adjacent houses ever receive mail on the same day, and that no more than 2 adjacent houses don't receive mail on any day. What is the maximum number of days he can deliver before repeating the pattern?



The Attempt at a Solution


well, there are a maximum of 10 deliveries he can make, starting at house 1 then missing a house and delivering to house 3 etc. And he can make a minimum of 6 deliveries
There is only 1 way to deliver to 10 houses, but after that my methods start to fall apart! anyone got any insight that can help?
 
Physics news on Phys.org
  • #2
The maximum number of days he can deliver before repeating the pattern is 18 days. On the first day, he can deliver to houses 1, 3, 5, 7, 9, 11, 13, 15, 17, and 19. On the second day, he can deliver to houses 2, 4, 6, 8, 10, 12, 14, 16, and 18. After this, he can repeat the pattern.
 

1. What is the Postman Problem?

The Postman Problem, also known as the Chinese Postman Problem, is a mathematical problem that involves finding the shortest route for a postman to deliver mail to every house in a given area while also traversing each street at least once.

2. How many houses can the postman deliver to in the "Max 10 Delivering to 19 Houses" scenario?

In this scenario, the postman can deliver to a maximum of 10 houses out of the 19 houses in the area. This means that some houses will not receive mail from the postman.

3. What is the goal of the Postman Problem?

The goal of the Postman Problem is to find the shortest possible route for the postman to deliver mail to every house in the given area. This ensures that the postman can complete their delivery in the most efficient and cost-effective manner.

4. Why is the Postman Problem important?

The Postman Problem has practical applications in real-life situations such as mail delivery, garbage collection, and snow plowing. It also serves as a useful problem in graph theory and computational complexity studies.

5. What are some strategies for solving the Postman Problem?

Some strategies for solving the Postman Problem include finding a minimum spanning tree, using the nearest neighbor algorithm, or applying dynamic programming techniques. These strategies aim to find the most efficient route for the postman to deliver mail to every house in the given area.

Similar threads

Replies
2
Views
2K
  • STEM Career Guidance
Replies
13
Views
3K
  • Introductory Physics Homework Help
Replies
14
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Thermodynamics
Replies
7
Views
1K
  • DIY Projects
Replies
23
Views
4K
  • Biology and Medical
9
Replies
287
Views
19K
  • Other Physics Topics
Replies
1
Views
2K
  • Feedback and Announcements
Replies
21
Views
2K
  • Art, Music, History, and Linguistics
Replies
1
Views
835
Back
Top