Yugoslav Journal of Operations Research最新文献

筛选
英文 中文
Unravelling the assignment problem under intuitionistic triangular fuzzy environment by the novel heuristic Dhouib-Matrix-AP1 用新颖的启发式Dhouib-Matrix-AP1揭示直觉三角模糊环境下的分配问题
Yugoslav Journal of Operations Research Pub Date : 2023-01-01 DOI: 10.2298/yjor220915005d
S. Dhouib
{"title":"Unravelling the assignment problem under intuitionistic triangular fuzzy environment by the novel heuristic Dhouib-Matrix-AP1","authors":"S. Dhouib","doi":"10.2298/yjor220915005d","DOIUrl":"https://doi.org/10.2298/yjor220915005d","url":null,"abstract":"The Assignment Problem (AP) can be stated as n activities to be assigned to n resources in such a way that the overall cost of assignment is minimized and each activity is assigned to one and only one resource. In real-life, the parameters of the AP are presented as uncertain numbers due to the lack of knowledge, experiences or any other (internal or external) factor. In this paper, the AP is considered under intuitionistic triangular fuzzy number and solved by the novel constructive heuristic Dhouib-Matrix-AP1 (DM-AP1) with a time complexity of O(n). Actually, this paper presents the first enhancement of the novel heuristic DM-AP1 to solve the AP under intuitionistic triangular fuzzy environment. DM-AP1 is composed of three simple steps: computing the total cost, selecting the highest value and finding the minimal element. These steps are repeated in n iterations with the use of a standard deviation statistical metric. Two case studies of AP under intuitionistic triangular fuzzy set are taken from the literature and a step-by-step application of the novel DM-AP1 heuristic is presented for more clarification.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"56 Pt 7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83894147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A pythagorean hesitant fuzzy programming approach and its application to multi objective reliability optimization problem 毕达哥拉斯犹豫模糊规划方法及其在多目标可靠性优化问题中的应用
Yugoslav Journal of Operations Research Pub Date : 2023-01-01 DOI: 10.2298/yjor230417024j
Swarup Jana, Sahidul Islam
{"title":"A pythagorean hesitant fuzzy programming approach and its application to multi objective reliability optimization problem","authors":"Swarup Jana, Sahidul Islam","doi":"10.2298/yjor230417024j","DOIUrl":"https://doi.org/10.2298/yjor230417024j","url":null,"abstract":"Decision-making problems can often be effectively solved using traditional optimization methods that have a clearly defined configuration. However, in real-world scenarios, decision-makers frequently encounter doubt or hesitation, making it challenging to precisely specify certain parameters. As a result, they often seek input from different experts, leading to conflicting values and varying levels of satisfaction among decision-makers. This uncertainty and lack of crisp values make decision-making problems inherently non-deterministic. In this paper, a novel Pythagorean hesitant fuzzy (PHF) programming method is designed to address the challenges of optimization problems with multiple objectives. Here PHF aggregation operators are used to aggregate the PHF memberships and non-memberships of the objectives. Additionally, to account the uncertainties of the parameters of the optimization problem Parabolic Pythagorean fuzzy number is used and centroid method is applied for defuzzification. We solved an example of multi objective optimization problem of manufacturing system to demonstrate our proposed method and finally, presented a case study on reliability optimization model for Life Support Systems, where the primary objectives are to maximize system reliability and minimize cost. The result is compared with other existing methods by degree of closeness.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135952772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An EPQ model for delay deteriorating products with price, freshness and greening efforts dependent demand under markdown strategy 降价策略下价格、新鲜度和环保程度依赖于需求的延迟变质产品EPQ模型
Yugoslav Journal of Operations Research Pub Date : 2023-01-01 DOI: 10.2298/yjor230515023k
Dharmesh Katariya, Kunal Shukla
{"title":"An EPQ model for delay deteriorating products with price, freshness and greening efforts dependent demand under markdown strategy","authors":"Dharmesh Katariya, Kunal Shukla","doi":"10.2298/yjor230515023k","DOIUrl":"https://doi.org/10.2298/yjor230515023k","url":null,"abstract":"Consumers today use green, fresh, perishable products because of their\u0000 freshness, healthfulness, and sustainability. In this article, we developed\u0000 the continuous production inventory model for the producer who produces and\u0000 sells fresh perishable products with the input of green efforts. There are\u0000 two distinct kinds of product decay to take into account: products whose\u0000 physical condition gradually deteriorates over time at a constant rate, and\u0000 products whose freshness quality declines with time. Product demand is\u0000 influenced by the selling price of the product, its freshness level, and its\u0000 greening efforts. In order to increase the sales of inventory and enhance\u0000 the profit from clearing stocks at the end of their life, we have adopted\u0000 the markdown policy. Due to freshness degradation, a markdown strategy is\u0000 adopted after a period of product deterioration to boost demand. The\u0000 objectives of the study are to find out the optimal period for replenishment\u0000 cycle time, the optimal value of greening efforts, and the optimal markdown\u0000 percentage such that the producer?s total profit is maximum. A numerical\u0000 example is used to validate a mathematical formulation that reflects\u0000 real-world circumstances. A sensitivity analysis of the parameters is done\u0000 to determine the model's reliability. Some significant managerial results\u0000 are provided, and the article concludes with a consideration of the future\u0000 scope of related research.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135953384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effect of green technology investment on crude oil inventory system - a case study based on ONGC data 绿色技术投资对原油库存系统的影响——以印度石油天然气公司为例
Yugoslav Journal of Operations Research Pub Date : 2023-01-01 DOI: 10.2298/yjor230415025s
Abhibasu Sen, Karabi Dutta Choudhury, Tapan Datta
{"title":"Effect of green technology investment on crude oil inventory system - a case study based on ONGC data","authors":"Abhibasu Sen, Karabi Dutta Choudhury, Tapan Datta","doi":"10.2298/yjor230415025s","DOIUrl":"https://doi.org/10.2298/yjor230415025s","url":null,"abstract":"The carbon footprints are increasing in the environment at an alarming rate mainly due to unplanned human activities. The world?s population will continue to grow at a rapid pace in the future. As a result, our future generations may find it difficult to live on this planet in a healthy manner. The world?s developed and developing countries began to investigate various methods for reducing their carbon footprint. However, it will not be sustainable if it is also not economically viable. In this scenario, maintaining a good profit for businesses while reducing their carbon footprint necessitates a pragmatic strategy. In this article, we will try to find a way out that will provide us with a practical solution. We will simulate the profitability of an upstream oil manufacturer that has invested heavily in green technologies. Under a carbon tax system, we will use the production-inventory model. This system assumes that capital investment in green technology can reduce emissions, and increase profits. We used data from the Oil and Natural Gas Corporation of India, available in its annual reports. As a matter of fact, the Oil and Natural Gas Corporation of India accounts for 70% of crude oil production in India and is a major player in India?s upstream oil companies. The results were quite encouraging, with deviations between expected and actual values being less than 10%. 2 Sen, Dutta Choudhury and Datta / Effect of Green Technology The findings also led us to believe that the excise duty and the pollution control tax levied in India can be regarded as a Green Tax or Carbon Tax. We used a published research model to find the optimal solution.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135448851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bounds on eigenvalues of real symmetric interval matrices for αBB method in global optimization αBB方法全局寻优实数对称区间矩阵的特征值界
Yugoslav Journal of Operations Research Pub Date : 2023-01-01 DOI: 10.2298/yjor230315019z
Djamel Zerrouki, Mohand Ouanes
{"title":"Bounds on eigenvalues of real symmetric interval matrices for αBB method in global optimization","authors":"Djamel Zerrouki, Mohand Ouanes","doi":"10.2298/yjor230315019z","DOIUrl":"https://doi.org/10.2298/yjor230315019z","url":null,"abstract":"In this paper, we investigate bounds on eigenvalues of real symmetric interval matrices. We present a method that computes bounds on eigenvalues of real symmetric interval matrices. It outperforms many methods developed in the literature and produces as sharp as possible bounds on eigenvalues of real symmetric interval matrices. The aim is to apply the proposed method to compute lower bounds on eigenvalues of a symmetric interval hessian matrix of a nonconvex function in the ?BB method and use them to produce a tighter underestimator that improves the ?BB algorithm for solving global optimization problems. In the end, we illustrate by example, the comparison of various approaches of bounding eigenvalues of real symmetric interval matrices. Moreover, a set of test problems found in the literature are solved efficiently and the performances of the proposed method are compared with those of other methods.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"56 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77177446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-fractional fuzzy programming for sustainable agricultural multi-cropping bi-seasonal planning 可持续农业多季复种规划的多分式模糊规划
Yugoslav Journal of Operations Research Pub Date : 2022-01-01 DOI: 10.2298/yjor220516026m
Umar Muhammad Modibbo
{"title":"Multi-fractional fuzzy programming for sustainable agricultural multi-cropping bi-seasonal planning","authors":"Umar Muhammad Modibbo","doi":"10.2298/yjor220516026m","DOIUrl":"https://doi.org/10.2298/yjor220516026m","url":null,"abstract":"The agricultural production system composes of several conflicting resources that must be combined to yield the desired product output. However, some goals are not conflicting in the system; therefore, this study presents a multi-objective optimization problem using a multi-fractional fuzzy programming concept. The objective is to optimize the profit ratio to cash expenditure and production of crops in different seasons under the restriction of fertilizer, machine, manpower, water consumption, and land utilization. The proposed model is illustrated with numerical examples for validation from an agrirean village in northern Nigeria. The result shows meaningful achievements and improvement in six crops out of the seven crops for both the dry and rainy seasons. Thus the concept is recommended for decision-makers for proper planning and productive yield in the agricultural industry for ensuring food security and the global sustainable developments.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"96 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75896482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability optimization using hybrid genetic and particle swarm optimization algorithm 基于混合遗传和粒子群算法的可靠性优化
Yugoslav Journal of Operations Research Pub Date : 2022-01-01 DOI: 10.2298/yjor220316020d
Tripti Dahiya, D. Garg
{"title":"Reliability optimization using hybrid genetic and particle swarm optimization algorithm","authors":"Tripti Dahiya, D. Garg","doi":"10.2298/yjor220316020d","DOIUrl":"https://doi.org/10.2298/yjor220316020d","url":null,"abstract":"Redundancy-allocation problem i.e. RAP is among the reliability optimization problems which make use of non-linear programming method to improve the reliability of complex system. The objective of this research paper is reliability optimization through the application of Genetic Algorithm i.e. GA and Hybrid Genetic & Particle Swarm Optimization (H-GAPSO) on a RAP. Certain shortcomings have been seen when results are obtained by application of single algorithms. In order to get rid of these shortcomings, HGA-PSO is introduced where attractive properties of GA and PSO are combined. This hybrid method makes use of iterative process of GA after obtaining initial best population from PSO. Comparative Analysis of results of GA and H-GAPSO is done with respect to reliability and computation (CPU) time and it is observed that H-GAPSO improved system reliability up to maximum by 63.10%. MATLprogramming has been used for computation of results from GA and HGA-PSO algorithms.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82113176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Necessary and sufficient optimality conditions for fractional interval-valued variational problems 分数阶区间值变分问题的充分最优性必要条件
Yugoslav Journal of Operations Research Pub Date : 2022-01-01 DOI: 10.2298/yjor210815028r
Vivekananda Rayanki, K. Kummari
{"title":"Necessary and sufficient optimality conditions for fractional interval-valued variational problems","authors":"Vivekananda Rayanki, K. Kummari","doi":"10.2298/yjor210815028r","DOIUrl":"https://doi.org/10.2298/yjor210815028r","url":null,"abstract":"In this paper a special kind of variational programming problem involving fractional interval-valued objective function is considered. For such type of problem, insights into LU optimal solutions have been discussed. Using the LU optimal concept, we established optimality conditions for the considered problem. Further, We formulated a Mond-Weir dual problem and discussed appropriate duality theorems for the relationship between dual and primal problems.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75951208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis of bulk service queuing system with rework, unreliable server, resuming service and two kinds of multiple vacation 具有返工、服务器不可靠、恢复服务和两种多重休假的批量服务排队系统分析
Yugoslav Journal of Operations Research Pub Date : 2022-01-01 DOI: 10.2298/yjor210719009k
S. Karpagam
{"title":"Analysis of bulk service queuing system with rework, unreliable server, resuming service and two kinds of multiple vacation","authors":"S. Karpagam","doi":"10.2298/yjor210719009k","DOIUrl":"https://doi.org/10.2298/yjor210719009k","url":null,"abstract":"In this paper, we discuss a batch arrival bulk service queue with rework for the faculty item, possibility of breakdown, repair, and two kinds of multiple vacation with different threshold policy. The server serves the remaining service after repair completion. This type of queueing model has a lot of applications in the manufacturing/production industries. Performance measures and stability conditions are obtained. Numerical illustrations are made to examine the validity of analytical results.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74650555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation 任意簇大小的1均值和1中位数2聚类问题:复杂性和近似
Yugoslav Journal of Operations Research Pub Date : 2022-01-01 DOI: 10.2298/yjor211018008p
A. Pyatkin
{"title":"1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation","authors":"A. Pyatkin","doi":"10.2298/yjor211018008p","DOIUrl":"https://doi.org/10.2298/yjor211018008p","url":null,"abstract":"We consider the following 2-clustering problem. Given N points in Euclidean space, partition it into two subsets (clusters) so that the sum of squared distances between the elements of the clusters and their centers would be minimum. The center of the first cluster coincides with its centroid (mean) while the center of the second cluster should be chosen from the set of the initial points (medoid). It is known that this problem is NP-hard if the cardinalities of the clusters are given as a part of the input. In this paper we prove that the problem remains NP-hard in the case of arbitrary clusters sizes and suggest a 2-approximation polynomial-time algorithm for this problem.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85469440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信