Abstract
This paper presents a novel column generation algorithm for managing the logistics activities performed by a fleet of multi-parcel chemical tankers. In our procedure, for providing elementary routes, the conventional dynamic programming routes-generator is replaced by an efficient continuous-time MILP-slave problem. The performance of the decomposition method is evaluated by solving several examples dealing with the operations of a shipping company operating in the Asia Pacific Region. Computational results show that the proposed approach outperforms a pure exact optimization model and an alternative heuristic solution method reported in the literature.
Sign-in/Register to access full text options 
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.
