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

International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)

作者： L. A. Al. Swidi Raghad Almohammed Maryam Khenyab Kareem Department of Mathematics College of Education for Pure Sciences University of Babylon Babylon Iraq

ISBN: (数字)9798350354423

ISBN: (纸本)9798350354430

The research presents the notion of a bushy set in proximity space. The concept of co-bushy space is also introduced here by utilizing the cluster structure for a topological proximity space. These concepts are discussed with a view to finding new topological proximity space from the original one. Its most important characteristics are studied here. Finally, the notion of non-dismountable spaces and dismountable spaces, are introduced and some equivalent conditions concerning this, are established here.

关键词： Education Measurement Topology mathematical programming

来源：评论

学校读者我要写书评

暂无评论

mathematical Models Applications in Digital Supply Chain Network

Mathematical Models Applications in Digital Supply Chain Net...

引用

IEEE International Technology Management Conference

作者： Kamar Zekhnini Abla Chaouni Benabdellah Arij Lahmar University of Picardie Jules Verne Saint Quentin France BEAR Lab Rabat Business School UIR Rabat Morocco Dubai Business School University of Dubai

ISBN: (数字)9798350367355

ISBN: (纸本)9798350367362

Nowadays supply chains are distinct than those of a few decades ago, and they're now evolving in a highly competitive environment. More clearly, supply chains can no longer be placed, only, in such a way that they can buy, make, move, or sell the right items in the adequate quantities in the right places rapidly. As a result, supply chains must become intelligent to successfully cope with the growing challenges. Many functional supply chain applications based on mathematical quantitave models have been used, however there have been few research on mathematical programming models applicability in the digital supply chain processes. For this reason, this paper aims to investigate the possible benefits of mathematical programming solutions in digital supply chains since we are aware of their potential benefits in the traditional one. We categorized the quantitative mathematical models used in digital supply chain management based on reviewing research articles published in this topic. Furthermore, we provided an integrated model illustrating the use of mathematical programming methods in the digital supply chain. The conceptualized framework aids in showing an overview of usable mathematical models in the digital supply chain. Because it outlines the important advantage and benefit of applying mathematical models integrated with novel technologies in the value chain.

关键词： Technology management Supply chain management Supply chains mathematical models mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Double Exponential Smoothing in Forecasting the Numbers of Pole-Mounted Transformer Failures

Double Exponential Smoothing in Forecasting the Numbers of P...

引用

Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), International Conference on

作者： Nhlanhla Mbuli Department of Electrical Engineering College of Science Engineering and Technology University of South Africa Roodepoort South Africa

ISBN: (数字)9798350391183

ISBN: (纸本)9798350391190

In this paper, author studied the use of double exponential smoothing (DES) method to forecast the quarterly numbers of pole-mounted transformer failures. To determine the values of smoothing constants, they formulate a nonlinear mathematical programming (NLP) optimisation problem for this purpose, propose the use of an Excel Solver approach and exhaustive search-based method, with a program written in Python, are used to solve the optimisation. The two methods are used to find the optimal parameters of the forecast and results are compared. The exhaustive search-based approach delivers superior forecast results, with the forecasted values responding better with variation in observations and a lower forecast error obtained.

关键词： Electric potential Smoothing methods Mechatronics Transformers Search problems Forecasting Optimization Python mathematical programming

来源：评论

学校读者我要写书评

暂无评论

The benefit of complete trip information in free-floating carsharing systems

引用

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2023年 12卷

作者： Archetti, Claudia Bruglieri, Maurizio Guastaroba, Gianfranco Speranza, M. Grazia ESSEC Business Sch Cergy Pontoise France Politecn Milan Dept Design Via G Durando 10 Milan Italy Univ Brescia Dept Econ & Management Cda S Chiara 50 Brescia Italy

Free-floating and instant-access carsharing systems are two features of the most flexible carsharing systems. In the former, users are allowed to freely park the car in any legal parking spot within the boundaries defined by the service operator. In the latter, users are not requested to make any reservation in advance before picking up the car. This paper aims at evaluating the importance of complete trip information in free-floating instant -access carsharing systems. To this aim, we consider a system, referred to as the look-ahead system, where users can reserve a car in advance and are also allowed to directly pick up a car without any reservation. In both cases, the user is requested to specify complete trip details, including the estimated usage duration and the location where the car will be returned. Taking advantage of a complete knowledge of the trip details, the service operator can assign a reservation request to a car that is in use at the time of reservation, provided it will become available at the time and location the user will need it. In its nature, the operational setting we consider is dynamic, as trip information is revealed to the service operator at the time the user requests a car. We also investigate the possibility of suggesting to the user that makes a reservation a pickup location different from the desired one, provided it is not too distant from the latter. We compare the performance of the look-ahead system with the case no information is anticipated, which resembles the service provided by the main carsharing operators currently active in Milan (Italy). Additionally, we use, as a benchmark, the static case where all the information about the users requests (pickup and return locations, as well as delivery time) is known before the start of the planning horizon. We consider a system with no car relocations performed by ad-hoc operators. This enables us to measure the pure benefit of anticipated information, i.e., the benefit coming on

