The $n$-vehicle exploration problem (NVEP) is a combinatorial optimization problem, which tries to find an optimal permutation of a fleet to maximize the length traveled by the last vehicle. NVEP has a fractional form of objective function, and its computational complexity of general case remains open. We show that Hamiltonian Path $\leq_P$ NVEP, and prove that NVEP is NP-complete.

翻译：$n$-车辆探索问题（NVEP）是一个组合优化问题，旨在寻找车队的最优排列以最大化最后一辆车的行驶距离。NVEP的目标函数呈分数形式，其一般情况的计算复杂度尚未明确。我们证明了哈密顿路径问题可多项式归约到NVEP，并据此证明NVEP是NP完全的。