Developing a Bi-Level Optimization Model for the Coupled Street Network and Land Subdivision Design Problem with Various Lot Areas in Irregular Blocks

Abstract

Street design and land subdivision are significant tasks in the development and redevelopment planning process. Optimizing street and land subdivision layouts within a unified framework to achieve solutions that meet a set of objectives and constraints (e.g., minimizing parcel area deviation from standard values, minimizing land consumption for street construction, etc.) is a critical concern for planners, particularly in complex contexts such as blocks with irregular shapes and parcels of varying sizes and requirements. To address this challenge, a mathematical formulation is presented for the bi-level street network and land subdivision optimization problem. Subsequently, the solution procedure is outlined, which utilizes a genetic-based algorithm for street design and a memetic–genetic-based algorithm for land subdivision. Finally, two cases are presented, solved, and discussed to analyze and verify the proposed mathematical model and solution procedures. The results suggest that the formulated problem is suitable for addressing the coupled street network and land subdivision design problem, and it can be adapted and extended to other case studies. Additionally, the introduced ideas and algorithms satisfactorily solved the stated problem.

1. Introduction

Land subdivision, fragmentation, or partitioning refers to splitting an area into several smaller parcels (also called lots), which has been applied in a wide range of planning practices (e.g., land consolidation [1], agricultural or urban land readjustment [2], urban growth simulation [3], and land subdivision impact analysis before implementation [4]).

In the land subdivision process, planners assign the size and area of a parcel regarding several indicators [5] (e.g., access to the road network, minimum length of sides, etc.). If the area under consideration is small, the geometry is simple (e.g., a perfect rectangle), and the number of contributing factors is limited (e.g., the average size of parcels is equal, and only the elongation of the parcels matters), land subdivision can be performed manually. However, in cases where the size of the problem is not small, the geometry of the area is not simple, and the contributing indices are not limited to one or two items with constant values, planners can no longer adopt manual procedures and require a tool to facilitate addressing the land subdivision problem.

In general, such tools are not replacements for the planners because the land subdivision is an intricate issue and needs the judgment of experts, at least at the final stages, to choose, rectify, or check the qualitative aspects of the layout(s) generated by computational methods. In other words, the end of these tools and techniques is to produce acceptable subdivision layout(s) in line with the planners’ concerns and to support analysts by providing reasonable solution(s) as a base for adding complementary details. Therefore, several pieces of research attempted to develop automated methods to tackle the land subdivision problem.

As a triggering study, Buis and Vingerhoeds [6] used expert systems and geographic information systems (GISs) to create a subdivision module. The introduced module was semi-automated and dependent on the participation of the planner during the model implementation. In addition, the subdivision problem did not follow the optimization structure, which did not necessarily lead to the optimal solution(s). Parish and Müller [7] proposed an approach for modeling street growth and land subdivision through a recursive algorithm dividing the longest pair of parallel edges until the size of the parcels meets a pre-defined threshold. However, this algorithm might generate empty areas inside the blocks that are not justifiable in actual cases. In addition, the algorithm discards the parcels without access to the street network, even if by applying a repairing strategy the resulting solution can be more satisfactory in terms of shape and other indices. Touriño et al. [8] developed a region-growing algorithm and an optimization method for addressing the land partitioning problem in a raster-based GIS. Although this study considers an optimization method, the solution process is limited to the raster environment, which does not represent the geographical areas in the vector-based format that is closer to spatial environments. Moreover, if the raster resolution changes, some lands may be disregarded in the subdivision layout. Halatsch et al. [9] and Marshall [10] used automatic methods for the land subdivision, but their studies were limited to formic controls.

Applying computer graphics, Vanegas et al. [11] and Vanegas et al. [12] developed a tool for coupling geometrical with behavioral modeling. The technique worked based on the recursive binary algorithm and produced streets and parcels close to the real contexts. However, the solution procedure performs well for rectangular- or square-shaped parcels. In addition, the final solution might contain lots without accessibility to the streets. Vanegas et al. [13] established an interactive environment for the procedural generation of land parcels based on skeleton and bounding box algorithms. This interactive environment integrated with the two subdivision algorithms improved the previous studies and resulted in well-ordered land parcels. Furthermore, these methods are fruitful and appropriate options if three conditions are applied: (1) the geometry of the area under consideration provides a relatively uniform depth for the back-to-back subdivision, (2) the area of the required parcels is not highly varied, and (3) the area constraint supports a safe margin that accepts the small- and large-size parcels obtained at the end of the calculation process. It should be noted that such ideas have been implemented in ArcGIS City Engine [14] and improved by Colomb et al. [15].

As well as the research in computer graphics, Wickramasuriya et al. [16] established a tool for land subdivision. This tool partitions regular and irregular parcels so that the subdivision process leads to a layout with the highest land parcels and the lowest streets. Dahal and Chow [17] introduced a toolset for performing the land subdivision task. This toolset attempts to generate streets and land parcels like real-world contexts by applying a few parameters. These two indicated tools are applicable when the areas of lots follow an identical size, and the planner sets the subdivision’s length and width. However, if the size of the parcels considerably varies, and the planner cannot propose a fixed length or width for all parcels in a study area, these methods might produce layouts incompatible with the imposed area constraints.

This way, to include the effect of size variation in the land subdivision process, Demetriou et al. [18] and Demetriou, See, and Stillwell [2] formulated the land subdivision using the structure of the optimization problem statement presented in the literature on operation research (for example, see [19]). The solution procedure generates and improves parcels employing the Voronoi diagram to find a layout with optimum shape, land value, size, and accessibility to the road network surrounding the area considered for land subdivision. Nonetheless, this model does not create the street layout since it is not linked with a street design module. Moreover, in the final solution, lots might be distributed everywhere in the subdivision area because points representing parcels are free to be located everywhere throughout the search space. To this extent, although the final solution might satisfy size constraints, it might not fulfill the planner’s preferences for the subdivision layout arrangement. Also, the procedures proposed for generating new answers might lead to unsatisfactory parcels in the irregular blocks.