关键词： Free-floating carsharing Anticipation of information mathematical programming Simulation study

来源：评论

学校读者我要写书评

暂无评论

Optimum design of reinforced concrete foundations

引用

Recent Patents on Engineering 2021年第3期15卷 277-286页

作者： Bedair, Osama OB Engineering Ltd. 249 Craig Henry Drive OttawaONK2G 5V2 Canada

Background: Optimization of reinforced concrete foundation is a challenging problem due to the interaction between the design variables and design constraints. Classical design methods may overestimate the size of the foundation, thus leading to excessive cost. By using current advances in computer technologies and numerical optimization procedures, it is possible to find the optimum combinations of foundations design parameters that minimize the cost. Objectives: The paper presents a numerical strategy to optimize the design of the reinforced concrete foundation. Methods: The cost function is first derived in terms of the foundation design parameters. mathematical programming technique is utilized to minimize the cost function. Design constraints are used against soil bearing capacity, concrete shear strength, flexural strength, and column bearing. Simplified analytical models are developed to idealize the soil stress distribution. The numerical procedure is then automated in a computer Program "OSFD" to perform sensitivity analysis and provide guidelines that can be utilized in practice. Results: Design examples are provided to illustrate the efficiency of the optimization procedure. Results are compared with existing common design procedures, commercial software and design handbooks that are available in practice. Conclusion: The described procedure is very cost-effective and can be utilized by practicing engineers in the industry to optimize the design of the reinforced concrete foundations. © 2021 Bentham Science Publishers.

关键词： Structural optimization concrete foundation footings mathematical programming reinforced design procedures

来源：评论

学校读者我要写书评

暂无评论

Bi-Level Optimal Planning and Scheduling Model for Energy Storage Systems in the Market Environment

Bi-Level Optimal Planning and Scheduling Model for Energy St...

引用

China International Conference on Electricity Distribution, CICED

作者： Jialin Shi Yuxin Wang Kunjie Lu Mingchao Li Ying Le Fujian branch China Huadian Corporation Ltd. Fuzhou China College of Electrical Engineering Zhejiang University Hangzhou China Energy sales Co. Ltd. Fujian Huadian Fuzhou China Research Institute Co. Ltd. Huadian Electric Power Hangzhou China

ISBN: (数字)9798350368345

ISBN: (纸本)9798350368352

In recent years, energy storage systems (ESS) have grown rapidly due to their advantages of flexible configuration, fast response speed, combined charging and discharging capabilities. In addition, it has been clearly stated both domestically and internationally that ESS can participate in the electricity market as an independent entity. Therefore, a bi-level optimal planning and scheduling model for ESS in the market environment is proposed. The upper-level model is the ESS's daily revenue model while taking into account its investment cost. The lower-level model is the electricity market clearing model. Then, the solution method for the bi-level model is introduced. Finally, numerical simulations demonstrate the effectiveness of the proposed planning and scheduling model for ESS.

关键词： Solid modeling Electricity supply industry Solids Numerical simulation mathematical models Numerical models Planning Energy storage Investment mathematical programming

来源：评论

学校读者我要写书评

暂无评论

A derivative-free approach to partitioned optimization

arXiv

引用

arXiv 2024年

作者： Audet, Charles Bouchet, Pierre-Yves Bourdin, Loïc École Polytechnique de Montréal MontréalQCH3T 1J4 Canada GERAD MontréalQCH3T 1J4 Canada XLIM Research Institute University of Limoges France

In this work, we introduce a partitioned optimization framework (POf) to ease the solving process for optimization problems for which fixing some variables to a tunable value removes some difficulties. The variables space may be continuously partitioned into subsets where these variables are fixed to a given value, so that minimizing the objective function restricted to any of the partition sets is easier than minimizing the objective function over the whole variables space. Then our methodology consists in searching for the partition set minimizing the minimum of the objective function restricted to this set. Indeed, a local solution to the original problem is given by computing this partition set and selecting the minimizer of the objective function restricted to this set. We first formalize this framework and study its theoretical guarantees, and we discuss about a derivative-free optimization (DFO) algorithm able to seek for an optimal partition set. Then we focus on a class of composite optimization problems that may be solved using the POf, and we illustrate in details our methodology on four problems from this class. Finally, we highlight the gain in numerical performance provided by the POf on large-dimensional composite problems by comparing it to two popular DFO solvers. © 2024, CC BY.

关键词： mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Narrative review of mathematical and psychological studies of staff scheduling for holidays as applicable to anesthesiologists and nurse anesthetists

引用

JOURNAL OF CLINICAL ANESTHESIA 2023年 88卷 111142-111142页

