Complexity of MLDP

We carry out an explicit examination of the NP-hardness of a bi- objective optimization problem to minimize distance and latency of a single-vehicle route designed to serve a set of client requests. In addition to being a Hamiltonian cycle the route is to minimize the traveled distance of the vehicle as well as the total waiting time of the clients along the route.

[1]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[2]  J. Monnot,et al.  The Traveling Salesman Problem and its Variations , 2014 .

[3]  Alfredo García Olaverri,et al.  A note on the traveling repairman problem , 2002, Networks.

[4]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[5]  J. Marcos Moreno-Vega,et al.  A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem , 2016, J. Oper. Res. Soc..

[6]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[7]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[8]  Satish Rao,et al.  Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[9]  Leena Jain,et al.  Traveling Salesman Problem: A Case Study , 2012, BIOINFORMATICS 2012.

[10]  R. Ravi,et al.  The Directed Minimum Latency Problem , 2008, APPROX-RANDOM.

[11]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

[12]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .