Приказ основних података о документу

dc.creatorMrđa, Predrag D.
dc.creatorKitanović, Marko
dc.creatorMiljić, Nenad
dc.creatorPopović, Slobodan
dc.date.accessioned2023-03-01T10:27:21Z
dc.date.available2023-03-01T10:27:21Z
dc.date.issued2022
dc.identifier.urihttps://machinery.mas.bg.ac.rs/handle/123456789/4845
dc.description.abstractFor a given internal combustion (IC) engine stationary test plan, significant time savings during its realization could be achieved if the sequence of test points execution is adequately determined. The criterion for stabilizing the engine operating point is determined by the magnitude of the change in the most inert parameter, and in the general case, it is the temperature of the engine exhaust gases. A certain level of prior knowledge about the examined object is necessary to conduct such an analysis. If there are no results from previous tests, simulation models, or experiences, the Slow Dynamic Slope (SDS) tests are a great way to quickly gather the necessary information. The task of finding the optimal sequence for a stationary engine testing plan can be set as Travelling Salesman Problem (TSP). This paper will present the application of one of the heuristic methods for solving the TSP on the example of testing the IC engine, which is a very complex dynamic system. Following this model, it is possible to optimize the stationary test plan for any other dynamic system. The basic idea is to find such a sequence of stationary operating points, during the realization of which a minor deviation of the engine exhaust gas temperature is obtained, resulting in the operating point's shortest stabilization time.sr
dc.language.isoensr
dc.publisherIOP Publishingsr
dc.relationinfo:eu-repo/grantAgreement/MESTD/Technological Development (TD or TR)/35042/RS//sr
dc.rightsopenAccesssr
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.sourceIOP Conference Series: Materials Science and Engineeringsr
dc.titleInternal combustion engine test plan execution order optimization using Travelling Salesman Problem heuristics approachsr
dc.typeconferenceObjectsr
dc.rights.licenseBYsr
dc.citation.rankM33
dc.citation.spage012005
dc.citation.volume1271
dc.identifier.doi10.1088/1757-899X/1271/1/012005
dc.identifier.fulltexthttp://machinery.mas.bg.ac.rs/bitstream/id/11778/Mrdja_2022_IOP_Conf._Ser.__Mater._Sci._Eng._1271_012005.pdf
dc.type.versionpublishedVersionsr


Документи

Thumbnail

Овај документ се појављује у следећим колекцијама

Приказ основних података о документу