Optimal allocation and route design for station-based drone inspection of large-scale facilities

无人机 列生成 数学优化 拉格朗日松弛 计算机科学 整数规划 掉期(金融) 本德分解 设施选址问题 可靠性工程 工程类 数学 遗传学 生物 财务 经济
作者
Lei Cai,Jiliu Li,Kai Wang,Zhixing Luo,Hu Qin
出处
期刊:Omega [Elsevier BV]
卷期号:130: 103172-103172 被引量:22
标识
DOI:10.1016/j.omega.2024.103172
摘要

The utilization of drones to conduct inspections on industrial electricity facilities, including large-sized wind turbines and power transmission towers, has recently received significant attention, mainly due to its potential to enhance inspection efficiency and save maintenance costs. Motivated by the advantages of drones for facility inspection, we present a novel station-based drone inspection problem (SDIP) for large-scale facilities. The objective of SDIP is to determine the locations of multiple homogeneous automatic battery swap stations (ABSSs) equipped with drones, assign facility inspection tasks to the ABSSs with operation duration constraints, and design drone inspection routes with battery capacity constraints, such that minimize the sum of fixed ABSS costs and drone travel costs. The SDIP can be regarded as a variant of the location-routing problem, which is NP-hard and difficult to solve optimally. To obtain the optimal solution of SDIP efficiently, we firstly formulate this problem into an arc based formulation and a route based formulation, and then develop a logic-based Benders decomposition (LBBD) algorithm to solve it. The SDIP is decomposed into a master problem (MP) and a set of subproblems (SPs). The MP is solved by a branch-and-cut (BC) procedure. Once a feasible integer solution is found, the linear relaxation of SPs are solved by a stabilized column generation to generate Benders cuts. If the cost of all the SPs' optimal LP solutions plus the cost of the MP's solution is less that current best cost, the SPs are exactly solved by a Branch-and-Price (BP) algorithm to generate the logic cuts. The numerical results on five scales of randomly generated instances validate the effectiveness of the LBBD algorithm. Specifically, the LBBD can solve all small- and middle-sized instances, and seven out of ten large-sized instances in 1000 s. Furthermore, we conduct a sensitivity analysis by varying the attributes of ABSSs and drones, and provide valuable managerial insights for large-scale facility inspection.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
huhuhu完成签到,获得积分10
刚刚
恋悠完成签到,获得积分10
刚刚
刚刚
刚刚
杂粮奶酪包完成签到,获得积分10
刚刚
打打应助朴素天问采纳,获得10
刚刚
刚刚
ddssa1988完成签到,获得积分10
1秒前
1秒前
奈奈生完成签到,获得积分10
1秒前
2秒前
Sherry发布了新的文献求助10
2秒前
2秒前
桐桐应助包容煎饼采纳,获得10
2秒前
xuhui完成签到,获得积分10
3秒前
MJC发布了新的文献求助10
3秒前
3秒前
123完成签到,获得积分20
3秒前
听你说完成签到,获得积分10
3秒前
3秒前
尘归尘发布了新的文献求助10
3秒前
芝士发布了新的文献求助10
3秒前
我是老大应助零渊采纳,获得10
3秒前
顾矜应助小忆时代采纳,获得10
3秒前
4秒前
哎哟喂发布了新的文献求助10
4秒前
4秒前
4秒前
奈奈生发布了新的文献求助10
4秒前
艾笙发布了新的文献求助10
5秒前
务实金毛发布了新的文献求助10
5秒前
123发布了新的文献求助10
6秒前
6秒前
脑洞疼应助畔畔采纳,获得30
6秒前
隐形曼青应助爱上下雨天采纳,获得10
7秒前
v0id应助研友_LavApn采纳,获得10
8秒前
龙在天发布了新的文献求助10
8秒前
水煮电吹风应助SSY采纳,获得10
8秒前
xing_xing应助SSY采纳,获得20
9秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Navigating Normative Orders. Interdisciplinary Perspectives 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
A Case Study on Hotels as Noncongregate Emergency Living Accommodations for Returning Citizens 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7756867
求助须知:如何正确求助?哪些是违规求助? 9303333
关于积分的说明 20273662
捐赠科研通 7340345
什么是DOI,文献DOI怎么找? 3311642
关于科研通互助平台的介绍 2462540
邀请新用户注册赠送积分活动 2325267