Willy Alves de Oliveira Soler

Willy Alves de Oliveira Soler

Auto-generated profile, based on publicly available information

Willy Alves de Oliveira Soler

Mathematics Institute, Universidade Federal de Mato Grosso do Sul, Campo Grande, Brazil

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 August 2019 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
WSWilly A. O. Soler
Willy A. O. Soler
MSMaristela O. Santos
Maristela O. Santos
KAKerem Akartunalı
Kerem Akartunalı
This paper addresses a lot sizing and scheduling problem inspired from a real-world production environment apparent in food industry. Due to the scarcity of resources, only a subset of production lines can operate simultaneously, and those lines need to be assembled in each production period. In addition, the products are perishable, and there are often significant sequence-dependent setup times and costs. We first propose a standard mixed integer programming model for the problem, and then a reformulation of the standard model in order to allow us to define a branching rule to accelerate the performance of the branch-and-bound algorithm. We also propose an efficient relax-and-fix procedure that can provide high-quality feasible solutions and competitive dual bounds for the problem. Computational experiments indicate that our approaches provide superior results when benchmarked with a commercial solver and an established relax-and-fix heuristic from the literature.

1 May 2021 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
WSWilly Alves de Oliveira Soler
Willy Alves de Oliveira Soler
MSMaristela Oliveira Santos
Maristela Oliveira Santos
SRSocorro Rangel
Socorro Rangel
The purpose of this paper is to propose mathematical models to represent a lot sizing and scheduling problem on multiple production lines that share scarce resources and to investigate the computational performance of the proposed models. The main feature that differentiates this problem from others in the literature is that the decision on which lines to organize should be taken considering the availability of the necessary resources. The optimization criterion is the minimization of the costs incurred in the production process (inventory, backlogging, organization of production lines, and sequence-dependent setup costs). Nine mixed integer optimization models to represent the problem are given and, also, the results of an extensive computational study carried out using a set of instances from the literature. The computational study indicates that an efficient formulation, able to provide high quality solutions for large sized instances, can be obtained from a classical model by making the binary production variables explicit, using the facility location reformulation as well as the single commodity flow constraints to eliminate subsequences. Moreover, from the results, it is also clear that the consideration of scarce resources makes the problem significantly more difficult than the traditional one.


1 December 2019 in Pesquisa Operacional
Verified
Journal Article
Open access
PDF file
WSWilly A. de Oliveira Soler
Willy A. de Oliveira Soler
KPKelly C. Poldi
Kelly C. Poldi
MSMaristela O. Santos
Maristela O. Santos
This research addresses a lot sizing and scheduling problem inspired by a real-world production environment where the customers make advanced orders and the industry need to decide which orders will be accepted with the aim of maximizing the profit respecting the production capacity constraints. Orders are composed of different types of items which must be delivered within a given time interval and, moreover, such orders cannot be split. A mixed integer programming (MIP) model is proposed to represent the problem and a MIP-based heuristic is also proposed to deliver good solutions at an acceptable computational time. The heuristic is composed of three phases (construction, deterministic improvement and stochastic improvement phases) and combines relax-and-fix, fix-and-optimize, and iterative MIP based neighborhood search procedures. Computational tests are presented in order to study the efficiency of the proposed approaches.

19 May 2025 in Revista Principia
Verified
Journal Article
Open access
PDF file
WCWilton Gustavo Gomes da Costa
Wilton Gustavo Gomes da Costa
RSRicardo Santos
Ricardo Santos
WSWilly Alves de Oliveira Soler
Willy Alves de Oliveira Soler
BDBianca de Almeida Dantas
Bianca de Almeida Dantas
The Vehicle Routing Problem (VRP) is a classical optimization problem focused on determining routes for a fleet of vehicles to fulfill the demands of a set of customers. Due to its wide applicability, particularly in the logistics sector, numerous variants of the VRP have been developed. One such variant is the Dynamic Vehicle Routing Problem (DVRP), characterized by the emergence of new customer demands after the initial routing has been established. The combinatorial complexity of the DVRP poses significant challenges in finding high-quality, feasible solutions within practical runtime limits for real-world, large-scale problems, thereby driving the development of heuristic approaches. This paper introduces a novel heuristic algorithm, Dynamic Search per Neighbors Routes (DSNR), which employs neighborhood search techniques based on the 2-Opt* operator to incorporate new delivery requests into existing routes. The DSNR algorithm was tested using instances from the Loggibud benchmark, representing real-world data from three distinct Brazilian cities. In terms of distance and the number of vehicles required, the proposed approach demonstrated superior performance compared to two existing methods from the literature: the QRP Sweep (QRPS) and K-Means Greedy (KG). The DSNR achieved improvements of 15% to 17% in terms of distance and final delivery costs.