In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic

Vehicle routing problems (VRP’s) involve assigning a fleet of limited capacity service vehicles to service a set of customers. This paper describes an innovative, agent-based approach to solving a real-world vehicle-routing problem embedded in a highly dynamic, unpredictable domain. Most VRP research, and all commercial products for solving VRP’s, make a static-world assumption, ignoring the dynamism in the real world. Our system is explicitly designed to address dynamism, and employs an in-time algorithm that quickly finds partial solutions to a problem, and improves these as time allows. Our fundamental innovation is a stochastic improvement mechanism that enables a distributed, agent-based system to achieve high-quality solutions in the absence of a centralized dispatcher