A hybrid metaheuristic with learning for a real supply chain scheduling problem
[EN] In recent decades, research on supply chain management (SCM) has enabled companies to improve their environmental, social, and economic performance.This paper presents an industrial application of logistics that can be classified as an inventory-route problem. The problem consists of assigning...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/205467 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/205467 |
| Access Level: | acceso abierto |
| Palabra clave: | Optimization Metaheuristics Supply chain management Hybrid algorithm GRASP Meta-learning Inventor-routing problem LENGUAJES Y SISTEMAS INFORMATICOS 09.- Desarrollar infraestructuras resilientes, promover la industrialización inclusiva y sostenible, y fomentar la innovación |
| Sumario: | [EN] In recent decades, research on supply chain management (SCM) has enabled companies to improve their environmental, social, and economic performance.This paper presents an industrial application of logistics that can be classified as an inventory-route problem. The problem consists of assigning orders to the available warehouses. The orders are composed of items that must be loaded within a week. The warehouses provide an inventory of the number of items available for each day of the week, so the objective is to minimize the total transportation costs and the costs of producing extra stock to satisfy the weekly demand. To solve this problem a formal mathematical model is proposed. Then a hybrid approach that involves two metaheuristics: a greedy randomized adaptive search procedure (GRASP) and a genetic algorithm (GA) is proposed. Additionally, a meta-learning tuning method is incorporated into our hybridized approach, which yields better results but with a longer computation time. Thus, the trade-off of using it is analyzed.An extensive evaluation was carried out over realistic instances provided by an industrial partner. The proposed technique was evaluated and compared with several complete and incomplete solvers from the state of the art (CP Optimizer, Yuck, OR-Tools, etc.). The results showed that our hybrid metaheuristic outperformed the behavior of these well-known solvers, mainly in large-scale instances (2000 orders per week). This hybrid algorithm provides the company with a powerful tool to solve its supply chain management problem, delivering significant economic benefits every week. |
|---|