基于图形分割的城市地下车库车位排布优化方法

doi:10.13190/j.jbupt.2019-212

北京邮电大学学报 ›› 2020, Vol. 43 ›› Issue (4): 7-14.doi: 10.13190/j.jbupt.2019-212

基于图形分割的城市地下车库车位排布优化方法

黄逸彬¹, 杨赫², 周钟秉², 刘晓¹

1. 上海交通大学机械与动力工程学院, 上海 200240;
2. 上海霍普建筑设计事务所股份有限公司, 上海 200135

收稿日期:2019-10-12 发布日期:2020-08-15
通讯作者: 刘晓(1967-),女,教授,E-mail:x_liu@sjtu.edu.cn. E-mail:x_liu@sjtu.edu.cn
作者简介:黄逸彬(1995-),男,硕士生.

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

HUANG Yi-bin¹, YANG He², ZHOU Zhong-bing², LIU Xiao¹

1. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;
2. Shanghai HYP-ARCH Architectural Design Consultant Commoney Limited, Shanghai 200135, China

Received:2019-10-12 Published:2020-08-15

摘要/Abstract

摘要： 为辅助设计师排布外轮廓形状复杂、面积大、障碍物多的大规模地下车库，针对局部复杂轮廓内同向车位与车道共同优化排布问题，提出了基于图形分割的混合整数线性规划模型.考虑了车位排列角度及位置的优化，能够处理任意轮廓内的车位与车道排布.开发了基于粒子群优化的分解算法，并通过实际的工程图纸验证了模型和算法的有效性.结果表明，该算法能快速有效地排布局部车位，辅助设计者给出最佳优化排布方案.开发的可视化及人机交互功能可大大提高设计者的开发效率.

关键词: 地下车库, 车位排布, 优化方法, 图形分割, 粒子群算法

Abstract: 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.

Key words: underground parking lots, parking allocation, optimization method, polygon decomposition, particle swarm optimization algorithm

中图分类号:

TU248.3

黄逸彬, 杨赫, 周钟秉, 刘晓. 基于图形分割的城市地下车库车位排布优化方法[J]. 北京邮电大学学报, 2020, 43(4): 7-14.

