THE IMPACT OF DEMAND PATTERNS ON HEURISTIC ALGORITHM STABILITY IN THE VEHICLE ROUTING PROBLEM

摘要

This study examines algorithm performance when demand locations are geographically dispersed. An experiment using three heuristic algorithms is conducted on problems with varying demand patterns in order to analyze the stability of algorithm performance when facing different patterns. Results indicate that the some algorithms perform better on problems with actual clustering and non-symmetry patterns seen in actual routing networks. The study has implications for practitioners and routing software developers who must consider the nature of actual demand in business environments.