The Discrete Ordered Median Problem with Induced Ordered (DOMP+IO) is a multi-facility
version of the classical discrete ordered median problem (DOMP), which has been widely studied. Several
exact methods have been proposed to solve the DOMP, however these methods could only solve
small-scale problems, which are far of real-life problems. In this work, a DOMP+IO with two kinds
of facilities is considered and a heuristic method is proposed for its solving. The proposed procedure
is based on a genetic algorithm and the preliminary results show the efficiency and capability to obtain
good solutions for large-scale problems.
