A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
Computers & OR, Volume 84, Issue C, 2017, Pages 116-126.
a matheuristic based for the VRPCD is proposed.the method is based on large neighborhood search search and branch-and-check.this method improves many best known solutions. The vehicle routing problem with cross-docking (VRPCD) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a se...More
Full Text (Upload PDF)
PPT (Upload PPT)