Abstract
AbstractPath relinking has been used for solving deterministic problems by exploring the neighborhood of elite solutions in an intelligent way. We present an algorithm that combines a mixed‐integer linear solver with a truncated path‐relinking method in order to solve two‐stage stochastic integer problems with complete recourse and first‐stage integer variables. This method takes advantage of a possible scenario‐based decomposition in an innovative way. Therefore, path relinking is used to combine optimized solutions from different scenarios in order to pursue good stochastic solutions. To assess the computational performance of this method, we use the stochastic lot sizing and scheduling problem dealing with perishable products. In this problem, first‐stage decision variables are linked to production sequences and production quantities. After the uncertain demand is unveiled, the second‐stage variables decide on the inventory usage. Computational results show a clear advantage of the proposed method when compared to a state‐of‐the‐art mixed‐integer linear solver.
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.
