A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct mutes in a nested parallel manner to obtain higher solution quality. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highlydoi:10.1016/s0360-8352(99)00086-8 fatcat:zbchnh42g5h7bfrlzoq7ln3aou