Abstract
The multicommodity location-allocation problem with balancing requirements is related to one of the major logistics issues faced by distribution and transportation firms: the management of the fleet of vehicles over a medium to long-term planning horizon. We present a dual-ascent approach for this formulation which may be used either to obtain a good heuristic solution, or to compare sharp bounds in a branch-and-bound scheme. We present and compare two variants of this approach, and analyze their performances both on a large number of randomly generated problems and on a large-scale application to the strategic/tactical planning of the land operations of an international maritime container shipping firm. Our results demonstrate that a dual-ascent approach is highly effective in this context.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
