Design of Modeling & Simulation Optimization Systems for SDVRP Based on Arena
Considering the inherent complexity of split delivery vehicle routing problem (SDVRP) and its difficulty in analytical solution,asimulation-based optimization framework that integrates heuristic rulesfor traveling salesman problem (TSP) and discrete event simulation (DES) was established to solve SDVRP.Besides this,we proposed a new modeling solution philosophy for the problems.By this way,a general-purpose and powerful simulator,Arena,was employed for modeling SDVRP firstly.And a Hold-Delay-Remove rule was recommended to improve the modeling capability.Then a heuristics algorithmnamed greedy algorithmwas utilized to find the optimal routing for solving traveling salesman problem.With the integration between simulation model and optimization model,various stochastic factors could be considered in model,it improves the capability for modeling the real-life systems.Experiment demonstrates that this methodology can solve large-scale and complicated SDVRP efficiently.
SDVRP simulation split policy optimization
Yanchun Pan Liang Yan
College of Management Shenzhen University Shenzhen,China
国际会议
深圳
英文
158-163
2013-06-01（万方平台首次上网日期，不代表论文的发表时间）