In addition to the mentioned studies, Haklı et al. [20] introduced a land partitioning model based on the binary search algorithm and Delaunay triangulation to determine the location of parcels within a block, with shape, size, value, and access as the partitioning objectives. Koc et al. [21] applied a binary search algorithm to automate the parceling task in urban zones given edge, area, or both. These pieces of research aimed to find the arrangement of parcels in a fashion that the parcels cover the given boundary or boundaries without the need for intervention in the boundaries’ structures by creating streets. These models perform parceling on the ribbon-shaped blocks that have a depth value. If the main block has a width longer than the pre-defined depth and supports the creation of two back-to-back subdivisions, the main block is decomposed into two ribbon-shaped blocks. Then, the binary search divides the decomposed blocks into parcels satisfying parcel area constraints. However, if the width of the main block permits the generation of three or more ribbon-shaped areas, the output layout might include inaccessible parcels, unless the main block is turned into parts manually, and the parts are subjected to the subdivision implementation separately. As well as these two studies on land consolidation and urban zoning segmentation, Kucukmehmetoglu and Geymen [22] and Koc et al. [23] presented optimization models for land readjustment and reallocation, where parcels are distributed within blocks so that at least one side of each is facing toward the streets around the blocks.

Despite the satisfactory results of these optimization models and solution methods for land reallocation purposes, these frameworks do not enclose a street design module. This means that if the constraint of access to the block’s peripheral streets is relaxed, these methods might not result in optimal solutions. In other words, if the internal streets can be designed to connect the allocated parcels to the peripheral roads, these algorithms discard layouts that might be optimal during the solution process.

Building upon the indicated literature, there is still room in the body of existing knowledge for developing land subdivision models that can (1) divide blocks with geometries that do not necessarily support a pre-defined subdivision depth value, (2) handle subdivision problems with variations in parcel size, (3) maintain the distribution of parcels in a structure that meets the planner’s requirements, and (4) embed the street design process within the solution procedure to provide internal streets (whether pedestrian or non-pedestrian) for subdivision layouts with inaccessible parcels.

In other words, in irregular blocks and cases with varying parcel areas, procedural operations (e.g., back-to-back or bounding box methods [7,24]) may not satisfy planning requirements such as parcel shape characteristics and parcel distribution within the blocks. Additionally, the indicated methods and processes do not contain a street design module (e.g., the algorithm proposed by Demetriou, See, and Stillwell [2] or the straight skeleton process [13]) or use an operation to provide accessibility in an intuitive or template-based manner (e.g., the bounding box method [7,24] and template-oriented algorithm [17,25]), which may not result in optimal layouts, especially in irregular blocks that should include parcels with varying areas.

Considering all these points, a flexible framework is required—one that is adaptable to blocks with complex geometries, able to handle parcel size variations, and capable of generating solutions that align with planner preferences. This framework should integrate optimization-based land subdivision and street design modules to manage land resources more effectively and rationally.

Thus, this article attempts to fulfill the following objectives: (1) conceptualizing a bi-level system of equations that couples the land subdivision and street design processes and can be modified based on the planner’s and planning requirements, and (2) presenting ideas for solving the elaborated equations. Consequently, this research contributes to the literature on spatial planning and computational geography by (1) developing a flexible bi-level optimization model that embeds a street design unit within the land subdivision problem able to represent alternatives regarding the planning concepts, (2) adapting a memetic–genetic algorithm and operators compatible with the structure of the formulated problem, and (3) evaluating the problem and solution method in some representative.

The rest of this article is structured as follows: Section 2 introduces the bi-level optimization framework, solution algorithm, and case studies. Section 3 presents solution algorithm parameters and outputs. Section 4 discusses problem formulation, the solution method, and results, followed by concluding remarks.

2. Materials and Methods

In this section, the problem formulation and solution algorithm are explained. First, the coupled land subdivision and street design (CLSSD) problem is stated. Second, the solution procedure is given. Finally, cases for model implementation and the data under consideration are presented.

2.1. Coupled Land Subdivision and Street Design Problem Formulation

2.1.1. Modeling Context

Let $b$ be a block given to a planner for land partitioning. $b$ is surrounded by street $s$, and a set of access points, $c\in C$, is designated on $s$ to provide the enter and exit spots for connections from inside $b$ to $s$ and vice versa if inaccessible parcels exist in the subdivision layout. Each parcel $p\in P$ has attributes $a_p$ and ${\acute{a}}_p$ ($a_p>{\acute{a}}_p$), where the former is the required area for parcel $p$, and the latter is the amount of the area of $p$ that can be consumed with the internal streets. Each parcel is modeled by the tuple $\left(x_p.y_p\right)$ that shows the coordinate of $p$ in the subdivision space. Coordinates of parcels ($p\in P$) in$b$ are determined by the function $f\left(P,L,b\right)$, where $L$ is a set of reference lines inside $b$, and $f$ generates coordinates for each $p\in P$ such that $p$ falls within $b$, $p$ is located on one of the reference lines in $L$, and no pair of $p$ has similar coordinates. Reference lines in $L$ illustrate the preferences of the planner for the arrangement of the parcels in $b$ based on his/her conceptual subdivision plan. The reference lines set the direction and number of rows for the subdivision layout, and their place might change during the optimization process.

Given the parcels’ arrangement $F=f\left(P,L,b\right)$, the subdivision layout is obtained by the calculation of the Voronoi diagram of $F$ denoted by $\Lambda \left(F\right)$. The output of $\Lambda \left(F\right)$ represented by $\Psi$ is the extent of parcels denoted by ${ext}_p$ and $\bigcup _{p\in P}{ext}_p=b$. ${ext}_p$ is specified by a set of vertices, $V_p$, each element of which is a point with longitude and latitude. In $\Psi$, parcel $p$ is called inaccessible if ${\forall }_{side}\in {ext}_p, acc\left(side,s\right)=0$, where $acc\left(side,s\right)=0$ if $side$ is not toward $s$, and $acc\left(side,s\right)=1$ otherwise.

Following the computation of $\Psi$, if there is at least one inaccessible extent in the subdivision layout, connection points are created corresponding to each inaccessible extent. The connection points are created through the application of rules $r\in R$ defined by the planner on the inaccessible extents in $\Psi$ by using the function $h\left(\Psi ,R\right)$. In short, this function outputs set $H$ containing the connection point coordinates for each inaccessible extent. For example, assume that $p=1$ is an inaccessible parcel in $\Psi$ and ${ext}_1$ has four sides (i.e., $\left|{ext}_1\right|=4$). If only one rule is considered (i.e., $\left|R\right|=1$), and $r=1$, then the inaccessible parcels can be connected to the access points in $C$ through the mid-points of their constituting sides; after the implementation of $h\left(\Psi ,r=1\right)$, four connection points are constituted in the middle of each side of ${ext}_1$, and for $p=1$, four coordinates are stored in $H$.

