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)...
Main Authors: | Wilson Pavon, Myriam Torres, Esteban Inga |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-01-01
|
Series: | Buildings |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-5309/14/1/213 |
Similar Items
-
PENENTUAN PENURUNAN TEGANGAN BERDASARKAN MINIMUM SPANNING TREE PADA JARINGAN LISTRIK DISTRIBUSI PRIMER
by: Hardianto Hardianto
Published: (2015-03-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2006-02-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2006-02-01) -
The Budgeted Labeled Minimum Spanning Tree Problem
by: Raffaele Cerulli, et al.
Published: (2024-01-01) -
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
by: Han-Suk Sohn, et al.
Published: (2007-02-01)