A Total Covering Multi-Objective Hierarchical Location- Allocation Problem

In this paper, we present a hierarchical multi-objective model with capacitated facility to cover the total demands in a mixed-integer nonlinear programming (MINLP) model. In general models presented in location problems, only one type of facility should be located. As a system providing services/products usually consists of two or more levels of facilities, we discuss hierarchical facility systems. This paper aims to locate hierarchical facilities that minimize the total costs of transferring demands to facilities and creating new facilities. The capacity of the existing facilities is restricted, and all demand’s level of node should be covered. Public facilities are assumed with regard to distances are rectilinear. Furthermore, we have a ranking to exposure for each level’s facility in a candidate node that has a different utility to be maximized.

A Total Covering Multi-Objective Hierarchical Location- Allocation Problem Keywords:

Multi-objective model , Hierarchical Location-allocation , Total covering