2003 · 32 citations · 17 references
EngineeringIndustrial EngineeringOperations ManagementOptimizationTransportationTransportation EngineeringCombinatorial OptimizationHeuristic OptimizationInteger ProgrammingReal-time OptimizationReal-time SchedulingRoute PlanningMixed-integer OptimizationMixed-integer ProgrammingOrthogonal ArraysRolling Horizon SchedulingTabu SearchTime WindowsVehicle RoutingVehicle Routing Problems
Abstract: The real-time vehicle routing problem with time windows and simultaneous delivery/pickup demands (RT-VRPTWDP) is formulated as a mixed integer programming model which is repeatedly solved in the rolling time horizon. The real-time delivery/pickup demands are served by capacitated vehicles with limited initial loads. Moreover, pickup services aren’t necessarily done after delivery services in each route. A heuristic comprising of route construction, route improvement and tabu search is proposed. The route improvement procedure follows the general guidelines of anytime algorithm. Numerical examples made up by Gé linas were taken with modification for validation. Based on Taguchi orthogonal arrays approach, the optimal parameter setting for tabu search is set through experimentations on the RT-VRPTWDP. The results show that the proposed algorithm can efficiently decrease the total route cost. Key Words: vehicle routing problem with time window, real time demands, anytime
17