Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport
Supply-chain network design is a complex task because there are many decisions involved, and presently, global networks involve many actors and variables, for example, in the automotive, pharmaceutical, and electronics industries. This research addresses a supply-chain network design problem with fo...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-11-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/11/21/10251 |
| _version_ | 1797512777853566976 |
|---|---|
| author | David A. Ruvalcaba-Sandoval Elias Olivares-Benitez Omar Rojas Guillermo Sosa-Gómez |
| author_facet | David A. Ruvalcaba-Sandoval Elias Olivares-Benitez Omar Rojas Guillermo Sosa-Gómez |
| author_sort | David A. Ruvalcaba-Sandoval |
| collection | DOAJ |
| description | Supply-chain network design is a complex task because there are many decisions involved, and presently, global networks involve many actors and variables, for example, in the automotive, pharmaceutical, and electronics industries. This research addresses a supply-chain network design problem with four levels: suppliers, factories, warehouses, and customers. The problem considered decides on the number, locations, and capacities of factories and warehouses and the transportation between levels in the supply chain. The problem is modeled as a mixed-integer linear program. The main contribution of this work is the proposal of two matheuristic algorithms to solve the problem. Matheuristics are algorithms that combine exact methods and heuristics, attracting interest in the literature because of their fast execution and high-quality solutions. The matheuristics proposed to select the warehouses and their capacities following heuristic rules. Once the warehouses and their capacities are fixed, the algorithms solve reduced models using commercial optimization software. Medium and large instances were generated based on a procedure described in the literature. A comparison is made between the algorithms and the results obtained, solving the model with a time limit. The algorithms proposed are successful in obtaining better results for the largest instances in shorter execution times. |
| first_indexed | 2024-03-10T06:06:29Z |
| format | Article |
| id | doaj.art-5fe954dbe6684805aa50c76230a5bb53 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T06:06:29Z |
| publishDate | 2021-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-5fe954dbe6684805aa50c76230a5bb532023-11-22T20:30:01ZengMDPI AGApplied Sciences2076-34172021-11-0111211025110.3390/app112110251Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal TransportDavid A. Ruvalcaba-Sandoval0Elias Olivares-Benitez1Omar Rojas2Guillermo Sosa-Gómez3Facultad de Ingeniería, Universidad Panamericana, Álvaro del Portillo 49, Zapopan, Jalisco 45010, MexicoFacultad de Ingeniería, Universidad Panamericana, Álvaro del Portillo 49, Zapopan, Jalisco 45010, MexicoFacultad de Ciencias Económicas y Empresariales, Universidad Panamericana, Álvaro del Portillo 49, Zapopan, Jalisco 45010, MexicoFacultad de Ciencias Económicas y Empresariales, Universidad Panamericana, Álvaro del Portillo 49, Zapopan, Jalisco 45010, MexicoSupply-chain network design is a complex task because there are many decisions involved, and presently, global networks involve many actors and variables, for example, in the automotive, pharmaceutical, and electronics industries. This research addresses a supply-chain network design problem with four levels: suppliers, factories, warehouses, and customers. The problem considered decides on the number, locations, and capacities of factories and warehouses and the transportation between levels in the supply chain. The problem is modeled as a mixed-integer linear program. The main contribution of this work is the proposal of two matheuristic algorithms to solve the problem. Matheuristics are algorithms that combine exact methods and heuristics, attracting interest in the literature because of their fast execution and high-quality solutions. The matheuristics proposed to select the warehouses and their capacities following heuristic rules. Once the warehouses and their capacities are fixed, the algorithms solve reduced models using commercial optimization software. Medium and large instances were generated based on a procedure described in the literature. A comparison is made between the algorithms and the results obtained, solving the model with a time limit. The algorithms proposed are successful in obtaining better results for the largest instances in shorter execution times.https://www.mdpi.com/2076-3417/11/21/10251matheuristicmultimodal transportsupply-chain network designdecomposition |
| spellingShingle | David A. Ruvalcaba-Sandoval Elias Olivares-Benitez Omar Rojas Guillermo Sosa-Gómez Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport Applied Sciences matheuristic multimodal transport supply-chain network design decomposition |
| title | Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport |
| title_full | Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport |
| title_fullStr | Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport |
| title_full_unstemmed | Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport |
| title_short | Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport |
| title_sort | matheuristics for the design of a multi step multi product supply chain with multimodal transport |
| topic | matheuristic multimodal transport supply-chain network design decomposition |
| url | https://www.mdpi.com/2076-3417/11/21/10251 |
| work_keys_str_mv | AT davidaruvalcabasandoval matheuristicsforthedesignofamultistepmultiproductsupplychainwithmultimodaltransport AT eliasolivaresbenitez matheuristicsforthedesignofamultistepmultiproductsupplychainwithmultimodaltransport AT omarrojas matheuristicsforthedesignofamultistepmultiproductsupplychainwithmultimodaltransport AT guillermososagomez matheuristicsforthedesignofamultistepmultiproductsupplychainwithmultimodaltransport |