A General Algorithm for Rectangular Parking Optimization Design

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The optimization design of parking is a comprehensive programming solution with a relatively large practical value. Determining the optimal design of the parking lot is the main goal of this paper. Before the algorithm design, this paper first deduces the calculation formula of the width of the lane in the parking lot; then refines the parking lot design problem into the choice of the layout of the double-side parking channel and the layout of the single-side parking channel, and the choice scheme is based on the greedy algorithm. On this basis, we establish a general optimization design algorithm for the rectangular parking lot, which is essentially a programming algorithm. Finally, this paper selects an example to solve the general algorithm by SA algorithm. It proves that the general algorithm meets the requirements and has practical value.

Cite

CITATION STYLE

APA

Huang, J., Liao, T., Kang, H., & Wang, J. (2020). A General Algorithm for Rectangular Parking Optimization Design. In Journal of Physics: Conference Series (Vol. 1486). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1486/3/032029

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free