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的目标函数具有分式形式，其一般情况的计算复杂度至今尚未明确。我们证明哈密顿路径问题 $\leq_P$ NVEP，并验证NVEP是NP完全的。