Premium
Exact optimal solutions of the minisum facility and transfer points location problems on a network
Author(s) -
Sasaki Mihiro,
Furuta Takehiro,
Suzuki Atsuo
Publication year - 2008
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2008.00602.x
Subject(s) - facility location problem , heuristics , transfer (computing) , 1 center problem , enumeration , mathematical optimization , computer science , location model , mathematics , operations research , combinatorics , parallel computing
We consider hierarchical facility location problems on a network called Multiple Location of Transfer Points (MLTP) and Facility and Transfer Points Location Problem (FTPLP), where q facilities and p transfer points are located and each customer goes to one of the facilities directly or via one of the transfer points. In FTPLP, we need to find an optimal location of both the facilities and the transfer points while the location of facilities is given in MLTP. Although good heuristics have been proposed for the minisum MLTP and FTPLP, no exact optimal solution has been tested due to the size of the problems. We show that the minisum MLTP can be formulated as a p ‐median problem, which leads to obtaining an optimal solution. We also present a new formulation of FTPLP and an enumeration‐based approach to solve the problems with a single facility.