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 条
  • [41] Vehicle Routing Problem with time windows under availability constraints
    Dhahri, Amine
    Zidi, Kamel
    Ghedira, Khaled
    2013 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2013, : 308 - 314
  • [42] A parallel algorithm for the vehicle routing problem with time window constraints
    Schulze, J
    Fahle, T
    ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 585 - 607
  • [43] The vehicle routing problem with cross-docking and resource constraints
    Philippe Grangier
    Michel Gendreau
    Fabien Lehuédé
    Louis-Martin Rousseau
    Journal of Heuristics, 2021, 27 : 31 - 61
  • [44] A Hybrid Genetic Algorithm for Vehicle Routing Problem with Complex Constraints
    CHEN Yan
    International Journal of Plant Engineering and Management, 2006, (02) : 88 - 96
  • [45] A Vehicle Routing Heuristic Derived from altered problem constraints
    Robinson, Christopher
    2017 COMPUTING CONFERENCE, 2017, : 58 - 63
  • [46] Loading constraints for a multi-compartment vehicle routing problem
    Ostermeier, Manuel
    Martins, Sara
    Amorim, Pedro
    Huebner, Alexander
    OR SPECTRUM, 2018, 40 (04) : 997 - 1027
  • [47] A parallel algorithm for the vehicle routing problem with time window constraints
    J. Schulze
    T. Fahle
    Annals of Operations Research, 1999, 86 : 585 - 607
  • [48] An evolutionary algorithm for vehicle routing problem with real life constraints
    Confessore, Giuseppe
    Galiano, Graziano
    Stecca, Giuseppe
    MANUFACTURING SYSTEMS AND TECHNOLOGIES FOR THE NEW FRONTIER, 2008, : 225 - 228
  • [49] Loading constraints for a multi-compartment vehicle routing problem
    Manuel Ostermeier
    Sara Martins
    Pedro Amorim
    Alexander Hübner
    OR Spectrum, 2018, 40 : 997 - 1027
  • [50] The vehicle routing problem with cross-docking and resource constraints
    Grangier, Philippe
    Gendreau, Michel
    Lehuede, Fabien
    Rousseau, Louis-Martin
    JOURNAL OF HEURISTICS, 2021, 27 (1-2) : 31 - 61
12345