TY - JOUR PY - 1997// TI - A spatial and temporal bi‐criteria parallel‐savings‐based heuristic algorithm for solving vehicle routing problems with time windows JO - Transportation planning and technology A1 - Tzeng, Gwo‐Hshiung A1 - Huang, Wen‐Chang A1 - Teodorović, Dušan SP - 163 EP - 181 VL - 20 IS - 2 N2 - This paper proposes a spatial and temporal bi?criteria parallel?savings?based heuristic algorithm for solving vehicle?routing problems with time windows. The purpose of the algorithm is to reduce transportation costs and to satisfy the specific times, within time windows, which are required by customers. For evaluating the performance of the algorithm, two separate sets of time windows are created by generating data randomly. The test results reveal that both the preciseness and stability of the solutions perform much better than those based on the insertion method.
LA - en SN - 0308-1060 UR - http://dx.doi.org/10.1080/03081069708717586 ID - ref1 ER -