Premium
Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
Author(s) -
Vidović Milorad,
Popović Dražen,
Ratković Branislava,
Radivojević Gordana
Publication year - 2017
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12264
Subject(s) - variable neighborhood search , heuristic , mathematical optimization , container (type theory) , integer programming , integer (computer science) , pickup , matching (statistics) , routing (electronic design automation) , computer science , variable (mathematics) , vehicle routing problem , mathematics , metaheuristic , artificial intelligence , statistics , engineering , mechanical engineering , computer network , mathematical analysis , image (mathematics) , programming language
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.