Abstract
The aim of this study is to develop a solution to the problem of distribution of goods proposed by the Mathematical Competitive Game 2017-2018, jointly organized by the French Federation of Mathematical Games and Mathematical Modelling Company. Referred to as a production-inventory-distribution-routing problem (PIDRP), it is an NP-hard combinatorial optimization problem, which received the least attention in the literature. The research is quantitative model-based and combines exact and heuristic methods to propose a multiple-phase resolution approach to PIDRP. The results show that the use of clusters ensures practical operational aspects and provides good feasible solutions for the PIDRP in short and long-term planning. The theoretical contribution of this study lies in the PIDRP modeling strategy, and the practical contribution consists in solving a real-life PIDRP-based using optimization techniques.
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.
