检索结果-内蒙古大学图书馆

International Conference on Machine Learning and Cybernetics

作者： Liu, XW Da, QL Chen, LH SE Univ Econ & Management Sch Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)0780378652

Considering that the concept of interdependence concept proposed by Carlsson and Full'er [1,2,3], found that it can only be applied to one dimension decision space, In this paper, we generalize the concept of objectives interdependence under the multidimensional conditions based on the gradients of the objectives. The new interdependence concept can reflect both the relationship and the degrees of the objectives' support or conflict. Then the application functions are constructed based on the interdependence grades of the objectives, and they are aggregated by entropy regularization procedure to solve the multiobjective programming problems. A numerical example shows the effect of the approach.

关键词： multiple objective programming application functions interdependence

来源：评论

学校读者我要写书评

暂无评论

Are soft skills conditioned by conflicting factors? A multiobjective programming approach to explore the trade-offs

引用

ECONOMIC ANALYSIS AND POLICY 2021年 72卷 18-40页

作者： Marcenaro-Gutierrez, O. D. Lopez-Agudo, L. A. Henriques, C. O. Univ Malaga Dept Appl Econ Stat & Econometr C Ejido 6 Malaga 29071 Spain Polytech Coimbra Coimbra Business Sch Res Ctr ISCAC Quinta Agr P-3040316 Coimbra Portugal Univ Coimbra INESC Coimbra DEEC P-3030290 Coimbra Portugal Univ Coimbra CeBER Fac Econ Av Dias Silva 165 P-3004512 Coimbra Portugal

Despite the relevance of noncognitive skills (i.e. soft skills) for individual development and for certain forms of employment, they tend to be overlooked in studies centred on educational performance. This study brings an additional contribution to the growing interest on these skills by exploring their main determinants and by providing an additional understanding of how they are influenced by socio-economic and family background. To this end, a multiobjective programming model has been developed, whose coefficients are instantiated by the results of several econometric estimations, in which distinct (and conflicting) aspects of multiple soft skills are considered. Hence, by coupling econometric with multiobjective optimisation modelling approaches we provide an overarching framework for assessing the trade-offs between the different dimensions of noncognitive skills. Data from the most populated region of Spain are used. Overall, our findings highlight the trade-off between different soft skills, which are particularly conditioned by students' gender. (C) 2021 Economic Society of Australia, Queensland. Published by Elsevier B.V.

关键词： Noncognitive skills Econometric analysis multiple objective programming

来源：评论

学校读者我要写书评

暂无评论

Modeling Multi-stage Assembly Systems with Finite Capacity as a Queueing Network

Modeling Multi-stage Assembly Systems with Finite Capacity a...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Yaghoubi, Saeed Azaron, Amir Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Istanbul Sehir Univ Dept Ind Engn Istanbul Turkey

ISBN: (纸本)9781479909865

This article models a multi-stage assembly system with finite capacity as an open queueing network using continuous-time Markov process. We also propose a multi-objective model with three conflicting objectives to optimally control the service rates, and apply the goal attainment method to solve a discrete-time approximation of the original multi-objective problem.

关键词： Assembly systems Markov processes multiple objective programming

来源：评论

学校读者我要写书评

暂无评论

Explicit Location Covering Problems An alternative formulation and solution approach 5

Explicit Location Covering Problems An alternative formulati...

引用

2015 International Conference on Industrial Engineering and Operations Management (IEOM)

作者： Kellerman, H. J. Yadavalli, V. S. S. Univ Pretoria Dept Ind & Syst Engn Pretoria South Africa

ISBN: (纸本)9781479960651

Location covering problems is a widely researched field due to the fact that it is useful for siting of facilities in real-life situations. This article discusses the history of location covering problems and provides an alternative formulation for both the Location Set Covering Problem-Explicit and the Maximal Covering Location Problem-Explicit. The article further demonstrates how these models can be used to site reaction vehicles of the Private Security Industry in South Africa.

关键词： Facility location linear programming location problems multiple objective programming queuing theory

来源：评论

学校读者我要写书评

暂无评论

Optimization of testing protocols to screen for COVID-19: a multi-objective model

引用

HEALTH CARE MANAGEMENT SCIENCE 2024年第4期27卷 580-603页

作者： Moheb-Alizadeh, Hadi Warsing Jr, Donald P. Kouri, Richard E. Taghiyeh, Sajjad Handfield, Robert B. North Carolina State Univ Grad Program Operat Res Raleigh NC 27695 USA Nike Corp Portland OR USA North Carolina State Univ Poole Coll Management Raleigh NC 27695 USA North Carolina State Univ Dept Plant & Microbial Biol Raleigh NC 27695 USA North Carolina State Univ Fitts Dept Ind & Syst Engn Raleigh NC 27695 USA Discover Financial Serv Riverwoods IL 60015 USA

In this paper we develop a new multi-objective simulated annealing (MOSA) algorithm to generate optimal testing protocols for infectious diseases, using the COVID-19 pandemic as our context. A SEIR (susceptible-exposed-infected-recovered) epidemiological model is embedded as the computational platform for our MOSA algorithm to optimize testing protocols for screening across three joint objectives: minimum cost of test materials, minimum total infections over the testing horizon, and minimum number of false negatives over the horizon. We demonstrate the application of this optimization tool to recommend screening protocols for K-12 school districts in the U.S. State of North Carolina. Our approach is scalable by population coverage and can be employed at the level of individual school districts or regional collections of districts, individual schools or collections of schools across a district, business sites, or nursing homes, among other congregate settings where individuals may be screened prior to gaining entry to the site. The algorithm can be solved two ways, generating either independent optimal protocols across individual testing locations, or a common protocol covering all locations in the collection of testing sites. Our findings can be used to inform policy decisions to guide the development of effective testing strategies for controlling the spread of COVID-19 or other pandemic diseases in a wide range of congregate settings across various geographic regions.

