HYBRID INSERTION HEURISTICS FOR VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS

抄録

 This paper presents a hybrid insertion heuristics (HIH) for the Vehicle Routing and scheduling Problem with Soft Time Windows (VRPSTW) that can be used as an analysis tool to evaluate the effectiveness of many infrastructure planning and management measures belonging to City Logistics such as cooperative delivery systems and ideal location of logistics terminals. The dual information obtained in the column generation master problem was used to guide the optimization in the HIH. Consequently the objective function rapidly converged to a good solution, which resulted in better performance as compared to a simple genetic algorithms heuristics and to another hybrid heuristics.