发布求助
文献互助 智能选刊 最新文献

Central European Journal of Operations Research最新文献

筛选
英文 中文
Mixed integer linear programming formulation for K-means clustering problem k -均值聚类问题的混合整数线性规划公式
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-27 DOI: 10.1007/s10100-023-00881-1
Kolos Cs. Ágoston, Marianna E.-Nagy
{"title":"Mixed integer linear programming formulation for K-means clustering problem","authors":"Kolos Cs. Ágoston, Marianna E.-Nagy","doi":"10.1007/s10100-023-00881-1","DOIUrl":"https://doi.org/10.1007/s10100-023-00881-1","url":null,"abstract":"Abstract The minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear programming formulation (MILP) is still missing. In this paper, we formulate MILP models. The advantage of MILP formulation is that users can extend the original problem with arbitrary linear constraints. We also present numerical results, we solve these models up to sample size of 150.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136311460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow 多阶段呼叫中心的快速人员配置算法，具有不耐烦的客户和时间依赖溢出
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-13 DOI: 10.1007/s10100-023-00883-z
Michael Manitz, Marc-Philip Piehl
{"title":"A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow","authors":"Michael Manitz, Marc-Philip Piehl","doi":"10.1007/s10100-023-00883-z","DOIUrl":"https://doi.org/10.1007/s10100-023-00883-z","url":null,"abstract":"Abstract Ensuring customer satisfaction is one of the main objectives of a call center. We focus on the question of how many agents are necessary and how they should be allocated to maintain a service level threshold and reduce the expected waiting time of the customers. In this paper, we consider a multistage call center that consists of a front and a back office, impatient customers, and an overflow mechanism. Based on the performance evaluation of such a system using a continuous-time Markov chain, a configuration of agents is determined using a binary search algorithm. We focus on structural insights, e.g., convexity conditions, to obtain a quick solution for the staffing problem. Since monotonicity does not always hold, the approach is heuristic. The numerical results show the performance of the algorithm. The influence of the fraction requiring second-level service in the back office and the impatience rate for the minimum number of agents is shown.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135853081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recycling of multi-source waste in an aggregate circular economy 综合循环经济中多源废物的回收利用
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-12 DOI: 10.1007/s10100-023-00886-w
Raouf Boucekkine, Fouad El Ouardighi, Konstantin Kogan
{"title":"Recycling of multi-source waste in an aggregate circular economy","authors":"Raouf Boucekkine, Fouad El Ouardighi, Konstantin Kogan","doi":"10.1007/s10100-023-00886-w","DOIUrl":"https://doi.org/10.1007/s10100-023-00886-w","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135968402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solving the minimum-cost double Roman domination problem 求解最小代价双罗马统治问题
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-09-30 DOI: 10.1007/s10100-023-00884-y
Ana Klobučar Barišić, Robert Manger
{"title":"Solving the minimum-cost double Roman domination problem","authors":"Ana Klobučar Barišić, Robert Manger","doi":"10.1007/s10100-023-00884-y","DOIUrl":"https://doi.org/10.1007/s10100-023-00884-y","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136341455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-day fair collaboration in demand-responsive transportation 多日公平合作的需求响应运输
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-09-28 DOI: 10.1007/s10100-023-00882-0
E. Angelelli, V. Morandi, M. G. Speranza
{"title":"Multi-day fair collaboration in demand-responsive transportation","authors":"E. Angelelli, V. Morandi, M. G. Speranza","doi":"10.1007/s10100-023-00882-0","DOIUrl":"https://doi.org/10.1007/s10100-023-00882-0","url":null,"abstract":"Abstract In this paper, we consider the case of companies that offer a demand-responsive transportation service, such as a shared-taxi service, and are engaged in a horizontal collaboration initiative. The goal of the coalition is to optimize the transportation operations in such a way that no company is penalized, in terms of customers served and/or working time. We present an optimization model for a multi-day planning horizon that includes constraints aimed at guaranteeing a level of fairness to all companies that can be controlled over the planning horizon and day-by-day, if beneficial. An adaptive large neighborhood search heuristic is then presented for its solution. The computational experiments show that, although the model constraints the optimization space, it still guarantees substantial savings. Moreover, they show that the model is flexible and can guarantee the sustainability in the long term of the collaboration initiative.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135387277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparison of MILP and CP models for balancing partially automated assembly lines 部分自动化装配线平衡的MILP和CP模型比较
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-09-26 DOI: 10.1007/s10100-023-00885-x
Imre Dimény, Tamás Koltai
{"title":"Comparison of MILP and CP models for balancing partially automated assembly lines","authors":"Imre Dimény, Tamás Koltai","doi":"10.1007/s10100-023-00885-x","DOIUrl":"https://doi.org/10.1007/s10100-023-00885-x","url":null,"abstract":"Abstract The objective of Assembly Line Balancing (ALB) is to find the proper assignment of tasks to workstations, taking into consideration various types of constraints and defined management goals. Early research in the field focused on solving the Simple Assembly Line Balancing problem, a basic simplified version of the general problem. As the production environment became more complex, several new ALB problem types appeared, and almost all ALB problems are NP-hard, meaning that finding a solution requires a lot of time, resources, and computational power. Methods with custom-made algorithms and generic approaches have been developed for solving these problems. While custom-made algorithms are generally more efficient, generic approaches can be more easily extended to cover other variations of the problem. Over the past few decades, automation has played an increasingly important role in various operations, although complete automation is often not possible. As a result, there is a growing need for partially automated assembly line balancing models. In these circumstances, the flexibility of a generic approach is essential. This paper compares two generic approaches: mixed integer linear programming (MILP) and constraint programming (CP), for two types of partially automated assembly line balancing problems. While CP is relatively slower in solving the simpler allocation problems, it is more efficient than MILP when an increased number of constraints is applied to the ALB and an allocation and scheduling problem needs to be solved.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134960351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Testing re-optimisation strategies in international kidney exchange programmes by the ENCKEP simulator 通过ENCKEP模拟器测试国际肾脏交换计划的再优化策略
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-09-17 DOI: 10.1007/s10100-023-00880-2
Lilla Matyasi, Péter Biró
{"title":"Testing re-optimisation strategies in international kidney exchange programmes by the ENCKEP simulator","authors":"Lilla Matyasi, Péter Biró","doi":"10.1007/s10100-023-00880-2","DOIUrl":"https://doi.org/10.1007/s10100-023-00880-2","url":null,"abstract":"Abstract We tested re-optimisation strategies for international kidney exchange programmes using the simulator developed by the ENCKEP COST Action. Kidney exchange programmes (KEPs) are operating in most of the European countries to facilitate the exchange of kidney donors for the recipients with incompatible living donors. The optimal solutions for national and international KEPs are typically selected in every three months based on the compatibilities estimated on the individual immunological data. However, these estimations are not always accurate, and if a positive crossmatch is found in the laboratory crossmatch tests then the corresponding exchange cycle (or chain) must be cancelled. Depending on the matching process, the coordinators may use different re-optimisation strategies to repair the failed solutions. We examine the effects of using multiple rounds of re-optimisation with different optimisation strategies, such as fixing good cycles in the intermediate solutions or prioritising transplants with negative crossmatch tests in previous rounds. In the context of international KEPs we also consider the possibility of testing and prioritising national transplants in the solutions. We measure the performance of these policies regarding the number of transplants and the number of compatibility tests conducted in a time period. By extending our results presented in [16], we performed simulations for a large number of instances to measure the effects of various re-optimisation policies. Our main findings show a clear trade-off in the number of transplants versus the number of tests and re-optimisation rounds.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135258631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Can direct finance within a servitizing supply chain reduce the moral hazard associated with the servitized user’s care of the product? 服务化供应链中的直接融资能否减少与服务化用户对产品的护理相关的道德风险？
IF 1.7 4区 管理学
Central European Journal of Operations Research Pub Date : 2023-08-30 DOI: 10.1007/s10100-023-00863-3
Yaya Bian, M. Reimann, Weihua Zhang
{"title":"Can direct finance within a servitizing supply chain reduce the moral hazard associated with the servitized user’s care of the product?","authors":"Yaya Bian, M. Reimann, Weihua Zhang","doi":"10.1007/s10100-023-00863-3","DOIUrl":"https://doi.org/10.1007/s10100-023-00863-3","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":" ","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47838126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Publication and citation patterns of Austrian researchers in operations research and other sub-disciplines of business administration as indexed in Web of Science and Scopus 奥地利运筹学和其他工商管理子学科研究人员的出版和引用模式，见科学网和Scopus
IF 1.7 4区 管理学
Central European Journal of Operations Research Pub Date : 2023-08-25 DOI: 10.1007/s10100-023-00877-x
C. Schlögl, Sandra Boric, Gerhard Reichmann
{"title":"Publication and citation patterns of Austrian researchers in operations research and other sub-disciplines of business administration as indexed in Web of Science and Scopus","authors":"C. Schlögl, Sandra Boric, Gerhard Reichmann","doi":"10.1007/s10100-023-00877-x","DOIUrl":"https://doi.org/10.1007/s10100-023-00877-x","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":" ","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42593175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sensitivity of TOPSIS ranks to data normalization and objective weights on the example of digital development TOPSIS排名对数据归一化和目标权重的敏感性——以数字发展为例
IF 1.7 4区 管理学
Central European Journal of Operations Research Pub Date : 2023-08-20 DOI: 10.1007/s10100-023-00876-y
Z. Bánhidi, Imre Dobos
{"title":"Sensitivity of TOPSIS ranks to data normalization and objective weights on the example of digital development","authors":"Z. Bánhidi, Imre Dobos","doi":"10.1007/s10100-023-00876-y","DOIUrl":"https://doi.org/10.1007/s10100-023-00876-y","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":" ","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49566889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信