Integrating Minimum Spanning Tree and MILP in Urban Planning: A Novel Algorithmic Perspective

This paper presents a novel eight-step iterative algorithm for optimizing the layout of a neighborhood, focusing on the efficient allocation of houses to strategically placed facilities, herein referred to as ’points of interest’. The methodology integrates a mixed integer linear programming (MILP) approach with a heuristic algorithm to address a variant of the facility location problem combined with network design considerations. The algorithm begins by defining a set of geographic coordinates to represent houses within a predefined area. It then identifies key points of interest, forming the basis for subsequent connectivity and allocation analyses. The methodology’s core involves applying the Greedy algorithm to assign houses to the nearest points of interest, subject to capacity constraints. The method is followed by computing a Minimum Spanning Tree (MST) among these points to ensure efficient overall connectivity. The proposed algorithm’s iterative design is a key attribute. The most promising result of this approach is its ability to minimize the distance between houses and points of interest while optimizing the network’s total length. This dual optimization ensures a balanced distribution of houses and an efficient layout, making it particularly suitable for urban planning and infrastructure development. The paper’s findings demonstrate the algorithm’s effectiveness in creating a practical and efficient neighborhood layout, highlighting its potential application in large-scale urban planning and development projects.

This creative work has been published under the Creative Commons Attribution 4.0 International (CC-BY 4.0) license which allows copying, and redistribution as well as adaptation of the original work provided appropriate credit is given to the original author and the conditions of the license are met.