2018
DOI: 10.1007/s10898-017-0602-1
|View full text |Cite
|
Sign up to set email alerts
|

An interleaved depth-first search method for the linear optimization problem with disjunctive constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…Second, the method of optimization determines the parameters for each growth model by minimizing the sum of the square of the difference between the actual data and the growth model. This difference is considered as the objective function in the optimization process [ [29] , [30] , [31] , [32] , [33] ]. Finally, a comparison is made between the growth model and the actual data, and whether or not there is a discrepancy between them.…”
Section: Methodsmentioning
confidence: 99%
“…Second, the method of optimization determines the parameters for each growth model by minimizing the sum of the square of the difference between the actual data and the growth model. This difference is considered as the objective function in the optimization process [ [29] , [30] , [31] , [32] , [33] ]. Finally, a comparison is made between the growth model and the actual data, and whether or not there is a discrepancy between them.…”
Section: Methodsmentioning
confidence: 99%
“…The results showed that the entrance and exit connecting roads of the parking lot are mainly two lanes, three lanes, and four lanes on the same side. Because the first and the second lane close to the entrance and exit are often selected for vehicles arriving and leaving the parking lot, the third and the fourth lanes on the same side have less impact on dynamic and static traffic [18][19][20][21]. Therefore, this paper mainly studied the roads with two and three lanes on the same side.…”
Section: Delay Model Of Road Vehiclementioning
confidence: 99%
“…The Dijkstra-DFS algorithm belongs to the group of graph-theoretic algorithms (Amhaz et al, 2016; Lyu et al, 2018), which can be used effectively to solve the shortest path design problem (Ariasrodil et al, 2015; Mencía Sierra and Varela, 2013). The DFS algorithm (Figure 4b) is based on the recursive principle, according to which it starts from an initial vertex, Vs, and we explore its adjacent vertices by order of the most recent, until the destination vertex, Ve, is found, after which backtracking is applied.…”
Section: Model Solutionmentioning
confidence: 99%