This paper proposes a heuristic, Tabu-Perturbation Algorithm (TPA), to efficiently and effectively solve Vehicle Routing Problem with Hard Time Window Constraints (VRPHTW). TPA integrates Tabu Search (TS) and Noising Method (NM). A software system is developed based on it and is used in a company that delivers equipment spare parts to the plants manufacturing semiconductor wafers and TFT-LCDs. VRPHTW is NP-hard due to the NP-hardness of Vehicle Routing Problem (VRP). Previous work on VRPHTW includes both optimization algorithms and heuristic approaches, but current research focuses on heuristic approaches. This research proposes a heuristic TPA, integrating TS and NM, to solve VRPHTW. TPA consists of three phases: route construction, local search improvement, and generic search improvement.