The town where you live -town \"b\"- and a group of 10 other towns connected by

Question

The town where you live -town "b"- and a group of 10 other towns connected by a road network (see Figure below), had agreed to build a maximum of 4 fire stations at certain locations (building on a road link is not allowable, you must build at a Town). They wish to make sure that at least 1 fire truck can reach every town in no more than 15 minutes (travel lime in minutes is shown in the arcs -half circles- in the Figure); they also want to maximize coverage, such that in the event of a large fire they can get assistance from several fire units, actually as many as possible. Formulate the objective and constraints (all of them, exhaustively, don't use condensed formulation) and solve the problem using any method. [5 marks]

Explanation / Answer

i hv not used any algorithm bt on the basis of shortest distance path and maximun coverage this is my idea:

the following should be made the 4 fire stations:

5-it covers mainly 3(6 min), b(7 min), 9(2 min),6(3 min),8(7 min)

1-it covers mainy 2(5 min)

10-it covers mainly 7(9min)

and 4

so these are 4 stations spread along the plan

now station 1 can get assistance from 5 and 4.....

and 10 can get assistance from 5 and 4

so basically all the constraints are fulfilled

i hope this plan would help..

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.