An Efficient Lagrangian Relaxation Algorithm for the Shared Parking Problem

拉格朗日松弛 拉格朗日乘数 数学优化 放松(心理学) 启发式 拉格朗日 集合(抽象数据类型) 计算机科学 闲置 乘数(经济学) 数学 算法 应用数学 经济 社会心理学 操作系统 心理学 宏观经济学 程序设计语言
作者
Zhenpeng Tang,Yanping Jiang,Feifei Yang
出处
期刊:Computers & Industrial Engineering [Elsevier BV]
卷期号:176: 108860-108860 被引量:25
标识
DOI:10.1016/j.cie.2022.108860
摘要

In recent years, with the significant increase in the number of motor vehicles in big cities, parking difficulties have become increasingly prominent. It is crucial for alleviating the problem to tap the potential of idle parking spaces. We study how to make the most of the shared idle parking spaces to provide intelligent and efficient parking services for parking demanders by optimizing the allocation of the parking spaces. First, concerning the rigid requirements of the demanders on the parking rates and the walking distances, a matching model is developed with the objective of maximizing the utilization of shared parking spaces. In this model, the parking time intervals of parking demanders and the available time intervals of shared parking spaces are generalized to real intervals from integer intervals in previous related research. Second, the model is analyzed and proved to be NP-complete. A Lagrangian relaxation algorithm is considered to solve the model efficiently since the relaxation model becomes much easier to solve if a certain set of constraints are dropped. The novel points of the Lagrangian relaxation algorithm include two algorithms BDP (Bottom-up Dynamic Programming) and GH (Greedy Heuristic). The Lagrangian relaxation algorithm repeats three processes with different Lagrangian multiplier determined by the sub-gradient method until the stop-criteria is met: (1) find upper bounds based on algorithm BDP; (2) find lower bounds by algorithm GH. (3) update the Lagrangian multiplier. Finally, we conduct the experiments to simulate a realistic scenario where the commuters share idle parking spaces to the platform and drivers find parking spaces for some daily activities. The results show that our algorithm has high computational efficiency and accuracy. The efficiency advantage is distinct, especially when the computational scale of the problem is large. In addition, the final upper bound obtained by our algorithm is validated to be tight.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
2秒前
chenqj发布了新的文献求助10
3秒前
3秒前
4秒前
4秒前
Caius完成签到 ,获得积分10
4秒前
Sci666完成签到 ,获得积分10
5秒前
yaro完成签到,获得积分10
5秒前
6秒前
流萤完成签到,获得积分10
6秒前
6秒前
阿白发布了新的文献求助10
7秒前
7秒前
mrjohn发布了新的文献求助10
7秒前
orixero的应助被苏邑采纳,获得10
7秒前
flexiblemonkeys完成签到,获得积分10
8秒前
风吹麦浪的应助被名古邬采纳,获得20
9秒前
orixero的应助被Rainvin采纳,获得10
10秒前
自信的牛排完成签到 ,获得积分10
10秒前
fdyy1完成签到,获得积分10
11秒前
漫漫发布了新的文献求助10
11秒前
姜OMG发布了新的文献求助10
11秒前
cgliuhx发布了新的文献求助10
11秒前
QQ发布了新的文献求助10
11秒前
小小发布了新的文献求助10
12秒前
Dee完成签到,获得积分10
12秒前
所所的应助被Re采纳,获得10
12秒前
啊啊啊完成签到,获得积分10
12秒前
麦当劳没有Creazy4完成签到,获得积分10
13秒前
14秒前
14秒前
15秒前
15秒前
大个的应助被angki77采纳,获得10
15秒前
15秒前
专注的代天完成签到,获得积分10
16秒前
Gatto完成签到,获得积分10
16秒前
17秒前
17秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Boundaries and Bodhisattvas 500
高分子基功能界面水蒸发材料与应用研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8181408
求助须知:如何正确求助?哪些是违规求助? 9571330
关于积分的说明 21817615
捐赠科研通 7777856
什么是DOI,文献DOI怎么找? 3433479
关于科研通互助平台的介绍 2557696
邀请新用户注册赠送积分活动 2479527