Abstract
AbstractThis paper proposes a heuristic procedure to solve the problem of scheduling and routing shipments in a hybrid hub‐and‐spoke network, when a given set of feasible discrete intershipment times is given. The heuristic procedure may be used to assist in the cooperative operational planning of a physical goods network between shippers and logistics service provider, or to assist shippers in making logistics outsourcing decisions. The objective is to minimise the transportation and inventory holding costs. It is shown through a set of problem instances that this heuristic procedure provides better solutions than existing economic order quantity‐based approaches. Computational results are presented and discussed.
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 Transactions in Operational Research
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.
