| Full text | |
| Author(s): |
Rodrigues, Luiz Fernando
;
Dos Santos, Maristela Oliveira
;
Almada-Lobo, Bernardo
Total Authors: 3
|
| Document type: | Journal article |
| Source: | COMPUTERS & INDUSTRIAL ENGINEERING; v. 182, p. 19-pg., 2023-08-01. |
| Abstract | |
This article addresses the Production Routing Problem (PRP), which consists of determining, in an integrated way, production and inventory planning, and vehicle routing to minimize the costs involved. In the problem, a plant is responsible for producing several types of products to meet the known demand of a set of customers using a homogeneous fleet of vehicles over the planning horizon. In the literature, evolutionary approaches have not been explored in depth for the PRP, specifically for the problem with multiple products. Thus, this work mitigates this gap, presenting a novel Memetic Algorithm and testing its effectiveness on randomly generated sets of instances, comparing the results obtained with a commercial optimization solver. In our solution approach, several classic operators from the literature were implemented. Furthermore, we propose four novel genetic operators. In addition, we evaluated the proposed method's performance in classical instances of literature considering a single item. The computational experiments were carried out to assess the impact of the numerous parameter combinations involving the metaheuristic, and, from statistical analyses, we evidence the proposed technique's robustness. Computational experiments showed that our proposed method outperforms the commercial solver Gurobi in determining feasibly high-quality solutions, mainly on large instances for the PRP with multiple items. (AU) | |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |