Abstract

AbstractIn this paper, we study a distance constrained vehicle routing problem with time windows (DVRPTW). DVRPTW is defined as follows: given a metric space on a set of vertices, a release time and a deadline for each vertex, a length bound D, find a minimum cardinality set of tours originating at the depot that covers all vertices, such that each tour has length at most D, and visit as many vertices as possible within their time windows. We give a bicriteria approximation algorithm for DVRPTW on the metric plane, and all the distances satisfy the triangle inequality.KeywordsMetric spaceDVRPTWApproximation algorithm

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call