MODELING VEHICLE ROUTING PROBLEM WITH PICK-UPTIME CONSTRAINT FOR MULTIMODAL TRANSPORTATION

摘要

Railway transportation has strict constraint for the pick-up time of goods in motor-rail multimodal transportation, logistics center also doesn t hope the goods arrive prematurely since it will cause additional storage fee. It is important to optimize the vehicle-routing of the goods transportation to ensure the pick-up and delivery of all goods can be finished within the deadline. This paper introduces time window concept, and puts forward the vehicle routing problem under the condition of motor-rail multimodal transportation, and establishes the optimization mode that the upper bound is hard time window limitation, while the lower limit is soft. So the residual-loading-capacity concept is defined, taking it as a constraint whether that of each task can meet its requirement for the goods transportation. A modified C-W algorithm is designed to solve the model, the empirical analysis confirm that the proposed model and algorithm can solve goods operations with pick-up and delivery at the same time and its extension problem.