An ant based simulation optimization for vehicle routing problem with stochastic demands

• Main Authors: Tripathi, Mukul, Kuriger, Glenn, Wan, Hung-da
• Format: Conference Proceeding
• Language: English
• Subjects: Computing methodologies > Modeling and simulation > Simulation evaluation; Computing methodologies > Modeling and simulation > Simulation types and techniques; Mathematics of computing > Mathematical analysis > Mathematical optimization; Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis > Routing and network design problems; Theory of computation > Design and analysis of algorithms > Mathematical optimization
• DOI: 10.5555/1995456.1995794

The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it manages the distribution of goods to make an efficient transportation system. Considering a practical application, this paper solves a vehicle routing problem with stochastic demand (VRPSD) in which the customer demand has been modeled as a stochastic variable as opposed to conventional VRP. To deal with the additional computational complexity, this paper uses a simulation optimization approach to solve the VRPSD. To enhance the algorithm performance, a neighborhood-search embedded Adaptive Ant Algorithm (ns-AAA), an improved Ant Colony Optimization approach, is proposed. The performance of the proposed methodology is benchmarked against a set of test instances generated using Design of Experiment (DOE) techniques. The results verified the robustness of the proposed algorithm against Ant Colony Optimization and Genetic Algorithm, over which it always demonstrated better results, thereby proving its supremacy on the concerned problem.