Polynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows

The capacitated vehicle routing problem with time windows (CVRPTW) is a well-known NP-hard combinatorial optimization problem. We present a further development of the approach first proposed by M. Haimovich and A. H. G. Rinnooy Kan and propose an algorithm that, for an arbitrary ε > 0, finds a (1...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the Steklov Institute of Mathematics Vol. 307; no. Suppl 1; pp. 51 - 63
Main Authors:	Khachai, M. Yu, Ogorodnikov, Yu. Yu
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Moscow Pleiades Publishing 01.12.2019 Springer Nature B.V
Subjects:	Algorithms Approximation Combinatorial analysis Mathematical analysis Mathematics Mathematics and Statistics Optimization Polynomials Queuing theory Route planning Traveling salesman problem Upper bounds Vehicle routing Windows (intervals) efficient polynomial-time approximation scheme time windows capacitated vehicle routing problem
ISSN:	0081-5438, 1531-8605
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!