After the calculation of $H$ and $\Psi$ and having $C$, a network corresponding to the subdivision layout can be built. This network, $G$, is represented by a set of nodes and a set of links denoted by $N$ and $M$, respectively. $N$ is the union of $V_p$s in $\Psi$, $H$, and $C$ (i.e., $N=\left(\bigcup _{p\in P}{V}_p\right)\cup H\cup C$). $M$ is the intersection between the nodes in $N$ and the union of sides created for the extents in $\Psi$ (i.e., $Intersection\left(\left(\bigcup _{p\in P}side\in {ext}_p\right),N\right)$). Figure 1 illustrates a subdivision context and its corresponding network, including the indicated characteristics.

Figure 1. (a) Subdivision context: The thick black line is the boundary of block $b$. The thin black line is the boundary of street $s$ surrounding $b$. Red lines are the subdivision reference lines. Black points with the circle symbol represent parcels, and the parcel with identifier $p=1$ is inaccessible. Green lines are the results of calculating the Voronoi diagram for $f(P,L,b)$. Purple points with the square symbol are access points. Blue points with the triangle symbol are the connection points for the inaccessible parcel $p=1$, after the implementation of the mid-point rule ($r=1$) through the application of function $h$. This way, $p=1$ has four members in $H$, the output of $h$. Orange points with the circle symbol are vertices for exemplary parcel $p=2$ ($V_2$). And the green shaded area is the extent of $p=2$ (${ext}_2$). (b) Corresponding network to the subdivision context. Circles are nodes, and lines are links.

2.1.2. Optimization Problem

Regarding the modeling context mentioned in the previous section, the general CLSSD can be formulated as a bi-level optimization problem. The upper (or leader) level represents the subdivision layout optimization, and the lower (or follower) level models the street design optimization given a subdivision layout. This problem mainly includes two decision variables: (a) the location of parcels (i.e., $p=\left(x_p,y_p\right)$), and (2) links in the designed streets, $x_{q\acute{q}}$, where $q,\acute{q}\in N$, and $x_{q\acute{q}}=1$ if link $q\acute{q}$ is created, and $x_{q\acute{q}}=0$ otherwise.

Without the loss of generality and inspired by [2,18], at the upper level, let the maximization of a set of shape indices and minimization of the area of the created parcels from their required values be the case. The value of these objectives depends on the arrangement of the parcels and the street layout inside $b$ simultaneously. At the lower level, finding the configuration of the internal streets that provide access to inaccessible parcels by minimizing factors, such as the street length and the angle between the street’s consecutive links, is formulated. If the shape indices at the upper lever are limited to the number of the sides of the parcels’ extents and the desired length of each side of the parcels, the bi-level CLSSD problem is modeled as follows (Equations (1)–(4)):

The upper-level problem:

$$\begin{gathered} Z_1=\underset{p}{\min }\left(\left[\frac{{\alpha }_1}{2\left|P\right|}\sum _{o\in O}\sum _{{\forall }_{{ext}_p}\in A}{w}_o\times U_o\left(I\left({ext}_p\right)\right)\right]+\left[\frac{{\alpha }_2}{2\left|P\right|}\sum _{{\forall }_{{ext}_p}\in A}\acute{U}({ext}_p,a_p,{\acute{a}}_p)\right]\right); \\ A=\Lambda \left(f\left(P,L,b\right)\right)-\left(\Lambda \left(f\left(P,L,b\right)\right)\cap Z_2\right) \end{gathered}$$

(1)

Subject to the lower-level problem:

