Complexity of MLDP

TL;DR

This paper investigates the NP-hardness of a bi-objective vehicle routing problem that aims to minimize both travel distance and client waiting time, highlighting its computational complexity.

Contribution

It provides an explicit proof of NP-hardness for a multi-objective vehicle routing problem involving distance and latency minimization.

Findings

Proves the NP-hardness of the bi-objective routing problem.

Highlights the computational challenges in optimizing routes for multiple objectives.

Focuses on the theoretical complexity of the problem.

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.