Back to Search Start Over

Complexity of MLDP

Authors :
Arellano-Arriaga, Nancy A.
Molina, Julián
Schaeffer, Satu Elisa
Álvarez-Socarrás, Ada M.
Martínez-Salazar, Iris A.
Publication Year :
2018

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.<br />Comment: 6 pages, 1 figure

Subjects

Subjects :
Computer Science - Computational Complexity
Computer Science - Data Structures and Algorithms
90C60

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.1809.02656
Document Type :
Working Paper

Tools

Authors Abstract Subjects Details