A new four index formulation to the HVRPTW is presented.
The proposed meta-heuristics algorithm works in a single-step fashion.
Both path choice and routing are dealt using concept of Pareto optimization.
Application of the model to a realistic HVRPTW instance is illustrated.
Algorithms' efficiency to solve complex HVPRTW in reasonable run time is shown.