An Optimization Method for Urban Underground Parking Lots Allocation Based on Polygon Decomposition

被引：0

作者：

Huang Y.-B. ^{[1
]}

Yang H. ^{[2
]}

Zhou Z.-B. ^{[2
]}

Liu X. ^{[1
]}

机构：

[1] School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai

[2] Shanghai HYP-ARCH Architectural Design Consultant Commoney Limited, Shanghai

来源：

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | 2020年 / 43卷 / 04期

关键词：

Optimization method; Parking allocation; Particle swarm optimization algorithm; Polygon decomposition; Underground parking lots;

D O I：

10.13190/j.jbupt.2019-212

中图分类号：

学科分类号：

摘要：

To assist designers in designing large-scale urban underground parking lots characterized by irregular contour, large area and various obstacles, a mixed integer linear program model based on polygon decomposition is proposed to optimize the allocation of parking lots and roads together in the same direction within local irregular contours.This model not only considers the optimization of parking angles and position, but also has the ability to deal with the designing of parking lots and roads in contours of arbitrary shape.A decomposition method based on particle swarm optimization algorithm is presented to solve the model and engineering drawings were used to validate its efficiency.It is shown that the proposed method can arrange local irregular contours efficiently and help designers to find the optimal design of parking lots.Via visualization and human-computer interaction, the designers' development efficiency can be largely improved. © 2020, Editorial Department of Journal of Beijing University of Posts and Telecommunications. All right reserved.

引用

页码：7 / 14

页数：7

共 19 条

[11]

Banzhaf H, Quedenfeld F, Nienhuser D., High density valet parking using k-deques in driveways, Intelligent Vehicles Symposium, pp. 1413-1420, (2017)

[12]

Nourinejad M, Bahrami S, Roorda M J., Designing parking facilities for autonomous vehicles, Transportation Research Part B Methodological, 109, pp. 110-127, (2018)

[13]

Xu Hanzhe, Huang Yibin, Yang He, Et al., Rule-based heuristic algorithm for parking spaces allocation in marginal area of urban underground parking lots, Journal of Beijing University of Posts and Telecommunications, 42, 4, pp. 102-108, (2019)

[14]

Franzblau D S., Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles, SIAM Journal on Discrete Mathematics, 2, 3, pp. 307-321, (1989)

[15]

McKenney M, Frye R, Dellamano M, Et al., Multi-core parallelism for plane sweep algorithms as a foundation for GIS operations, GeoInformatica, 21, 1, pp. 151-174, (2017)

[16]

Deng Yong, Liu Yang, Zhou Deyun, An improved genetic algorithm with initial population strategy for symmetric TSP, Mathematical Problems in Engineering, 3, pp. 1-6, (2015)

[17]

Ali R, Mounir G, Moncef T., Adaptive probabilities of crossover and mutation in genetic algorithm for solving stochastic vehicle routing problem, International Journal of Advanced Intelligence Paradigms, 8, 3, (2016)

[18]

Marini F, Walczak B., Particle swarm optimization(PSO) (A tutorial), Chemometrics and Intelligent Laboratory Systems, 149, pp. 153-165, (2015)

[19]

Zhan Zhihui, Zhang Jun, Li Yun, Et al., Adaptive particle swarm optimization, IEEE Transactions on Systems, Man, and Cybernetics, Part B(Cybernetics), 39, 6, pp. 1362-1381, (2009)

← 1 2 →