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$车探索问题是一种组合优化问题，旨在寻找车队的最优排列，以最大化最后一辆车行驶的距离。该问题的目标函数具有分式形式，其一般情况下的计算复杂度尚未明确。我们证明哈密顿路径问题可多项式归约为$n$车探索问题，并由此证明$n$车探索问题是NP完全的。