Abstract
The aim of this paper is to present mixed integer linear programming formulations for the production routing problem with backordering (PRP-B) and a new hybrid heuristic to solve the problem. The PRP-B is considered in the context of a supply chain consisting of a production facility with limited production and storage capacities and geographically dispersed points of sale with limited storage capacities. The PRP-B integrates multiple item lot sizing decisions and vehicle routing decisions to the points of sale, where backordering of end customer demands is allowed at a penalty. Two integrated mixed integer programming models are formulated and a solution procedure consisting of a relax-and-fix heuristic combined with a local search algorithm is proposed. The numerical results show that this hybrid heuristic outperforms a state-of-the-art MIP commercial solver, in terms of solution quality and CPU times.
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.
