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 条

[1] LOWER BOUNDS FOR A VEHICLE ROUTING PROBLEM WITH MOTION CONSTRAINTS
Manyam, Satyanarayana G.
Rathinam, Sivakumar
Darbha, Swaroop
Obermeyer, Karl J.
INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2015, 30 (03): : 207 - 215
[2] Computation of Lower bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints
Manyam, Satyanarayana G.
Rathinam, Sivakumar
Darbha, Swaroop
2013 IEEE 52ND ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2013, : 2378 - 2383
[3] Computation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints
Manyam, Satyanarayana G.
Rathinam, Sivakumar
Darbha, Swaroop
JOURNAL OF DYNAMIC SYSTEMS MEASUREMENT AND CONTROL-TRANSACTIONS OF THE ASME, 2015, 137 (09):
[4] COMPUTATION OF A LOWER BOUND FOR A VEHICLE ROUTING PROBLEM WITH MOTION CONSTRAINTS
Manyam, Satyanarayana G.
Rathinam, Sivakumar
Darbha, Swaroop
Obermeyer, Karl J.
PROCEEDINGS OF THE ASME 5TH ANNUAL DYNAMIC SYSTEMS AND CONTROL DIVISION CONFERENCE AND JSME 11TH MOTION AND VIBRATION CONFERENCE, DSCC 2012, VOL 2, 2012, : 687 - 693
[5] Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem
Fukasawa, Ricardo
Poirrier, Laurent
INFORMS JOURNAL ON COMPUTING, 2017, 29 (03) : 544 - 557
[6] Lower bounds and an exact method for the capacitated vehicle routing problem
Baldacci, Roberto
Mingozzi, Aristide
2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1536 - 1540
[7] A new variant of a vehicle routing problem: Lower and upper bounds
Glaab, H
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (03) : 557 - 577
[8] Improved lower bounds for the Split Delivery Vehicle Routing Problem
Moreno, Lorenza
de Aragao, Marcus Poggi
Uchoa, Eduardo
OPERATIONS RESEARCH LETTERS, 2010, 38 (04) : 302 - 306
[9] Lower and upper bounds for the m-peripatetic vehicle routing problem
Ngueveu, Sandra Ulrich
Prins, Christian
Calvo, Roberto Wolfler
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (04): : 387 - 406
[10] New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Subramanian, Anand
Uchoa, Eduardo
Ochi, Luiz Satoru
EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2010, 6049 : 276 - +

← 1 2 3 4 5 →