Abstract
Hazardous POL is Inflammable and explosive dangerous chemical product, so a vehicle loaded with hazardous POL is under strictly transportation speed limit for security reasons, which cause that transportation cost per distance of a vehicle loaded with hazardous POL is more than that of an empty vehicle. Optimization of hazardous POL transportation problem (HPOLTP) is a common problem in the chemical industry, the decision maker has to find the optimal route that satisfies the following criteria: the least cost. The genetic algorithm (GA) has often been used to solve this NP-hard problem. However, the GA has to run repeatedly with its random search process before finding a relatively good solution. Besides, the algorithm is easy to fall into the local optimum trap. To overcome the defects, this paper puts forward a hybrid method called SAGA. The purpose is to find the global optimal solution without premature convergence. Several classic functions with lots of local minimum points were chosen to verify the performance of the SAGA. The test shows that the algorithm boasts stronger global searching ability than the GA. Then, the SAGA was applied to solve a typical HPOLTP. The results demonstrate that the SAGA can provide more reliable solution than the GA.
