215 research outputs found
Identification of weights in multi-cteria decision problems based on stochastic optimization
Many scientific papers are devoted to solving multi-criteria problems using methods that find discrete solutions. However, the main challenge addressed by our work is the case when new decision-making variants have emerged which have not been assessed. Unfortunately, discrete identification makes it impossible to determine the preferences for new alternatives if we do not know the whole set of parameters, such as criteria weights. This paper proposes a new approach to identifying a multi-criteria decision model to address this challenge. The novelty of this work is using a discretization in the space of the problem to identify a continuous decisional model. We present a hybrid approach where the new alternative can be assessed based on stochastic optimization and the TOPSIS technique. The stochastic methods are used to find criteria weights used in the TOPSIS method. In that way, we get assessed easily each new alternative based only on the initial set of evaluated alternatives
Ant-Balanced multiple traveling salesmen: ACO-BmTSP
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keeping both the total travel cost at the minimum and the tours balanced. Eleven different problems with several variants were analyzed to validate the method. The 20 variants considered three to twenty salesmen regarding 11 to 783 cities. The results were compared with best-known solutions (BKSs) in the literature. Computational experiments showed that a total of eight final results were better than those of the BKSs, and the others were quite promising, showing that with few adaptations, it will be possible to obtain better results than those of the BKSs. Although the ACO metaheuristic does not guarantee that the best solution will be found, it is essential in problems with non-deterministic polynomial time complexity resolution or when used as an initial bound solution in an integer programming formulation. Computational experiments on a wide range of benchmark problems within an acceptable time limit showed that compared with four existing algorithms, the proposed algorithm presented better results for several problems than the other algorithms did.info:eu-repo/semantics/publishedVersio
Recommended from our members
Multi-objective optimization for time-based preventive maintenance within the transport network: a review
Preventive maintenance in transportation is essential not only to safeguard billions in business and infrastructure investment, but also to guarantee safety, reliability and efficacy within the network. Government, industry and society have been increasingly recognising the importance of keeping transport units condition well-preserved. The challenge, however, is to achieve optimal performance of the existing transport systems within acceptable costs, effective workforce use and minimum disruption. Those are generally conflicting objectives. Multi-objective optimisation approaches have served as powerful tools to assist stakeholders to properly deploy preventive maintenance in industry. In this study, we review the research conducted in the application of multi-objective optimisation for preventive maintenance in transport-related activities. We focus on time-based preventive maintenance for production, infrastructure, rail and energy providers. In our review, we are interested in aspects such as the types of problems addressed, the existing objectives, the approaches to solutions, and how the outcomes obtained support decision
ΠΠΎΠ²ΡΠ΅ ΠΏΠΎΠ΄Ρ ΠΎΠ΄Ρ ΠΊ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ ΡΠ΅Π½Π°ΠΌΠΈ Π½Π° ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ½ΡΠ΅ ΡΡΠ»ΡΠ³ΠΈ
Development of new approaches to formation of analytics mechanisms for the purpose of pricing management of services is an important aspect of increasing the efficiency of transport management processes.Research aimed at improving the tools for determining the optimal parameters of the ratio of quality and price of service for formation of a competitive and efficient tariff policy continues to remain relevant and in demand in modern market conditions. The objective of the study, presented in the article, is to analyse and evaluate the prospects for implementation of the areas to improve the apparatus for assessing the price elasticity of demand for railway passenger transport services as the transition to the use of non-linear parameters in terms of customer behaviour modelling functions, as well as introduction of the most effective algorithms from the set of modern global mathematical optimisation tools.The research conclusions are based on the use of system analysis mechanisms, methods of economic and mathematical modelling and optimisation, as well as of non-parametric statistics tools.The results based on the use of an array of data on the demand of passengers of branded trains include: a comparative assessment of quality of modelling the price elasticity of demand using 15 functions that are nonlinear in terms of parameters; the most promising tools of the search for unknown parameters for non-smooth nonlinear functions for modelling the behaviour of railway customers are identified based on a three-stage procedure for comparative analysis of the performance of more than 60 optimisation algorithms (including the calculation of minima and medians for the sums of squares of modelling errors, bootstrap analysis, Kruskalβ Wallace and MannβWhitney tests, as well as the calculation of a metric specially developed by the authors for assessing the degree of superiority of one algorithm over another within the framework of non-parametric analysis).The findings seem able to be successfully used in relation to other modes of transport in solving similar problems of developing an effective toolkit for managing the prices of transport services.ΠΠ°ΠΆΠ½ΡΠΌ Π°ΡΠΏΠ΅ΠΊΡΠΎΠΌ ΠΏΠΎΠ²ΡΡΠ΅Π½ΠΈΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ² ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ Π½Π° ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ΅ ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΠ°Π·Π²ΠΈΡΠΈΠ΅ Π½ΠΎΠ²ΡΡ
ΠΏΠΎΠ΄Ρ
ΠΎΠ΄ΠΎΠ² ΠΊ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΌΠ΅Ρ
Π°Π½ΠΈΠ·ΠΌΠΎΠ² Π°Π½Π°Π»ΠΈΡΠΈΠΊΠΈ Π΄Π»Ρ ΡΠ΅Π»Π΅ΠΉ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ ΡΠ΅Π½Π°ΠΌΠΈ ΡΡΠ»ΡΠ³.Π ΡΠΎΠ²ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ
ΡΡΠ½ΠΎΡΠ½ΡΡ
ΡΡΠ»ΠΎΠ²ΠΈΡΡ
ΠΏΡΠΎΠ΄ΠΎΠ»ΠΆΠ°ΡΡ ΠΎΡΡΠ°Π²Π°ΡΡΡΡ Π°ΠΊΡΡΠ°Π»ΡΠ½ΡΠΌΠΈ ΠΈ Π²ΠΎΡΡΡΠ΅Π±ΠΎΠ²Π°Π½Π½ΡΠΌΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ, Π½Π°ΠΏΡΠ°Π²Π»Π΅Π½Π½ΡΠ΅ Π½Π° ΡΠΎΠ²Π΅ΡΡΠ΅Π½ΡΡΠ²ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΈΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΠΈΡ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΡΡ
ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΎΠ² ΡΠΎΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΡ ΠΊΠ°ΡΠ΅ΡΡΠ²Π° ΠΈ ΡΡΠΎΠΈΠΌΠΎΡΡΠΈ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Π΄Π»Ρ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΊΠΎΠ½ΠΊΡΡΠ΅Π½ΡΠΎΡΠΏΠΎΡΠΎΠ±Π½ΠΎΠΉ ΠΈ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΠΉ ΡΠ°ΡΠΈΡΠ½ΠΎΠΉ ΠΏΠΎΠ»ΠΈΡΠΈΠΊΠΈ.Π¦Π΅Π»Ρ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ, ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½ΠΎΠ³ΠΎ Π² ΡΡΠ°ΡΡΠ΅, β Π°Π½Π°Π»ΠΈΠ· ΠΈ ΠΎΡΠ΅Π½ΠΊΠ° ΠΏΠ΅ΡΡΠΏΠ΅ΠΊΡΠΈΠ² ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΠΈ ΡΠ°ΠΊΠΈΡ
Π½Π°ΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠΉ ΠΏΠΎ ΡΠΎΠ²Π΅ΡΡΠ΅Π½ΡΡΠ²ΠΎΠ²Π°Π½ΠΈΡ Π°ΠΏΠΏΠ°ΡΠ°ΡΠ° ΠΎΡΠ΅Π½ΠΊΠΈ ΡΠ΅Π½ΠΎΠ²ΠΎΠΉ ΡΠ»Π°ΡΡΠΈΡΠ½ΠΎΡΡΠΈ ΡΠΏΡΠΎΡΠ° Π½Π° ΡΡΠ»ΡΠ³ΠΈ ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΠΎΠ³ΠΎ ΠΏΠ°ΡΡΠ°ΠΆΠΈΡΡΠΊΠΎΠ³ΠΎ ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ°, ΠΊΠ°ΠΊ ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄ ΠΊ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ Π½Π΅Π»ΠΈΠ½Π΅ΠΉΠ½ΡΡ
ΠΏΠΎ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠ°ΠΌ ΡΡΠ½ΠΊΡΠΈΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΡ ΠΊΠ»ΠΈΠ΅Π½ΡΠΎΠ², Π° ΡΠ°ΠΊΠΆΠ΅ Π²Π½Π΅Π΄ΡΠ΅Π½ΠΈΠ΅ Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΡΡ
Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΠΈΠ· Π°ΡΡΠ΅Π½Π°Π»Π° ΡΠΎΠ²ΡΠ΅ΠΌΠ΅Π½Π½ΠΎΠ³ΠΎ ΠΈΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΠΈΡ Π³Π»ΠΎΠ±Π°Π»ΡΠ½ΠΎΠΉ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ.Π€ΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π²ΡΠ²ΠΎΠ΄ΠΎΠ² ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΠΎΡΠ½ΠΎΠ²ΡΠ²Π°Π΅ΡΡΡ Π½Π° ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠΈ ΠΌΠ΅Ρ
Π°Π½ΠΈΠ·ΠΌΠΎΠ² ΡΠΈΡΡΠ΅ΠΌΠ½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π°, ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΡΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠΎ-ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ, Π° ΡΠ°ΠΊΠΆΠ΅ ΠΈΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΠΈΡ Π½Π΅ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΡΠ°ΡΠΈΡΡΠΈΠΊΠΈ.Π ΠΈΡΠΎΠ³Π΅, Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ ΠΌΠ°ΡΡΠΈΠ²Π° Π΄Π°Π½Π½ΡΡ
ΠΎ ΡΠΏΡΠΎΡΠ΅ ΠΏΠ°ΡΡΠ°ΠΆΠΈΡΠΎΠ² ΡΠΈΡΠΌΠ΅Π½Π½ΡΡ
ΠΏΠΎΠ΅Π·Π΄ΠΎΠ² ΠΏΡΠΎΠ²Π΅Π΄Π΅Π½Π° ΡΡΠ°Π²Π½ΠΈΡΠ΅Π»ΡΠ½Π°Ρ ΠΎΡΠ΅Π½ΠΊΠ° ΠΊΠ°ΡΠ΅ΡΡΠ²Π° ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠ΅Π½ΠΎΠ²ΠΎΠΉ ΡΠ»Π°ΡΡΠΈΡΠ½ΠΎΡΡΠΈ ΡΠΏΡΠΎΡΠ° ΠΏΡΠΈ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠΈ 15 Π½Π΅Π»ΠΈΠ½Π΅ΠΉΠ½ΡΡ
ΠΏΠΎ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠ°ΠΌ ΡΡΠ½ΠΊΡΠΈΠΉ, Π° ΡΠ°ΠΊΠΆΠ΅, Π² ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠ΅ ΠΎΡΡΡΠ΅ΡΡΠ²Π»Π΅Π½ΠΈΡ ΡΡΡΡ
ΡΡΠ°ΠΏΠ½ΠΎΠΉ ΠΏΡΠΎΡΠ΅Π΄ΡΡΡ ΡΡΠ°Π²Π½ΠΈΡΠ΅Π»ΡΠ½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΡΠ°Π±ΠΎΡΡ Π±ΠΎΠ»Π΅Π΅ ΡΠ΅ΠΌ 60 Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ (Π²ΠΊΠ»ΡΡΠ°ΡΡΠ΅ΠΉ, Π² ΡΠΎΠΌ ΡΠΈΡΠ»Π΅, ΡΠ°ΡΡΡΡ ΠΌΠΈΠ½ΠΈΠΌΡΠΌΠΎΠ² ΠΈ ΠΌΠ΅Π΄ΠΈΠ°Π½ Π΄Π»Ρ ΡΡΠΌΠΌ ΠΊΠ²Π°Π΄ΡΠ°ΡΠΎΠ² ΠΎΡΠΈΠ±ΠΎΠΊ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ, Π±ΡΡΡΡΡΠ΅ΠΏ-Π°Π½Π°Π»ΠΈΠ·, ΡΠ΅ΡΡΡ ΠΡΠ°ΡΠΊΠ΅Π»Π°βΠ£ΠΎΠ»Π»Π΅ΡΠ° ΠΈ ΠΠ°Π½Π½Π°βΠ£ΠΈΡΠ½ΠΈ, Π° ΡΠ°ΠΊΠΆΠ΅ ΡΠ°ΡΡΡΡ ΡΠΏΠ΅ΡΠΈΠ°Π»ΡΠ½ΠΎ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΠΎΠΉ Π°Π²ΡΠΎΡΠ°ΠΌΠΈ ΠΌΠ΅ΡΡΠΈΠΊΠΈ ΠΎΡΠ΅Π½ΠΊΠΈ ΡΡΠ΅ΠΏΠ΅Π½ΠΈ ΠΏΡΠ΅Π²ΠΎΡΡ
ΠΎΠ΄ΡΡΠ²Π° ΠΎΠ΄Π½ΠΎΠ³ΠΎ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° Π½Π°Π΄ Π΄ΡΡΠ³ΠΈΠΌ Π² ΡΠ°ΠΌΠΊΠ°Ρ
Π½Π΅ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π°) ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Ρ Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΠΏΠ΅ΡΡΠΏΠ΅ΠΊΡΠΈΠ²Π½ΡΠ΅ ΠΌΠ΅Ρ
Π°Π½ΠΈΠ·ΠΌΡ ΠΏΠΎΠΈΡΠΊΠ° Π½Π΅ΠΈΠ·Π²Π΅ΡΡΠ½ΡΡ
ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΎΠ² Π΄Π»Ρ Π½Π΅Π³Π»Π°Π΄ΠΊΠΈΡ
Π½Π΅Π»ΠΈΠ½Π΅ΠΉΠ½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΡ ΠΊΠ»ΠΈΠ΅Π½ΡΠΎΠ² ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΠΎΠ³ΠΎ ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ°.ΠΡΠ΅Π΄ΡΡΠ°Π²Π»ΡΠ΅ΡΡΡ, ΡΡΠΎ ΠΏΠΎΠ»ΡΡΠ΅Π½Π½ΡΠ΅ Π²ΡΠ²ΠΎΠ΄Ρ ΠΌΠΎΠ³ΡΡ Π±ΡΡΡ ΡΡΠΏΠ΅ΡΠ½ΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½Ρ ΠΈ ΠΏΡΠΈΠΌΠ΅Π½ΠΈΡΠ΅Π»ΡΠ½ΠΎ ΠΊ Π΄ΡΡΠ³ΠΈΠΌ Π²ΠΈΠ΄Π°ΠΌ ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ° ΠΏΡΠΈ ΡΠ΅ΡΠ΅Π½ΠΈΠΈ ΠΈΠΌΠΈ Π°Π½Π°Π»ΠΎΠ³ΠΈΡΠ½ΡΡ
Π·Π°Π΄Π°Ρ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΠ³ΠΎ ΠΈΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΠΈΡ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ ΡΠ΅Π½Π°ΠΌΠΈ ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ½ΡΡ
ΡΡΠ»ΡΠ³
- β¦