Lower bounds for a vehicle routing problem with motion constraints

被引：0

作者：

Manyam, Satyanarayana G. ^{[1
]}

Rathinam, Sivakumar ^{[1
]}

Darbha, Swaroop ^{[1
]}

Obermeyer, Karl J. ^{[2
]}

机构：

[1] Department of Mechanical Engineering, Texas A and M University, College Station,TX, United States

[2] Obermeyer Labs, Fort Collins,CO, United States

来源：

International Journal of Robotics and Automation | 2015年 / 30卷 / 03期

关键词：

Given a set of targets that needs to be monitored and a vehicle; we consider a combinatorial motion planning problem where the objective is to find a path for the vehicle such that each target is visited at least once by the vehicle: the path satisfies the motion constraints of the vehicle and the length of the path is a minimum. This is an NP-hard problem; and currently; there are no algorithms that can find an optimal solution to this problem. In this paper; we model the motion of the vehicle as a Dubins car and develop a method that can provide lower bounds to the motion planning problem. Lower bounds are important because they can be used to corroborate the quality of the solutions produced by the heuristics or the approximation algorithms. We obtain a lower bound by relaxing the constraints corresponding to the angle of approach at each of the targets and then penalizing them whenever they are violated. The solution to the Lagrangian relaxation gives a lower bound; and this lower bound is maximized over the penalty variables using sub-gradient optimization. Simulation results to compare the proposed lower bound with the existing lower bounds are presented;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Journal article (JA)

引用

页码：207 / 215

共 50 条

[21] The vehicle routing problem with service level constraints
Bulhoes, Teobaldo
Minh Hoang Ha
Martinelli, Rafael
Vidal, Thibaut
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (02) : 544 - 558
[22] Vehicle Routing Problem with Load Compatibility Constraints
Ramachandran, Parthasarathy
2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 339 - 343
[23] A Survey on Vehicle Routing Problem with Loading Constraints
Wang, Fan
Tao, Yi
Shi, Ning
INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 602 - 606
[24] Lower bounds for the mixed capacitated arc routing problem
Gouveia, Luis
Mourao, Maria Candida
Pinto, Leonor Santiago
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (04) : 692 - 699
[25] NEW LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
PEARN, WL
NETWORKS, 1988, 18 (03) : 181 - 191
[26] Optimal Vehicle Routing with Lower and Upper Bounds on Route Durations
Bektas, Tolga
Lysgaard, Jens
NETWORKS, 2015, 65 (02) : 166 - 179
[27] VEHICLE ROUTING PROBLEM WITH SEQUENCING CONSTRAINTS - SIMULATION ANALYSIS
COOK, TM
RUSSELL, RA
BLAIR, TC
OPERATIONS RESEARCH, 1975, 23 : B379 - B379
[28] Solving Vehicle Routing Problem with Time Window Constraints
Chen, J. C.
Chiang, C. S.
Chen, B. B.
Chen, C. W.
2007 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1-3, 2007, : 934 - +
[29] A hybrid algorithm for a vehicle routing problem with realistic constraints
Zhang, Defu
Cai, Sifan
Ye, Furong
Si, Yain-Whar
Trung Thanh Nguyen
INFORMATION SCIENCES, 2017, 394 : 167 - 182
[30] Linear Formulations for the Vehicle Routing Problem with Synchronization Constraints
Lopez-Aguilar, E.
Boyer, V.
Salazar-Aguilar, M. A.
Sbihi, M.
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2018, 57 (03) : 453 - 462

← 1 2 3 4 5 →