Forward Greedy Heuristic Algorithm for N-Vehicle Exploration Problem(NVEP)

This paper introduces the N-Vehicle Exploration Problem (NVEP), and some properties of it. Then based on the previous work of Backward Greedy Heuristic Algorithm (BGH) [11], a improved algorithm, called Forward Greedy Heuristic Algorithm (FGH) has been put forward. It is proposed from the opposite direction of BGH, and has the same complexity as BGH, of which is O(n⁴). Last, the compared results calculated by ten cases from [6] show that FGH has a better effectiveness.