HUANG Yi-bin, YANG He, ZHOU Zhong-bing, LIU Xiao. An Optimization Method for Urban Underground Parking Lots Allocation Based on Polygon Decomposition[J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(4): 7-14.

参考文献

[1] 许明才. 大城市商圈地区停车规划策略研究——基于上海市三个商业中心停车调查的实证研究[J]. 上海城市规划, 2014(2):43-50. Xu Mingcai. Study on parking planning strategy of metropolises' commercial center:an empirical study based on parking survey of three business center in Shanghai[J]. Shanghai Urban Planning Review, 2014(2):43-50.
[2] 谭忠盛, 王梦恕, 王永红, 等. 我国城市地下停车场发展现状及修建技术研究[J]. 中国工程科学, 2017, 19(6):100-110. Tan Zhongsheng, Wang Mengshu, Wang Yonghong, et al. Present situation and application of urban underground garage[J]. Engineering Science, 2017, 19(6):100-110.
[3] 陈歌. 城市地下公共车库的停车方式与空间设计研究[D]. 西安:西安建筑科技大学, 2016.
[4] Abdelfatah A S, Taha M A. Parking capacity optimization using linear programming[J]. Journal of Traffic and Logistics Engineering, 2014, 2(3):176-181.
[5] Kong Y, Le Vine S, Liu X B. Capacity impacts and optimal geometry of automated cars' surface parking facilities[J]. Journal of Advanced Transportation, 2018:1-13.
[6] Huang Junhao, Liao Tianchi, Kang Haining, et al. A general algorithm for rectangular parking optimization design[J]. Journal of Physics Conference Series, 2020, 1486:032029.
[7] Syahrini I, Sundari T, Iskandar T, et al. Mathematical model of parking space unit for triangular parking area[C]//4th International Conference on Operational Research. Lishon:IOP Publishing Ltd, 2018:012012.
[8] Ihda Hasbiyati, Widiawati Putri, Arisman Adnan, et al. Parking lot optimization in parallelogram using the concept area of rectangular and right triangle[J]. Pure and Applied Mathematics Journal, 2019, 8(4):77-82.
[9] Ferreira M, Damas L, Conceiçao H, et al. Self-automated parking lots for autonomous vehicles based on vehicular Ad hoc networking[C]//IEEE Intelligent Vehicles Symposium. Dearborn:IEEE, 2014:472-479.
[10] Timpner J, Friedrichs S, Van Balen J. k-stacks:high-density valet parking for automated vehicles[C]//Intelligent Vehicles Symposium. Seoul:IEEE, 2015:895-900.
[11] Banzhaf H, Quedenfeld F, Nienhuser D. High density valet parking using k-deques in driveways[C]//Intelligent Vehicles Symposium. Redondo Beach:IEEE, 2017:1413-1420.
[12] Nourinejad M, Bahrami S, Roorda M J. Designing parking facilities for autonomous vehicles[J]. Transportation Research Part B Methodological, 2018, 109:110-127.
[13] 徐涵喆, 黄逸彬, 杨赫, 等. 基于规则的城市地下车库外圈车位排布启发式算法[J]. 北京邮电大学学报, 2019, 42(4):102-108. Xu Hanzhe, Huang Yibin, Yang He, et al. Rule-based heuristic algorithm for parking spaces allocation in marginal area of urban underground parking lots[J]. Journal of Beijing University of Posts and Telecommunications, 2019, 42(4):102-108.
[14] Franzblau D S. Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles[J]. SIAM Journal on Discrete Mathematics, 1989, 2(3):307-321.
[15] McKenney M, Frye R, Dellamano M, et al. Multi-core parallelism for plane sweep algorithms as a foundation for GIS operations[J]. GeoInformatica, 2017, 21(1):151-174.
[16] Deng Yong, Liu Yang, Zhou Deyun. An improved genetic algorithm with initial population strategy for symmetric TSP[J]. Mathematical Problems in Engineering, 2015(3):1-6.
[17] Ali R, Mounir G, Moncef T. Adaptive probabilities of crossover and mutation in genetic algorithm for solving stochastic vehicle routing problem[J]. International Journal of Advanced Intelligence Paradigms, 2016, 8(3):318.
[18] Marini F, Walczak B. Particle swarm optimization(PSO) (A tutorial)[J]. Chemometrics and Intelligent Laboratory Systems, 2015, 149:153-165.
[19] Zhan Zhihui, Zhang Jun, Li Yun, et al. Adaptive particle swarm optimization[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B(Cybernetics), 2009, 39(6):1362-1381.

基于图形分割的城市地下车库车位排布优化方法

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

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

本文评价

[1]	彭艺吴桐杨青青. 下行 RIS-NOMA 系统交替优化波束形成方法[J]. 北京邮电大学学报, 2023, 46(4): 64-69.
[2]	周瑶, 孙俊, 罗会龙, 戴书浩. 基于拓扑优化的宽频超材料吸波体设计[J]. 北京邮电大学学报, 2023, 46(3): 84-90.
[3]	郑凤杨立. 基于PSO算法的RIS-MIMO联合波束成形方案[J]. 北京邮电大学学报, 2022, 45(5): 23-29.
[4]	叶晓彤, 刘周斌, 邵苏杰, 亓峰. 基于博弈论的WiFi接入资源动态分配算法[J]. 北京邮电大学学报, 2020, 43(2): 10-15,58.
[5]	徐涵喆, 黄逸彬, 杨赫, 周钟秉, 刘晓. 基于规则的城市地下车库外圈车位排布启发式算法[J]. 北京邮电大学学报, 2019, 42(4): 102-108.
[6]	杨福兴, 胡智超, 孔继利. 基于动态聚类混合拓扑结构粒子群算法的PDVRPTF[J]. 北京邮电大学学报, 2019, 42(1): 16-21.
[7]	李东京, 郝大贤, 王琦珑, 贠超. 多工位工作岛式抛光机器人工作空间分析及布局优化[J]. 北京邮电大学学报, 2018, 41(3): 92-100.
[8]	高志鹏, 颜奥娜, 杨杨, 邱雪松. 面向应急救援的多目标资源调度机制[J]. 北京邮电大学学报, 2017, 40(s1): 1-4,9.
[9]	侯蓉晖, 郭素霞. 车联网场景中时延受限内容传输方案[J]. 北京邮电大学学报, 2017, 40(3): 85-90.
[10]	王俊孙昕. FPLL环路性能分析及优化准则[J]. 北京邮电大学学报, 2013, 36(1): 50-53.
[11]	侯华李亘煊周武旸. 加权比例公平自适应粒子群跨层资源分配算法[J]. 北京邮电大学学报, 2012, 35(5): 59-62.
[12]	夏虹李增智. 粒子群算法求解Web服务组合中基于QoS的服务选择[J]. 北京邮电大学学报, 2009, 32(4): 63-67.