Robust Optimisation Metaheuristics for the Inventory-Allocation Problem

• Authors: Vizinger Tea , Žerovnik Janez
• Languages of publication: EN

Abstracts

EN

As an example of a successful application of a relatively simple metaheuristics for a stochastic version of a multiple criteria optimisation problem, the inventory-allocation problem is discussed. Stochastic programming is introduced to deal with the demand of end consumers. It has been shown before that simple metaheuristics, i.e., local search may be a very competitive choice for solving computationally hard optimisation problems. In this paper, robust optimisation approach is applied to select more promising initial solutions which results in a significant improvement of time complexity of the optimisation algorithms. Furthermore, it allows more flexibility in choosing the final solution that need not always be minimising the sum of costs.

Keywords

EN

Distribution; Optimalization; Stochastic programming

PL

Dystrybucja; Optymalizacja; Programowanie stochastyczne

• Publisher: Uniwersytet Ekonomiczny w Katowicach
• Journal: Multiple Criteria Decision Making
• Year: 2019
• Volume: 14
• Pages: 128-143

Contributors

author

Vizinger Tea

• University of Maribor. Faculty of Logistics. Celje, Slovenia

author

Žerovnik Janez

• University of Ljubljana. Faculty of Mechanical Engineering. Ljubljana, Slovenia

References

• Aarts E.H.L., Lenstra J.K. (1997), Local Search Algorithms, John Wiley & Sons, Chichester.
• Anholcer M. (2016), Bi-criteria Stochastic Generalized Transportation Problem: Expected Cost and Risk Minimization, Multiple Criteria Decision Making [online publication], 1 November 2016, doi:10.22367/mcdm.2016.11.01.
• Brest J., Žerovnik J. (1999), An Approximation Algorithm for the Asymmetric Traveling Salesman Problem, Ricerca Operativa, 28, 59-67.
• Donnelly P., Welsh D. (1983), Finite Particle Systems and Infection Models, Mathematical Proceedings of the Cambridge Philosophical Society, 94(1), 167-182.
• Ferreira A., Žerovnik J. (1993), Bounding the Probability of Success of Stochastic Methods for Global Optimization, Computers and Mathematics with Applications, 25, 1-8.
• Franca R.B., Jones E.C., Richards C.N., Carlson J.P. (2010), Multi-objective Stochastic Supply Chain Modelling to Evaluate Tradeoffs Between Profit and Quality, International Journal of Production Economics, 127, 292-299.
• Grossman I.E., Guillén-Gosálbez G. (2010), Scope for the Application of Mathematical Programming Techniques in the Synthesis and Planning of a Sustainable Processes, Computers and Chemical Engineering, 34(9), 1365-1376.
• Ikica B., Povh J., Žerovnik J. (2019), Clustering Via a Modified Petford–Welsh Algorithm [in preparation].
• Kirkpatrick S., Gelatt C.D., Vecchi M.P. (1983), Optimization by Simulated Annealing, Science, 220 (4598), 671-680.
• Liu S., Papageorgiou L.G. (2013), Multiobjective Optimisation of Production, Distribution and Capacity Planning of Global Supply Chains in the Process Industry, Omega, 41(2), 369-382.
• Pesek I., Schaerf A., Žerovnik J. (2007), Hybrid Local Search Techniques for the Resource-constrained Project Scheduling Problem, Lecture Notes in Computer Science, 4771, 57-68.
• Petford A.D., Welsh D.J.A. (1989), A Randomised 3-colouring Algorithm, Discrete Mathematics, 74(1-2), 253-261.
• Sarimveis H., Patrinos P., Tarantilis C.D., Kiranoudis C.T. (2008), Dynamic Modelling and Control of Supply Chain Systems: A Review, Computers and Operations Research, 35, 3530-3561.
• Sorensen K., Sevaux M., Glover F. (2016), A History of Metaheuristics, [in:] R. Marti, P.M. Pardalos, M.G. Resende (eds.), Handbook of Heuristics, Springer, International Publishing.
• Talbi E.G. (2009), Metaheuristics: From Design to Implementation, John Wiley & Sons, New Jersey.
• Ubeda S., Žerovnik J. (1997), A Randomized Algorithm for a Channel Assignment Problem, Speedup, 11, 14-19.
• Vizinger T., Kokolj T., Žerovnik, J. (2017), A Robust Optimization Approach for Better Planning of a Retail Supply Chain Product Flow, [in:] L. Zadnik Stirn, M. Kljajič Borštar, J. Žerovnik, S. Drobne (eds.), Proceedings of the 14th International Symposium on Operational Research, 220-226 (Bled, Slovenia, 27-29 September 2017).
• Vizinger T., Žerovnik J. (2018), Coordination of a Retail Supply Chain Distribution Flow, Tehnični Vjesnik, 25, 5, 1298-1305.
• Vizinger T., Žerovnik J. (2019), A Stochastic Model for Better Planning of Product Flow in Retail Supply Chains, Journal of the Operational Research Society, 70(11), 1900-1914.
• (www 1) Combinatorial Optimization. http://en.wikipedia.org/wiki/Combinatorial_optimization (accessed: 25.04.2019).
• (www 2) P vs NP Problem. http://www.claymath.org/millenium-problems/p-vs-np-problem (accessed: 25.04.2019).
• (www 3) Frequency Assignment Problem. http://fap.zib.de/index.php (accessed: 25.04.2019)
• Zupan H., Herakovič N., Žerovnik J. (2016), A Heuristic for the Job Shop Scheduling Problem, [in:] G. Papa, M. Mernik (eds.), Proceedings of the Seventh International Conference on Bioinspired Optimization Methods and their Applications BIOMA, 187-198.
• Žerovnik J. (1994), A Randomized Algorithm for K-colourability. Discrete Mathematics, 131(1-3), 379-393.
• Žerovnik J. (1995), A Heuristics for the Probabilistic Traveling Salesman Problem, [in:] V. Rupnik, M. Bogataj (Eds.), Symposium on Operation Research’95 (Ljubljana: Slovenian Society Informatika, 165-172.
• Žerovnik J. (2000), On Temperature Schedules for Generalized Boltzmann Machine, Neural Network World, 10, 495-503.
• Žerovnik J. (2003), Simulated Annealing Type Metaheuristics to Cool or Not to Cool, [in:] L. Zadnik Stirn, M. Bastič, S. Drobne (eds.), 7th International Symposium on Operational Research in Slovenia (Ljubljana: Slovenian Society Informatika).
• Žerovnik J. (2015), Heuristics for NP-hard Optimization Problems Simpler is Better!?, Logistics & Sustainable Transport, 6(1), 1-10.

Identifiers

ISSN

2084-1531