Complexity of MLDP
Computational Complexity
2018-09-11 v1 Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.1809.02656,
title = {Complexity of MLDP},
author = {Nancy A. Arellano-Arriaga and Julián Molina and Satu Elisa Schaeffer and Ada M. Álvarez-Socarrás and Iris A. Martínez-Salazar},
journal= {arXiv preprint arXiv:1809.02656},
year = {2018}
}
Comments
6 pages, 1 figure