$$Z_2=\left\{\begin{array}{c}\bigcup _{\pi }\underset{\begin{array}{c}{x}_{q\acute{q}}\in {\pi }_{{ext}_p}^{kc}\\ c\in C\\ p\in P\\ k=H\left(p\right)\end{array}}{\mathrm{m}\mathrm{i}\mathrm{n}}\left(\left[{\beta }_1\times T\left({\pi }_{{ext}_p}^{kc}\right)\right]+\left[\frac{{\beta }_2}{\left|{\pi }_{{ext}_p}^{kc}\right|-1}\times \acute{T}\left({\pi }_{{ext}_p}^{kc}\right)\right]\right), otherwise; {\pi }_{{ext}_p}^{kc}=a set of x_{q\acute{q}}s\\ 0, if \nexists {ext}_p\in \Lambda \left(f\left(P,L,b\right),b\right)|{\forall }_{side}\in {ext}_p, acc\left(side,s\right)=0\end{array}\right.$$

(2)

And the lower-level problem is subject to:

$$\sum _{\acute{q}\in e\left(q\right)}{x}_{q\acute{q}}-\sum _{v\in \acute{e}\left(q\right)}{x}_{v\acute{q}}=\left\{\begin{array}{c}1, if q=k\\ 0, if q\ne k, {\forall }_q\in N\\ -1, if q=c\end{array}\right.$$

(3)

$${\forall }_{{ext}_p\in \Lambda \left(F,b\right)|{\forall }_{side}\in {ext}_p, acc\left(side,s\right)=0}, \exists !{\pi }_{{ext}_p}^{kc}\in {\Pi }_{{ext}_p}$$

(4)

In Equation (1), ${\alpha }_1$ and ${\alpha }_2$ are, respectively, the importance values of the shape indices and the area function. ${\alpha }_1$ and ${\alpha }_2$ vary between 0 and 1, and ${\alpha }_1+{\alpha }_2=1$. $\left|P\right|$ is the number of parcels that should be allocated through the subdivision process. $O$ is a set of the shape indices. $w_o$ is the weight of the shape index $o$ and is defined by the planner. $w_o$ varies between 0 and 1, and $\sum _{o\in O}{w}_o=1$. $U_o$ is a penalty function that maps the value of shape index $o$ for ${ext}_p$ to a zero-to-one space. Two types of shape indices can be regarded in the upper level’s objective function: first, the ones directly related to the properties of an extent as a whole (e.g., the number of sides), and second, the indices related to the components of an extent (e.g., the desired length of each side of an extent). Therefore, $U_o$ is a piecewise function that includes sub-function $I$, which decomposes ${ext}_p$ to its constituent parts. If the shape index is of the first type, $I$ is not performed on ${ext}_p$, otherwise, it decomposes ${ext}_p$, and each component of ${ext}_p$ is penalized by $U_o$. For instance, if the number of sides ($o=1$) and the length of sides ($o=2$) are the shape indices, and the desired values are 4 with one-side-up tolerance and 10 with 10% tolerance, respectively, $U_1$ and $U_2$ can take the forms illustrated in Figure 2. It should be noted that the penalty functions are not limited to the linear form, and the planner can adopt any type for modeling the penalization behavior. Equation (5) represents $U_o$ in detail.

$$\left\{\begin{array}{c}{U}_o\left(I\left({ext}_p\right)\right)=\frac{1}{\left|{ext}_p\right|}{\displaystyle \sum _{side\in {ext}_p}}{U}_o\left(side\right), otherwise; \left|{ext}_p\right|=the number of sides of {ext}_p\\ U_o\left(I\left({ext}_p\right)\right)=U_o\left({ext}_p\right), if o is a side related shape index\end{array}\right.$$

(5)

Figure 2. Examples for the penalty functions $U_1$ and $U_2$. (a) An extent-related shape index: the parcel’s number of sides ($U_1$). (b) A shape index related to the components of an extent: length of sides of an extent ($U_2$).

Like $U_o$, $\acute{U}$ is a function that penalizes ${ext}_p$ based on its deviation from its required area. If after solving the lower-level problem, ${ext}_p$ intersects with the designed streets (i.e., ${ext}_p\cap \mu \left(\delta ,Z_2\right)\ne \varnothing$, where $\mu$ is the buffer function with width $\delta$ and the given street axes in $Z_2$), ${ext}_p$ is penalized according to $a_p$ and ${\acute{a}}_p$, the area of ${ext}_p$ occupied by the streets. Otherwise, it is penalized according to $a_p$. This function is modeled through Equation (6), and Figure 3 displays a sample for the computation of $\acute{U}$.

Figure 3. (a) An example for the calculation of $\acute{U}$ for ${ext}_p$ intersected with a street obtained from solving $Z_2$. (b) An example for the calculation of $\acute{U}$ for ${ext}_p$, which is not intersected with the streets.

$Z_1$ is the upper-level optimization problem, and it also varies between 0 and 1 due to the application of the standardization values (i.e., $\frac{{\alpha }_1}{2\left|P\right|}$, $\frac{{\alpha }_2}{2\left|P\right|}$, and $w_o$).

$$\left\{\begin{array}{c}\acute{U}\left({ext}_p,a_p,{\acute{a}}_p\right)=\acute{U}\left(area\left({ext}_p\right),a_p,{\acute{a}}_p\right), if {ext}_p\cap \mu \left(\delta ,Z_2\right)\ne \varnothing \\ \acute{U}\left({ext}_p,a_p,{\acute{a}}_p\right)=\acute{U}\left({area(ext}_p),a_p\right), otherwise\end{array}\right.$$

(6)

In Equation (2), the street design problem is formulated at the lower level. It outputs the street configuration of a subdivision layout concerning its corresponding network. In other words, the aim of $Z_2$ is to select links in $G(N,M)$ corresponding to the subdivision layout $\Lambda \left(f\left(P,L,b\right)\right)$ with inaccessible parcels (i.e., $\exists {ext}_p\in \Lambda \left(f\left(P,L,b\right)\right)|{\forall }_{side}\in {ext}_p, acc\left(side,s\right)=0$), such that each inaccessible parcel ${ext}_p$ is connected to an access point $c\in C$ through one of its connection points in $H$. If a path connecting the connection point $k$ to $c$ is denoted by ${\pi }_{{ext}_p}^{kc}=(\cdots , x_{q\acute{q}}, \dots )$, and for each inaccessible parcel ${ext}_p$, ${\Pi }_{{ext}_p}$ is the set that stores paths from $k$s (the connection points on the inaccessible parcel ${ext}_p$) to $c$s (the access points in $C$), and the objective of the lower-level problem is to find the union of optimal paths generated for each inaccessible parcel ${ext}_p$, minimizing the length and the angle between consecutive links of ${\pi }_{{ext}_p}^{kc}$s.

This way, two functions are articulated for the calculation of the length and the angle of a path. Function $T$ varies within the range of $\left[0,1\right]$ and penalizes path ${\pi }_{{ext}_p}^{kc}$ according to its deviation from a given value. Function $\acute{T}$ decomposes ${\pi }_{{ext}_p}^{kc}$ to its constructing links, calculates the angle between the consecutive links, penalizes the obtained angle values, sums the penalties, and divides the sum by $\left|{\pi }_{{ext}_p}^{kc}\right|-1$, where $\left|{\pi }_{{ext}_p}^{kc}\right|$ is the number of links in path ${\pi }_{{ext}_p}^{kc}$. Division to $\left|{\pi }_{{ext}_p}^{kc}\right|-1$ is conducted to set the $\acute{T}$ value between 0 and 1. Figure 4 shows sample functions for $T$ and $\acute{T}$, and the way that $\acute{T}$ can be computed.

Figure 4. (a) A sample function for $T$. (b) A sample penalty function for calculating $\acute{T}$.

${\beta }_1$ and ${\beta }_2$ are, respectively, the importance values of the length and angle of the consecutive of links of a path from $k$ to $c$. ${\beta }_1$ and ${\beta }_2$ vary between 0 and 1, and ${\beta }_1+{\beta }_2=1$. Consequently, $Z_2$ falls between 0 and 1. Equation (3) ensures that the constructed path is acyclic and starts from $k$ and ends at $c$. In this equation, $e\left(q\right)$ and $\acute{e}\left(q\right)$ are the set of links exiting from and entering node $q$, respectively. Also, Equation (4) ensures that for every inaccessible parcel with several connection points, only one path is designed to avoid the generation of multi-paths for one parcel.

2.2. Solution Procedure

The CLSSD is an NP-hard problem as (1) the subdivision layout optimization is NP-hard per se [2], and (2) it is proved that bi-level programming belongs to the non-deterministic polynomial-hard class of optimization problems [26]. Concerning this characteristic and non-convexity of bi-level programming problems, refs. [27,28,29] recommend meta-heuristic algorithms for solving such problems.

Several meta-heuristics have been developed and applied in the literature of operation research for addressing NP-hard problems (e.g., particle swarm [30,31], simulated annealing [32,33], ant colony [34,35], and genetic algorithms [36,37]). In this study, a genetic algorithm (GA) is taken as a solution procedure to represent the ideas for finding the optimum answer. It should be noted that the GA is considered because of its characteristics such as the ability to work with multiple solutions extending the area of search in the solution space, compatibility with complex problems with unknown solution spaces [38], and providing room for designing operators compatible with the CLSSD problem. In addition, it should be stated that the aim of this section is to show how the CLSSD problem can be approached. Consequently, the GA is considered a context for examining the applicability of the general solution ideas, which are crystallized in the algorithm’s operators and can be placed into other meta-heuristics.

The proposed algorithm consists of three main components: (1) the generation of initial random solutions, (2) the street design genetic algorithm (SDGA), and (3) the subdivision layout memetic–genetic algorithm (SLMGA). First, a population is generated. The population includes several arrangements of parcels in $b$ through $f\left(P,L,b\right)$. Second, the created population enters SLMGA, and the corresponding layout to each member of the population containing the extent of the parcels is computed by $\Lambda \left(f\left(P,L,b\right)\right)$. Then, the access condition is checked for each subdivision layout $\Psi$. If $\Psi$ has at least one inaccessible parcel, the connection points are created through $h\left(\Psi ,R\right)$, and $V_p$s are calculated. Having access points $C$, the network $G(N=\left(\bigcup _{p\in P}{V}_p\right)\cup H\cup C, M=Intersection(\left(\bigcup _{p\in P}side\in {ext}_p\right),N)$ is made for $\Psi$, and the street layout is designed by the application of SDGA. Third, the upper-level objective is computed for each member of the population. After that, if the stoppage criterion is fulfilled, the best solution is returned; otherwise, new solutions are produced from the answers in the population, and they are stored in a repository along with a certain number of solutions in the population. Note that the size of the repository is fixed during the optimization process, meaning that the number of solutions in the population stays the same after each iteration. Iteration continues until the stoppage criterion is met. Figure 5 depicts the general sequence of calculations for solving the CLSSD. Details of these components are explained in the following sections.

Figure 5. The general sequence of calculations for solving the CLSSD problem.

2.2.1. Random Solution Generation Procedure

As indicated in Section 2.1.1, the subdivision reference lines in $L$ are based on the planner’s preferences and show the subdivision direction and the number of rows. One way to generate a random solution is to distribute parcels on the proposed reference lines. However, as the reference lines represent a subdivision concept, not an exact subdivision grid, sticking to them as the fixed source of population generation decreases the diversity of solutions and reduces the chance of searching the solution space for more satisfactory layouts. For this reason, a procedure is used in this article to keep the direction and number of reference lines the same as the planner’s preferences regarding the diversity quality in the solution procedure. It should be noted that the number of reference lines should not exceed the number of parcels ($1\le \left|RL\right|\le P$, where $\left|RL\right|$ is the number of reference lines, and $P$ is the number of parcels).

In addition, planners might like to have parcels with different directions within particular areas of $b$. To consider this condition in the solutions, the planner sketches polygons on $b$ to set boundaries for special areas including reference lines with different directions. As an example, Figure 6 exhibits a case in which two bounds, each including two reference lines, are sketched.

Figure 6. An example for sketching bounds and reference lines on b.

To do so, first, the random solution generation procedure (RSGP) selects a bound and then the reference line $l$ from $L$ randomly. Second, the RSGP generates a point inside the chosen bound and creates a line parallel to $l$, which passes through the generated point. If the RSGP has not produced the line before, it stores the line’s intersection with the bound, and $L=L-\left\{l\right\}$. Otherwise, the RSGP generates another point and creates another line until it obtains a unique reference line. This procedure stops when (1) $L=\varnothing$, and (2) the solution contains all the sketched bounds.

After generating the reference lines, first, the empty set $P$ is created. Second, the RSGP assigns a random point, $p$, to each reference line and sets $P=P\cup p$. For producing random points, given the starting and ending of a reference line, Equations (7) and (8) are applied, where $t$ is a random value between 0 and 1, $x_s$ and $y_s$ are the coordinates of the starting point of a selected reference line, and $x_e$ and $y_e$ are the coordinates of the ending point.

$$x=x_s+\left(x_e-x_s\right)t$$

(7)

$$y=y_s+\left(y_e-y_s\right)t$$

(8)

Third, the RSGP generates a random point on a randomly selected reference line. If the point is not in $P$, $P=P\cup p$; otherwise, the RSGP generates another point. This process iterates until the RSGP obtains a new point not already in $P$. If the size of $P$ equals the number of required parcels ($nP$), $Pop=Pop\cup P$. Otherwise, the RSGP generates another point on a random reference line. This procedure terminates when the number of members in $Pop$ equals $nPop$ (i.e., the number of individuals in the SLMGA). Algorithm A1 shows the RSGP in detail.

2.2.2. SLMGA Procedure

The SLMGA consists of three parts: (1) the initial part, (2) the iterative part, and (3) the memetic part. The initial part receives $Pop$ from the RSGP. Then, for each member of the population, the subdivision layout is generated through the computation of the Voronoi diagram. If the subdivision layout includes at least one inaccessible parcel, the SDGA is performed. Next, the output replaces the previous solution, and the upper-level objective function is calculated for all layouts.

In the iterative part, new land subdivisions are generated by selecting layouts and performing crossover and mutation operators. There are various selection methods for choosing one solution from a population in the literature of GA (e.g., random selection, roulette wheel selection, rank, elitist selection, scale selection, and tournament selection). The SLMGA applies the rank selection because, as indicated by Fattahi [39], it gives the solutions with worse objective values a chance to enter into the new solution creation procedures and has the advantages of the roulette wheel selection (i.e., the increase in the number of better solutions in the population and the improvement of the average objective values of a population compared to its previous one). In the rank selection method, the ranks of solutions are computed based on the objective values, and selection is performed using the roulette wheel method on the rank values.

Selecting solutions by the rank method, the procedure for producing new subdivision layouts is executed. First, the number of subdivision layouts obtained from the crossover and mutation procedures is determined. These numbers depend on the crossover and mutation probabilities denoted by $P_c$ and $P_m$, respectively. $P_c$ and $P_m$ designate the proportions of the solutions selected from $Pop$ and reproduced by the operators. These parameters affect the computational burden of the solution algorithm such that the larger these values, the slower the algorithm might be [40]. In addition, as the solution algorithms often iterate many times, setting large values for these parameters is unnecessary [39]. This way, several studies recommend the adoption of $P_c$ and $P_m$ between 0.8–0.9 and 0.2–0.3, respectively [2].

Second, the crossover and mutation operators are applied to the selected solutions. The crossover operator takes two layouts and combines them to generate a new subdivision layout. The crossover should hold three conditions: (1) the number of reference lines in each bound of the off-spring equals the number defined by the planner (Equations (9) and (10), where ${nrl}_{bo}$ is the number of reference lines on bound $bo$, $BO$ is the set of bounds, and $\left|RL\right|$ is the total number of reference lines), (2) all reference lines include at least one parcel and do not contain parcels more than $P-\left|RL\right|+1$ (Equation (11), where ${prl}_{rl}$ is the number of points on reference line $rl$), and (3) the number of parcels in the off-spring equals the required number of parcels (Equation (12)).

$${1\le nrl}_{bo}=\left|{RL}_{bo}\right|,\forall bo\in BO$$

(9)

$$\sum _{bo\in BO}{nrl}_{bo}=\left|RL\right|$$

(10)

$$1\le {prl}_{rl}\le P-\left|RL\right|+1,\forall rl\in RL$$

(11)

$$\sum _{rl\in RL}{prl}_{rl}=P$$

(12)

This way, Algorithm A1 is developed to cross over the parent solutions and repair the off-spring if they violate the constraints in Equations (9)–(12). Assume that $S_1$ and $S_2$ are selected for entering the crossover procedure. Before performing this operator, the location of points and reference lines in $S_1$ and $S_2$ is checked to decide how the solutions are combined. If both solutions have the same reference lines ($con{d}_1=true$), a different procedure from the one applying to the layouts with different reference lines ($con{d}_2=true$) is used. Aside from which of these conditions are accepted, points and reference lines in off-spring are inherited from their parents. However, after performing the crossover operator, the resulting layouts might violate the conditions in Equations (9)–(12). Therefore, according to the concepts of need and capacity (later explained in Algorithm A2), the off-spring are repaired to become feasible and have the characteristics of their parents. Algorithm A2 represents the crossover procedure and its sub-procedures in detail.

The mutation procedure can be defined in several ways. In this article, three mutation types are designed to cover reference line and parcel changes. The first type, called the parcel mutation procedure (PMP), which maintains the arrangement of reference lines like the parent solution, randomly picks a pre-defined number of parcels and redistributes them on the reference lines using Equations (7) and (8). The second type, called the reference line mutation procedure (RLMP), changes the location of some reference lines and projects the parcels on their corresponding lines, keeping the distance between them in the parent solution. The third type, called the parcel and reference line mutation procedure (PRLMP), randomly reallocates a pre-determined number of reference lines together with parcels. Three rates (i.e., $r_{PMP}$, $r_{RLMP}$, and $r_{PRLMP}$) control the number of solutions generated by PMP, RLMP, or PRLMP. Rates vary between 0 and 100, which is the population percentage candidates for mutation. After determining the number of solutions entering the procedures, the rank selection method is applied for choosing the answers. Algorithm A3 describes the mutation operators in detail.

Once the crossover and mutation operators produce new solutions, they are added to $Pop$, and the value of the upper-level objective function is computed for them. Next, the answers are entered into the third part, where the memetic stage starts. First, candidate solutions are obtained from $Pop$ by the rank selection method given $nmPop$, the number of candidates. Second, local search is performed to improve and exploit the candidates. In this article, the Hooke and Jeeves algorithm (HJA) (also called direct or pattern search) performs the local search task. The HJA is a numerical optimization model that uses a hill-climbing approach to search the solution space. Due to the independence of this model to a gradient, the HJA can be applied to incontiguous and indifferentiable problems [41]. The HJA begins with an initial solution, that is, the selected solution by the rank selection in the CLLSD problem. As mentioned, the solution is a set of points distributed on reference lines. The HJA moves the points on the reference lines to find a better subdivision layout. Let $S$ be the set of parcel coordinates that represents the position of each point by two components; the first is $x$, and the second is $y$. The HJA starts with an exploratory search which changes the location of points by adding and subtracting an interval to each component of the parcels. For the CLLSD problem, this interval, denoted by ${∆}_i$, is the length each parcel moves along its corresponding reference line. In the exploratory search, each component in $S=\left(p_1=(x_1,y_1),\dots ,p_n=(x_n,y_n)\right)$ is modified one by one through Equation (13), and the objective function is computed for each state, and the parcel’s position is replaced by the best one. A state generated from the movement of parcel $p_i$ along its corresponding reference line is acceptable if the new state does not overlay any other parcel in $S$. This process goes forward to reach the last parcel in $S$ (i.e., $p_n$). The layout obtained after performing the exploratory search is illustrated by $S^{\left(1\right)}$. In the Equation (13), ${rl}_i$ is the reference line that parcel $p_i$ is placed on; $L_i$ is the length of ${rl}_i$; and $x_s^{{rl}_i}$, $y_s^{{rl}_i}$, $x_e^{{rl}_i}$, and $y_e^{{rl}_i}$ are the coordinates of start and end points of ${rl}_i$, respectively.

$$\left[\begin{array}{c}{State}_1=p_i=\left(x_i,y_i\right)+∆\frac{\left(x_e^{{rl}_i},y_e^{{rl}_i}\right)-\left(x_s^{{rl}_i},y_s^{{rl}_i}\right)}{L_i}\\ {State}_2=p_i=\left(x_i,y_i\right)-∆\frac{\left(x_e^{{rl}_i},y_e^{{rl}_i}\right)-\left(x_s^{{rl}_i},y_s^{{rl}_i}\right)}{L_i}\end{array}\right]$$

(13)

After the exploratory search, the movement pattern is executed. In this step, the new position of parcels is produced using Equation (14), where $S^{\left(2\right)}$ is the new position of parcels. The new position is feasible if all parcels fall within the subdivision bounds. Otherwise, ${∆}_i$ is updated by dividing the values into 2, and the process starts over taking the new ${∆}_i$s into account. These computation steps iterate until all ${∆}_i$s become smaller than or equal to a pre-defined value that is commonly a very small value (e.g., 0.0001). The compact form of the HJA is presented in Algorithm A4.

$$S^{\left(2\right)}=\frac{S^{\left(1\right)}}{2}-S$$

(14)

Next, the solutions with the best values are selected and used for regeneration. These steps iterate until the stoppage criterion is met. Figure 7 depicts the SLMGA in detail. It should be noted that the maximum number of iterations, run time limit, and no improvement of the objective value after a certain number of iterations are the common stoppage criteria for the GA algorithm [38,39].

Figure 7. The procedure of the SLMGA.

2.2.3. SDGA Procedure

As mentioned in Section 2.2.1 and Section 2.2.2, the SDGA is applied to the inaccessible subdivision layouts. First, the corresponding graph for the inaccessible layouts, named base-graph, is created by Algorithm A5, and second, the street design is performed.

Like the SLMGA, the SDGA starts with the creation of the initial population. For each subdivision layout input into the SDGA, an initial population is generated. Each member of the initial population is a street network, which is the union of paths connecting each inaccessible parcel in the subdivision layout from one of its connection points to one of the access points in the base-graph. This way, to generate a solution, the following steps are taken.

For each inaccessible parcel in the subdivision layout, a random connection point and an access point are selected at first. Second, a path from the connection point to the access point is produced through the process inspired by [42] and stored in the solution set. If the created path passes through the connection point of other inaccessible parcels, paths from their connection points to the access point are extracted from the generated path. Then, these parcels are discarded from the set of inaccessible parcels. This process iterates until all inaccessible parcels connect to the outside of the subdivision area. Third, the solution is added to the population. The procedure stops if the number of solutions equals a pre-defined threshold. Otherwise, the indicated steps generate another random street layout. Algorithm A4 shows the population generation procedure for the SDGA in detail.

After applying the path creation procedure in Algorithm A6, the lower-level objective function is calculated for each member of the population. Similar to the SLMGA, the rank selection method is applied to choose candidate solutions for reproduction. New answers are generated using crossover and mutation operators. The number of solutions produced by these operators is controlled by ${\acute{P}}_c$ and ${\acute{P}}_m$, which are the crossover and mutation probabilities, respectively.

The steps represented in Figure 8 are followed to cross over two selected solutions. Let $S_1$ and $S_2$ be the selected solutions with the inaccessible parcel set of $\left[p_2,p_{12},\cdots ,p_9\right]$. First, a random permutation is generated equal to the number of inaccessible parcels, $r_v$. Then, a random integer is generated between 1 and $r_v-1$. Second, the random permutation set is cut from $r_v$, and the streets of the corresponding parcels are combined to form new solutions.

Figure 8. The crossover operator for the SDGA.

One node other than the origin or destination on the chosen answer is selected for mutation. Then, one of the following states randomly chooses to generate a new solution. (1) The origin is the base of the new solution, (2) the destination is the base of the new solution, or (3) both the origin and destination are the bases of the new solution. For the first two cases, a random connection or access point is selected. Then, a new path is created from the connection point to the chosen node or from the selected node to the access point using the path creation procedure in Algorithm A6. Finally, the obtained path is merged with the remaining part of the solution under consideration. For the third case, at first, a connection and an access point are randomly selected. Second, paths from the connection point to the chosen node and from the selected node to the access point are built applying Algorithm A6. Finally, these paths are combined and replace the existing path. Figure 9 depicts the mutation procedure.

Figure 9. The mutation operator for the SDGA.

After generating new solutions and adding them to the population, the value of the lower-level objective function is calculated. Next, the best answers are selected to form the new generation. These steps iterate until the stoppage criterion (e.g., reaching a maximum number of iterations or no improvement in the objective value) is met. Figure 10 displays the SDGA in detail.

Figure 10. The procedure of the SDGA.

2.3. Case Studies

Like Demetriou, See, and Stillwell [2] utilized two experimental cases for the model demonstration, two randomly generated cases are presented in this article to analyze the applicability of the instigated ideas for solving the bi-level CLSSD problem. Table 1 illustrates the case studies in detail, and Table 2 portrays the algorithm parameters. These examples are given to an experienced planner and fed into the algorithm concerning the same preferences to provide a verification context by comparing the solutions obtained from the professional designer and the designed algorithm.

Table 1. Case studies. R1 to R10 are, respectively, the connection point rule ($R$), street width ($2\delta$), number of parcels ($\left|P\right|$), weight of the shape indices (${\alpha }_1$) and area deviation (${\alpha }_2$), shape indices and weights ($w_o$), shape index functions ($U_o$), area deviation function ($\acute{U}$), street evaluation functions ($T$ and $Ang\_plnt$), weights of the street evaluation functions (${\beta }_1$ and ${\beta }_2$), and area of the required parcels.

Case Number	Subdivision Area	Requirements
C1		R1: Inaccessible parcels can be connected through the midpoint of their sides. R2: 8 m. R3: 34. $R4: {\alpha }_1=0.3$$\mathrm{and} {\alpha }_2=0.7$. R5: Weights of the parcel’s number of sides ($w_1=0.5$$) \mathrm{and} \mathrm{the} \mathrm{minimum} \mathrm{of} \mathrm{the} \mathrm{sides}’ \mathrm{length} (w_2=0.5$). R6: U1 is the same as the function in Figure 2a. U2 is like the function in Figure 2b, but 2 replaces 9 on the horizontal axis. R7: The form of the $\acute{U}$ function is like Figure 3b. Cut-off points on the horizontal axis are $\pm 5\%$$\mathrm{of} a_p$. R8: Street evaluation functions are the same as Figure 4a,b. The cut-off for T is 60. The first and second points on the horizontal axis of $Ang\_pnlt$ are 150 and 180, respectively. R9: ${\beta }_1={\beta }_2=0.5$. R10: Thirty-four parcels with an area of 100 square meters are required. General comments on the layout: Three reference lines marked in blue are considered, and the accessibility of the block is provided through the red line. Note that values for the area and length are dimensionless. In addition, it is assumed that other context-specific factors have been controlled for analysis purposes.
C2		R1: Inaccessible parcels can be connected through the midpoint of their sides. R2: 8 m. R3: 10. R4: ${\alpha }_1=0.1$$\mathrm{and} {\alpha }_2=0.9$. R5: Weights of the parcel’s number of sides ($w_1=0.5$$) \mathrm{and} \mathrm{the} \mathrm{minimum} \mathrm{of} \mathrm{the} \mathrm{sides}’ \mathrm{length} (w_2=0.5$). R6: U1 is the same as the function in Figure 2a. U2 is like the function in Figure 2b, but 5 replaces 9 on the horizontal axis. R7: The form of the $\acute{U}$ function is like Figure 3b. Cut-off points on the horizontal axis are $\pm 5\%$$\mathrm{of} a_p$. R8: Street evaluation functions are the same as Figure 4a,b. The cut-off for T is 20. The first and second points on the horizontal axis of $Ang\_pnlt$ are 150 and 180, respectively. R9: ${\beta }_1={\beta }_2=0.5$. R10: Ten parcels with areas of 600, 500, 400, 600, 1000, 400, 1000, 5000, 1000, and 462.5 square meters are required. General comments on the layout: Four reference lines marked in blue are considered, and the accessibility of the block is provided through the red line. Note that values for the area and length are dimensionless. In addition, it is assumed that other context-specific factors have been controlled for analysis purposes.

Table 2. The algorithm parameters.

Parameter †	Value	Parameter	Value
Crossover probability ($P_c$)	0.8	Iteration	200
Mutation probability ($P_m$)	0.9	HJV exploratory search parameter ($∆$)	0.5
Population size ($nPop$)	200	HJV termination parameter ($\acute{∆}$)	0.0001

^† Note: the consistency of these parameters is analyzed in the next section.

3. Parameters and Outputs

The proposed procedures in Section 2 were programmed in Python using Shapely and Numpy modules for coding spatial operations and carrying out numerical computations, respectively. Table 3 exhibits the outputs of the algorithm given the parameters in Table 2. It also portrays subdivision layouts prepared by a trained and experienced planner.

Table 3. Algorithm’s outputs compared with the planner’s layouts. (Note that some slight modifications (e.g., smoothness and redrawing) were applied for illustration quality purposes.)

Case Number	Algorithm Output	Planner Output
C1
C2

As the C1 row of Table 3 depicts, for the T-shaped block, a case with a straightforward subdivision pattern, the algorithm output was the same as the one prepared by the trained planner. In other words, by giving the planner’s subdivision and street design requirements and conditions to the algorithm, the output was in line with the configuration in the analyst’s mind. In the second case (C2), however, by increasing the variation in parcel areas and the shape irregularity, given the same inputs, layouts obtained from the algorithm and planner were substantially different. The difference between these configurations was not restricted to the arrangement of parcels and streets, but it was rooted in the value of the objective function computed for both layouts as well, which revealed that the output of the proposed algorithm was about 94% more optimal than the one designed by the planner. Figure 11 portrays the convergence process of the algorithm and the value of the objective function for C1 and C2. In addition, the time taken to obtain the final layouts by the algorithm and planner was about 4 min and 3.5 min for C1 and 4.2 min and 55 min for C2, respectively.

Figure 11. Algorithm convergence process. The values of the objective function are standardized. The minimum values for C1 and C2 are 0.0042 and 0.0082, respectively.

To assess the variance and consistency of solutions, as well as convergence time based on input parameters, the algorithm underwent 30 runs, during which the objective value and elapsed time were recorded. Subsequently, a t-test was conducted to ascertain if the mean of these metrics significantly deviated from the optimal values. Table 4 presents the outcomes of this analysis for C1 and C2. It suggests that the recorded metrics were statistically significant at a 95% confidence interval, indicating the reliability of the attained objective values and solution times.

Table 4. t-test results.

Indicator		C1	C2
Objective value	p-value	0.844	0.322
	t-value	−0.198	−1.008
Solution time	p-value	0.973	0.898
	t-value	−0.034	−1.290

To examine the time complexity of the proposed methods, problems of varying sizes were solved, and the solution times were recorded. The number of iterations was set to 200, and other parameters for calculating the objective functions were consistent with those tuned for C2. Figure 12 illustrates the relationship between problem size and time consumption. Following the experimental procedure in [43,44], a curve was fitted to the data, with the equation and coefficient of determination presented in Figure 12. The results demonstrated that the algorithms performed satisfactorily in polynomial time. Additionally, the complexity of the solution method was $O\left(n^2\right)$, an acceptable order for the algorithms. This is particularly relevant for the presented algorithm, as subdividing a block into more than 100 parcels is exceptionally rare, in practice.

Figure 12. Complexity analysis of the solution method (the solid line is the actual time consumption, and the dashed line is the regressed curve).

4. Discussion and Conclusions

In this research, a bi-level optimization model was formulated to integrate street design and land subdivision within a unified framework. To solve the presented problems, several ideas were considered and implemented within the genetic algorithm structure. Following the programming of the solution procedure, two cases were presented and solved utilizing the algorithms. Subsequently, the results were verified and assessed by comparing the algorithm outputs with the solutions provided by an experienced and trained planner. This comparison demonstrated the applicability of the algorithms and the acceptability of the street design and land subdivision layouts.

Despite the promising findings, this research has limitations that suggest avenues for future studies. Firstly, the final solution relies on the reference lines proposed by the planner. While this aligns with the purpose of this article, which proposes a supporting system for generating layouts according to the planner’s preferences, generating the optimal arrangement of reference lines could be explored in future research.

Secondly, the optimization model illustrated in this study had a single objective. However, considering the optimization model as a multi-objective problem is another potential direction. Formulating a multiple-objective model based on the concepts explained in this study is therefore recommended.

Thirdly, in addition to the objectives used in this research drawn from the land subdivision literature (e.g., parcel shape indices and area deviation minimization), several other objectives such as maximizing or minimizing land value, minimizing development costs, and maximizing parcel sides benefiting from sunlight could be included, warranting further investigation.

Fourthly, land use allocation, an important factor in subdivision and street design, can be integrated into the proposed model using the concept of a multi-level optimization problem statement. In this approach, land types are assigned to the subdivision and street layouts, and the optimality of the land use locations is evaluated and fed back into the model until the (near-)optimal land subdivision layout, street configuration, and land use arrangement are obtained. Introducing such a multi-level problem and solution approaches are considerable extensions to this research.

Fifthly, conducting sensitivity analysis on the weights and forms of penalty functions, and assessing how these parameters impact optimization results, presents a fascinating research avenue.

Sixthly, exploring more efficient operators and solution algorithms for addressing the stated optimization problem is another significant research direction.

Finally, the solution procedures introduced here could be applied in other cases to establish a solid foundation for the model’s application.