Bartosz Sawik

Prof. Dr. Bartosz Sawik

AGH University of Science and Technology, 30059 Krakow, Poland.
+1
orcid

Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

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

Representative Publications

View All Publications
1 April 2013 in Omega
Verified
Journal Article
Closed access
Bartosz SawikBartosz Sawik
Bartosz Sawik

1 April 2011 in Omega
Verified
Journal Article
Closed access
Bartosz SawikBartosz Sawik
Bartosz Sawik

19 March 2017 in Open Mathematics
Verified
Journal Article
Open access
PDF file
LCLaura Calvet Calvet
Laura Calvet Calvet
JAJesica de Armas
Jesica de Armas
DMDavid Masip
David Masip
Angel A. JuanAngel A. Juan
Angel A. Juan
This paper reviews the existing literature on the combination of metaheuristics with machine learning methods and then introduces the concept of learnheuristics, a novel type of hybrid algorithms. Learnheuristics can be used to solve combinatorial optimization problems with dynamic inputs (COPDIs). In these COPDIs, the problem inputs (elements either located in the objective function or in the constraints set) are not fixed in advance as usual. On the contrary, they might vary in a predictable (non-random) way as the solution is partially built according to some heuristic-based iterative process. For instance, a consumer’s willingness to spend on a specific product might change as the availability of this product decreases and its price rises. Thus, these inputs might take different values depending on the current solution configuration. These variations in the inputs might require from a coordination between the learning mechanism and the metaheuristic algorithm: at each iteration, the learning method updates the inputs model used by the metaheuristic.


25 October 2016 in International Journal of Production Research
Verified
Journal Article
Closed access
Bartosz SawikBartosz Sawik
Bartosz Sawik
A new, computationally efficient portfolio approach to supplier selection in the presence of supply chain disruption risks is proposed, where the selection of supply portfolios for parts is combined with production scheduling of finished products. Unlike most of reported research on the supply chain risk management which focuses on the risk mitigation decisions taken prior to a disruption, the proposed portfolio approach combines decisions made before, during and after the disruption. The two decision-making approaches are considered: an integrated approach with the perfect information about the future disruption scenarios, and a hierarchical approach with no such information available. In the integrated approach, which accounts for all potential disruption scenarios, the primary supply portfolio that will hedge against all scenarios is determined along with the recovery supply portfolio and production schedule for each scenario. In the hierarchical approach, first the primary supply portfolio is determined, and then, when a primary supplier is hit by a disruption, the recovery supply portfolio is selected. For the integrated and the hierarchical decision-making, mixed integer programming models are developed with the two risk-neutral conflicting objectives that account for both time and cost of recovery: minimising expected cost or maximising expected service level. The findings indicate that for both objectives, the integrated decision-making selects a more diversified primary supply portfolio than the hierarchical approach and when all primary suppliers are shutdown by disruption, a single sourcing recovery portfolio is usually selected.