A general heuristic for vehicle routing problems
Computers and Operations Research
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
Computers and Operations Research
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
Computers and Operations Research
The open vehicle routing problem with fuzzy demands
Expert Systems with Applications: An International Journal
| Hi-index | 12.05 |
In the open vehicle routing problem (OVRP), the objective is to minimize the number of vehicles and the total distance (or time) traveled. This study primarily focuses on solving an open vehicle routing problem (OVRP) by applying a novel hybrid genetic algorithm and the Tabu search (GA-TS), which combines the GA's parallel computing and global optimization with TS's Tabu search skill and fast local search. Firstly, the proposed algorithm uses natural number coding according to the customer demands and the captivity of the vehicle for globe optimization. Secondly, individuals of population do TS local search with a certain degree of probability, namely, do the local routing optimization of all customer sites belong to one vehicle. The mechanism not only improves the ability of global optimization, but also ensures the speed of operation. The algorithm was used in Zhengzhou Coal Mine and power Supply Co., Ltd.'s transport vehicle routing optimization.