Abstract
• A mathematical model for the joint cargo allocation and vessel scheduling problem is developed. • A benders-decomposition algorithm as well as valid inequalities are proposed to solve the problem. • The model reflects the practical dynamics with realistic estimations for the arrival/departure times of vessels. • The problem is tested over 24 realistic instances. • The results indicate the proposed model helps decision makers to examine different solution alternatives for each shipment. A mixed integer linear programming model is presented for the operational level cargo allocation and vessel scheduling problem of a liner shipping company in Turkey, where flow-dependent port-stay lengths, transit times and transshipment synchronizations are considered. The proposed model aims to assign shipments to routes to decrease total tardiness and construct partial vessel schedules for establishing coordination with port authorities to comply with the berthing time windows. In addition to the mathematical model, novel valid inequalities and benders decomposition algorithm are implemented. Performance of the developed algorithm is evaluated on real-life problem instances. The results show that benders decomposition with valid inequalities yields the best performance.
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.
