Improving optimization using adaptive algorithms

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In the research projects and industrial projects severe optimization problems can be met, where the number of variables is high, there are a lot of constraints, and they are highly nonlinear and mostly discrete issues, where the running time can be calculated sometimes in weeks with the usual optimization methods on an average computer. In most cases in the logistics industry, the most robust constraint is the time. The optimizations are running on a typical office configuration, and the company accepts the suboptimal solution what the optimization method gives within the appropriate time limit. That is, why adaptivity is needed. The adaptivity of the optimization technique includes parameters of fine-tuning. On this way, the most sensitive setting can be found. In this article, some additional adaptive methods for logistic problems have been investigated to increase the effectivity, improve the solution in a strict time condition.

Cite

CITATION STYLE

APA

Kota, L., & Jarmai, K. (2021). Improving optimization using adaptive algorithms. Pollack Periodica, 16(1), 14–18. https://doi.org/10.1556/606.2020.00180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free