关键词： OR in health services multiple objective programming Simulated annealing COVID-19 SEIR model

来源：评论

学校读者我要写书评

暂无评论

A Multi-objective Biased Random-Key Genetic Algorithm for Service Technician Routing and Scheduling Problem 12th

A Multi-objective Biased Random-Key Genetic Algorithm for Se...

引用

12th International Conference on Computational Logistics (ICCL)

作者： Damm, Ricardo de Brito Ronconi, Debora P. Univ Sao Paulo Polytech Sch Sao Paulo Brazil

ISBN: (纸本)9783030876722;9783030876715

Every day many service companies need to plan the tasks that will be carried out by its field staff. Maintenance service technicians have to perform a set of jobs at different locations in a city or state. This problem can be defined as the Service Technician Routing and Scheduling Problem in which tasks have different priorities and time windows, and technicians have different skills and working hours. Scheduling must account for technicians' lunch breaks, which must be respected. Each task is performed by only one technician. To ensure quality customer service and consumer rights are upheld, a novel approach is proposed: to address the problem in a multi-objective context aiming to execute the priority tasks and, simultaneously, to serve the customers at the beginning of their time windows. A Multi-objective Biased Random-Key Genetic Algorithm (BRKGA) was customized to tackle this NP-hard optimization problem and then compared with the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The analyzed methods showed similar performance for small instances, but for medium- and large-sized instances the proposed method presented superior performance and more robust results.

关键词： multiple objective programming Routing and scheduling technicians Time windows Biased Random-Key Genetic Algorithm NSGA-II

来源：评论

学校读者我要写书评

暂无评论

A variational approach for the determination of continuous pareto frontier for multi-objective problems 5th

A variational approach for the determination of continuous p...

引用

5th International Symposium on Uncertainty Quantification and Stochastic Modelling, Uncertainties 2020

作者： Zidani, Hafid Ellaia, Rachid De Cursi, Edouardo Souza Mohammadia School of Engineers Mohammed V University of Rabat Ibn Sina Avenue Agdal BP 765 Rabat Morocco LOFIMS Laboratory INSA-Rouen Université Avenue BP. 08 St Etienne du Rouvray Cedex76801 France

ISBN: (纸本)9783030536688

In this paper, a novel approach is proposed to generate set of Pareto points to represent the optimal solutions along the Pareto frontier. This approach, which introduces a new definition of dominance, can be interpreted as a representation of the solution of the multi-objective optimization under the form of the solution of a problem in variational calculus. The method deals with both convex and non-convex problems. In order to validate the method, multi-objective numerical optimization problems are considered. © Springer Nature Switzerland AG 2021.

关键词： Multi-objective optimization multiple objective programming Variational calculation

来源：评论

学校读者我要写书评

暂无评论

Knapsack Balancing via Multiobjectivization

引用

APPLIED SCIENCES-BASEL 2024年第20期14卷

作者： Kaliszewski, Ignacy Miroforidis, Janusz Polish Acad Sci Syst Res Inst 6 Newelska St PL-01447 Warsaw Poland

In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when appropriate, to control this effect through problem multiobjectivization. By multiobjectivization, we mean the addition of one or more objective functions that aim to shift the original problem's optimal solutions towards Pareto optimal solutions of the multiobjectivized problem, reducing the dispersion of the respective coefficients. We detail how the knapsack balance aspect can be incorporated into the standard knapsack problem model and demonstrate the functionality of this enriched model through illustrative examples.

关键词： combinatorial optimization knapsack problem product objective function knapsack balancing multiple objective programming

来源：评论

学校读者我要写书评

暂无评论

The multiobjective multidimensional knapsack problem: a survey and a new approach

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2012年第4期19卷 495-520页

作者： Lust, Thibaut Teghem, Jacques Univ Mons Fac Polytech Mons Lab Math & Operat Res B-7000 Mons Belgium

The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper, we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or approximate the set of efficient solutions. In the first step, we classify and briefly describe the existing works that are essentially based on the use of metaheuristics. In the second step, we propose the adaptation of the two-phase Pareto local search (2PPLS) to the resolution of the MOMKP. With this aim, we use a very large scale neighborhood in the second phase of the method, that is the PLS. We compare our results with state-of-the-art results and show that the results we obtained were never reached before by heuristics for biobjective instances. Finally, we consider the extension to three-objective instances.

关键词： multiple objective programming knapsack problems metaheuristics local search

来源：评论

学校读者我要写书评

暂无评论

A multiple criteria decision-making model for justifying the acceptance of rush orders

引用

PRODUCTION PLANNING & CONTROL 1997年第8期8卷 753-761页

作者： Wu, MC Chen, SY Department of Industrial Engineering and Management National Chiao Tung University HsinChu Taiwan

Rush orders are immediate customer demands that exceed the expectation of a currently effective MPS (master production schedule). Decision-makers are often hesitant in the decision of accepting such orders. This paper presents a multiple criteria decision-making model for justifying the acceptance of rush orders for an assembly-to-order production system. Four criteria or production objectives are simultaneously considered and a multiple objective programming technique, the e-constraints approach, is adopted to solve the decision-making problem. This model could give the cost estimation for producing a rush order under various combinations of production objectives. The computed cost value could serve as a Valuable reference for justifying the economics of accepting the rush order, and help to determine its pricing strategy.

关键词： rush order multiple objective programming e-constraints

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：