A possible heuristic to solve metropolitan area vehicle routing problems with variable vehicle speeds is suggested in this research. Delivery hours are classified into 4 different time zones to make variable vehicle speeds no change within the same time zone to make TDVRP simple to solve. The suggested heuristic consists of 2 stages such as initial solution development step and initial solution improvement step. A computer program using C++ is constructed to evaluate the suggested heuristic. Randomly generated vehicle routing problems are used for the experiments. This heuristic could be helpful to logistics companies by increasing delivery efficiencies since the 4 zone classification is taken from the observed traffic information offered by a local government.

• 문기주(동아대학교 산업경영공학과) | Geeju Moon Corresponding Author
• 박성미(동아대학교 산업경영공학과) | Sungmee Park