作者： Hurt, Grant M. Dexter, Franklin Univ Iowa Iowa City IA USA Univ Iowa Dept Anesthesia Iowa City IA USA Univ Iowa Dept Anesthesia Div Management Consulting 200 Hawkins Dr6-JCP Iowa City IA 52242 USA

We performed a narrative review of articles applicable to anesthesiologists' and nurse anesthetists' choices of who works each statutory holiday for operating room and non-operating room anesthesia. We include search protocols and detailed supplementary annotated comments. Studies showed that holiday staff scheduling is emotional. Working on holidays often is more stressful and undesirable than comparable workdays. Intrinsic motivation may overall, among practitioners, be greater by preferentially scheduling practitioners who choose to work on holidays, for compensation, before mandating that practitioners who would prefer to be off must work on holidays. Granting each practitioner (who so desires) at least one major holiday off can depend on identifying and scheduling other clinicians who want to work holidays for monetary compensation or extra compensatory time off. Scheduling holidays by random priority (i.e., a lottery choosing who gets to pick their holiday[s] first, second, etc.) is inefficient, resulting in fewer practitioners having their preferences satisfied, especially for small departments or divisions (e.g., cardiac anesthesia). No article that we reviewed implemented a random priority mechanism for staff scheduling. The selection of practitioners to take turns in choosing their holidays is perceived to have less fairness than a selection process that collects each participants' preferences. Although holidays often are scheduled separately from regular workdays and weekends, doing so will not increase efficiency or fairness. Holidays can, in practice, be scheduled simultaneously with non-holidays. Models can explicitly include fairness as an objective. For example, fairness can be based on the difference between the maximum and minimum number of holidays for which practitioners of the same division are scheduled. Holidays can be given greater weights than other shifts when estimating fairness. Staff scheduling for holidays, when done simultaneously with

关键词： Anesthesia department Fairness Hospital administration Industrial engineering mathematical programming Staff scheduling

来源：评论

学校读者我要写书评

暂无评论

A Simulated Annealing-based Roadside Unit Deployment with Mixed Traffic Participants in Vehicular Networks

A Simulated Annealing-based Roadside Unit Deployment with Mi...

引用

Computer, Big Data and Artificial Intelligence (ICCBD+AI), International Conference on

作者： Hao Ma Yantong Wang Jiande Sun School of Information Science and Engineering Shandong Normal University Ji’nan China

ISBN: (数字)9798331533991

ISBN: (纸本)9798331534004

As an indispensable component of intelligent transportation systems, roadside units (RSUs) enable vehicle-to-infrastructure (V2I) communication and provide continuous transmission coverage. Extensive research has been conducted on RSU deployment to make a trade-off between deployment cost and network performance. However, most existing studies focus solely on connected vehicles, neglecting the blocking effect of vehicles that are not capable of vehicle-to-vehicle (V2V) communications. This oversight can significantly hinder the information dissemination among vehicular networks. In this paper, we propose an RSU deployment strategy that accounts for mixed traffic participants, including both connected and non-connected vehicles. Initially, we introduce an analytical model that encompasses both V2I and V2V communication modes. Subsequently, leveraging this model, we formulate a mathematical programming model aimed at minimizing the number of RSUs required while ensuring delay requirements are met. Furthermore, we give a simulated annealing-based algorithm to expedite the decision-making process. Numerical investigations demonstrate the superiority of our proposed approach over alternative methods.

关键词： Analytical models Costs Vehicle-to-infrastructure Decision making Vehicular ad hoc networks Simulated annealing mathematical models Numerical models Delays mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Round-Trip Wireless Charging Infrastructure for Heterogeneous Electric Vehicles on Highways: Modelling and Optimization

引用

WORLD ELECTRIC VEHICLE JOURNAL 2023年第6期14卷

作者： Bourzik, Mohammed Elbaz, Hassane Bouleft, Yousra Alaoui, Ahmed El Hilali Fac Sci & Technol Fez Lab Modeling & Math Struct 2202 Fes Morocco EuroMed Univ Fes Digital Engn & Artificial Intelligence Sch 2202 Fes Morocco

In this paper, we propose a new approach to dynamic wireless charging that allows electric vehicles to charge wirelessly while in motion in both lanes on highways. The challenge is to locate the charging infrastructure on a highway between origin O and destination S (round trip) with heterogeneous battery vehicles, where each type of vehicle requires its allocation of charging segments on the road. We aim to ensure that each type of vehicle can complete a round trip without running out of battery charge while minimizing the number of charging segments and inverters on the road by studying both lanes simultaneously. We model the problem mathematically and validate it using a CPLEX optimizer for limited instances. Finally, we solve the problem using a hybrid approach that combines genetic algorithms and local search techniques to balance diversification and intensification. We have significantly improved the results found in the literature by reducing the number of inverters, which are expensive components in the charging infrastructure. Our approach takes advantage of utilizing a single inverter for both lanes of the highway, leading to cost savings and improved efficiency.

关键词： mathematical modeling metaheuristics electric vehicle mathematical programming On-Line EV

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：