A penalty based heuristic algorithm for solving bi-objective fire station location problem

This paper deals with problem of allocating and determining the count of places within collection of prospective fire station locations in order to group the regions surrounding them while attaining two objectives ie. minimization of cost and duration with respect to given constraints. One constraint is to assign a unique site for every area that has been deliberately chosen for the purpose of setting one up and became the possible location whereon the allocation has to made. It is also agreed on the maximum areas that may be correspond to different fire stations. The two aim functions are to minimize the overall operating cost as well as the time required to cover the regions covered by the fire stations that have been selected. The proposed penalty based heuristic approach is utilised to determine a group of efficient solutions with respect to constraints. This can be a good alternative for decision makers for making facilities allocation related decisions.