Abstract
In collaborative logistics, multiple carriers form an alliance to optimise their transportation operations through sharing transportation tasks and vehicle capacities. We study a carrier collaborative planning problem with less than truckload transportation, where each capacitated vehicle may deliver multiple products from multiple origins to multiple destinations. Based on a mixed integer programming model, a benders decomposition approach which combines Pareto-optimal cuts and minimal infeasible subsystems cuts is proposed for the problem. From the solution of the model, a set of feasible vehicle tours can be constructed. Ninety randomly generated instances demonstrate the effectiveness of our benders decomposition approach.
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 callMore From: International Journal of Modelling in Operations Management
Disclaimer: 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.
