Show simple item record

dc.contributor.authorManyam, Satyanarayana G.
dc.contributor.authorRathinam, Sivakumar
dc.contributor.authorDarbha, Swaroop
dc.date.accessioned2017-05-09T01:16:41Z
dc.date.available2017-05-09T01:16:41Z
dc.date.issued2015
dc.identifier.issn0022-0434
dc.identifier.otherds_137_09_094501.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/157602
dc.description.abstractThis paper considers the problem of planning paths for a collection of identical vehicles visiting a given set of targets, such that the total lengths of their paths are minimum. Each vehicle starts at a specified location (called a depot) and it is required that each target to be on the path of at least one vehicle. The path of every vehicle must satisfy the motion constraints of every vehicle. In this paper, we develop a method to compute lower bound to the minimum total path lengths by relaxing some of the constraints and posing it as a standard multiple traveling salesmen problem (MTSP). A lower bound is often important to ascertain suboptimality bounds for heuristics and for developing stopping criterion for algorithms computing an optimal solution. Simulation results are presented to show that the proposed method can be used to improve the lower bounds of instances with four vehicles and 40 targets by approximately 39%.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleComputation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints
dc.typeJournal Paper
dc.journal.volume137
dc.journal.issue9
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.4030354
dc.journal.fristpage94501
dc.journal.lastpage94501
dc.identifier.eissn1528-9028
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2015:;volume( 137 ):;issue: 009
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record