Motivated by the recent rise in need for refugee camps, we address one of the key infrastructural problems in the establishment process: The clean water network design problem. We formulate the problem as a biobjective integer programming problem and determine the locations of the water source, water distribution units and the overall network design (pipelines), considering the objectives of minimizing cost (total network length) and maximizing accessibility (total walking distance) simultaneously. We solve the resulting model using exact and heuristic approaches that find the set (or a subset) of Pareto solutions and a set of approximate Pareto solutions, respectively. We demonstrate the applicability of our approach on a real-life problem in Gaziantep refugee camp and provide a detailed comparison of the solution approaches. The novel biobjective approach we propose will help the decision makers to make more informed design decisions in refugee camps, considering the trade-off between the two key criteria of cost and accessibility.

受近期难民营需求增加的推动，我们解决了建立过程中的关键基础设施问题之一：清洁水网络设计问题。我们将此问题表述为双目标整数规划问题，并考虑到最小化成本（总网络长度）和最大化可及性（总步行距离）的目标，确定水源，水分配单元和整体网络设计（管道）的位置同时。我们使用精确和启发式方法求解结果模型，分别找到一组Pareto解（或子集）和一组近似Pareto解。我们展示了我们的方法在加济安泰普难民营中的现实生活中的适用性，并提供了解决方案的详细比较。