When an intelligent connected vehicle (ICV) autonomously completes an intelligent driving assignment, the decision planning layer needs to plan an optimal path from the starting location to the target location for the vehicle, which is referred to as global path planning (GPP) for the ICV. For the GPP of ICVs undertaking long-distance and multi-location driving assignments, a fixed open travelling salesman problem (TSP) was constructed in conjunction with travel time analysis. To better address this issue, a genetic annealing algorithm (GAA) was proposed, and corresponding simulations were conducted using genetic algorithm, ant colony algorithm, and GAA respectively. Based on the optimization processes and results, the GAA outperformed the traditional genetic algorithm and ant colony algorithm in tackling this issue. Therefore, the method proposed in this paper can be applied to the global path planning platform for intelligent networked vehicles.