A Three-phase Heuristic Algorithm Solving the Vehicle Routing Problem with Time Windows and Traffic Lights
Classical models of vehicle routing problem with time windows consider the vehicle running process as a continuous process.In fact the running process is usually a segmentable process because of red lights,traffic jams and so on.In this paper we introduce the traffic lights into VRP problem and build a vehicle routing problem model with time windows and traffic lights,then we propose a three-phase heuristic algorithm based on tabu search to solve it.Experiment results show that the algorithm can solve the problem efficiently.
Vehicle routing problem segmentable process traffic lights three-phase heuristic algorithm
Huawei Ma Minglun Ren Shanlin Yang
School of Management,Hefei University of Technology,Hefei 230009,China;Key Laboratory of Process Optimization and Intelligent Decision-making,Ministry of Education,Hefei 230009,China
国际会议
长沙
英文
503-510
2008-10-28(万方平台首次上网日期,不代表论文的发表时间)