Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem

摘要

This paper addresses the problem of vehicle routing in drayage operations, where vehicles can carry containers of different sizes. The multisize container drayage problem with time windows is modeled as a multiple matching problem and formulated as a mixed integer linear program (MILP) model. The proposed MILP model determines optimal pickup and delivery routes of vehicles and is applicable to any type of vehicles capable of simultaneously transporting any arbitrary number of 20- and 40-ft containers. To solve larger sized problems, we proposed a variable neighborhood search (VNS) heuristic. Both MILP and VNS approaches have been tested on numerous test instances and their performances are reported.