| Summary: | 碩士 === 國立交通大學 === 資訊管理研究所 === 83 === A method has been proposed here for finding the global minimum
of nonlinear vehicle routing problems. We first transform a
nonlinear vehicle problem containing binary variables into a
nonlinear program with continuous variables, based on the fact
"iff x is a 0-1 variable then x - x2 = 0". Such a nonlinear
program is then converted into a penalty function program. A
stochastic global approach of searching most of the local
optima in the penalty function program, based on the Multi-
Level Single Linkage method, is performed to successfully find
the approximated global optimum of the original nonlinear
vehicle routing problem at a significant level of 99.5%. The
solution algorithm is performed by parallel processes to reach
approximately global optimal solution at reasonable time.
|
|---|
