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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,743 篇 期刊文献
518 篇 会议
19 篇 学位论文

馆藏范围

2,280 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,987 篇 工学
- 935 篇 计算机科学与技术...
- 564 篇 电气工程
- 507 篇 软件工程
- 392 篇 石油与天然气工程
- 252 篇 动力工程及工程热...
- 170 篇 化学工程与技术
- 147 篇 控制科学与工程
- 143 篇 交通运输工程
- 133 篇 机械工程
- 114 篇 信息与通信工程
- 83 篇 土木工程
- 68 篇 环境科学与工程（可...
- 32 篇 建筑学
- 29 篇 力学（可授工学、理...
- 29 篇 电子科学与技术（可...
- 24 篇 安全科学与工程
- 19 篇 材料科学与工程（可...
- 16 篇 航空宇航科学与技...
- 12 篇 水利工程
763 篇 理学
- 697 篇 数学
- 51 篇 系统科学
- 46 篇 统计学（可授理学、...
- 34 篇 化学
- 23 篇 物理学
- 20 篇 生物学
637 篇 管理学
- 612 篇 管理科学与工程(可...
- 134 篇 工商管理
- 13 篇 图书情报与档案管...
158 篇 经济学
- 122 篇 应用经济学
- 34 篇 理论经济学
20 篇 农学
13 篇 医学
6 篇 法学
3 篇 教育学
1 篇 军事学

主题

2,280 篇 mixed-integer li...
144 篇 optimization
62 篇 scheduling
52 篇 unit commitment
45 篇 multi-objective ...
43 篇 linear programmi...
42 篇 demand response
37 篇 robust optimizat...
30 篇 uncertainty
29 篇 energy storage
27 篇 model predictive...
27 篇 electric vehicle...
27 篇 energy managemen...
27 篇 stochastic progr...
26 篇 integer programm...
25 篇 genetic algorith...
21 篇 renewable energy
20 篇 energy managemen...
19 篇 transmission exp...
19 篇 machine learning

机构

16 篇 osaka prefecture...
10 篇 carnegie mellon ...
10 篇 dalian univ tech...
9 篇 mcgill univ dept...
8 篇 fuzhou univ sch ...
8 篇 georgia inst tec...
7 篇 beihang univ sch...
7 篇 univ utah dept e...
7 篇 univ tehran coll...
7 篇 beijing jiaotong...
6 篇 natl univ singap...
5 篇 fujian normal un...
5 篇 chinese acad sci...
5 篇 univ houston dep...
5 篇 zuse inst berlin...
5 篇 univ michigan de...
5 篇 univ castilla la...
5 篇 univ bern dept b...
5 篇 tsinghua univ de...
5 篇 aalto univ dept ...

作者

21 篇 yokoyama ryohei
20 篇 wakui tetsuya
18 篇 romero ruben
18 篇 fotuhi-firuzabad...
18 篇 rider marcos j.
16 篇 grossmann ignaci...
13 篇 macedo leonardo ...
13 篇 franco john f.
13 篇 lehtonen matti
12 篇 contreras javier
12 篇 parvania masood
11 篇 gicquel celine
11 篇 jooshaki mohamma...
10 篇 cheng chuntian
10 篇 liang yongtu
10 篇 michels adalbert...
10 篇 castro pedro m.
9 篇 catalao joao p. ...
9 篇 papageorgiou laz...
9 篇 zhang haoran

语言

1,796 篇 英文
419 篇 其他
15 篇 中文
2 篇 德文
1 篇 西班牙文
1 篇 日文
1 篇 朝鲜文

检索条件"主题词=Mixed-integer linear programming"

共 2280 条记录，以下是681-690 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

The Dial-a-Ride problem with meeting points: A problem formulation for shared demand–responsive transit

The Dial-a-Ride problem with meeting points: A problem formu...

引用

作者： Cortenbach, L.E. Gkiotsalitis, K. van Berkum, E.C. Walraven, E. Department of Civil Engineering University of Twente Drienerlolaan 5 Enschede7522 NB Netherlands Department of Transportation Planning and Engineering National Technical University of Athens Iroon Polytechniou 5 Athens15773 Greece Anna van Buerenplein 1 The Hague2595 DA Netherlands

In this paper, a formulation for the Dial-a-Ride Problem with Meeting Points (DARPmp) is introduced. The problem consists of defining routes that satisfy trip requests between pick-up and drop-off points while complying with time window, ride time, vehicle load, and route duration constraints. A set of meeting points is defined, and passengers may be asked to use these meeting points as alternative pickup or drop-off points if this results in routes with lower costs. Incorporating meeting points into the DARP is achieved by formulating a mixed-integer linear program. Two preprocessing steps and three valid inequalities are introduced, which improve the computational performance when solving the DARPmp to global optimality. Two versions of the Tabu Search metaheuristic are proposed to approximate the optimal solution in large-scale networks due to the NP-hardness of DARPmp. Performing numerical experiments with benchmark instances, this study demonstrates the benefits of DARPmp compared to DARP in terms of reducing vehicle running costs. © 2024 Elsevier Ltd

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Including the Planning of Orally-Ingested Carbohydrates in a Zone Model Predictive Control for Artificial Pancreas 63

Including the Planning of Orally-Ingested Carbohydrates in a...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Cester, Lorenzo Pavan, Jacopo Favero, Simone Del University of Padova Department of Information Engineering via G. Gradenigo 6/B Padova35131 Italy University of Virginia Center for Diabetes Technology 560 Ray C. Hunt Dr CharlottesvilleVA22903 United States

ISBN: (纸本)9798350316339

Artificial Pancreas (AP) is a technology that assists people with type-1 diabetes (T1D) in the challenge of administering exogenous insulin in order to maintain the blood glucose concentration in a safe range. In this work, we consider a zone Model Predictive Control (zone-MPC) with asymmetric costs, and we add to it the capability to plan and suggest the assumption of carbohydrates (CHO) to the patient. To produce sparse-in-time and quantized CHO suggestions, a mixed integer programming (MIP) formulation of the MPC problem is considered. The resulting algorithm is tuned and validated on the UVa/Padova T1D Simulator, an accurate model of T1D metabolism, approved by the U.S. Food and Drug Administration (FDA) for pre-clinical testing of T1D therapies. The results show that the zone-MPC + CHO suggestions allows to increase the time spent in the blood-glucose safe range on average, with respect to the insulin-only zone-MPC. This is achieved while consistently cutting down the time in hypoglycemia: from 1.2% to 0.3% in median. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Scenario-Oriented Multi-Cut Generalized Benders Decomposition-Based Distributed OPF for AC/DC Hybrid Grids

Scenario-Oriented Multi-Cut Generalized Benders Decompositio...

引用

2024 IEEE PES Innovative Smart Grid Technologies Europe Conference, ISGT EUROPE 2024

作者： Li, Hai-Xiao Ergun, Hakan Van Hertem, Dirk Lekic, Aleksandra Delft University of Technology Faculty of Electrical Engineering Mathematics & Computer Science Delft Netherlands Chongqing University of Technology School of Electrical and Electronic Engineering Chongqing China Ku Leuven Department of Electrical Engineering Leuven Belgium Etch-EnergyVille Genk Belgium

ISBN: (纸本)9789531842976

In this paper, a distributed optimal power flow (OPF) for the AC/DC hybrid grid, composed of the AC grid, renewable energy system (RES), and voltage source converter (VSC)-based multi-terminal DC (MTDC) grid, is presented. Firstly, we apply a series of linear approximations/convex relaxations to construct a mixed-integer convex AC/DC OPF model. To address the uncertainties from RESs, we then illustrate scenario-oriented decision making for the constructed AC/DC OPF model. Additionally, we verify that considering all possible scenarios can be replaced by a small set of extreme scenarios if the OPF model is (mixed-integer) convex. Furthermore, we develop a scenario-oriented multi-cut generalized Benders decomposition to achieve more efficient distributed problem solving for the constructed AC/DC OPF model. Finally, numerical results are provided to validate the effectiveness of our constructed AC/DC OPF model and our developed distributed problem-solving approach. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Distributionally Robust Unit Commitment Considering the Flexibility of Gas-Fired Units

Multi-Stage Distributionally Robust Unit Commitment Consider...

引用

2024 IEEE Power and Energy Society General Meeting, PESGM 2024

作者： Liu, Mao Kong, Xiangyu Zhang, Longyu Key Laboratory of Smart Grid of Ministry of Education Tianjin University Tianjin China

The gas turbine plays a critical role in enhancing the flexibility of the power system due to its capability of rapid start-up and shutdown. To better handle the uncertainties faced in the intraday real-time scheduling process, this study proposes a multi-Stage distributionally robust unit commitment (MDRUC) model based on the Wasserstein metric. Compared with the typical distributionally robust unit commitment (TDRUC) model, the MDRUC model demonstrates higher adaptability under strong uncertainties and provides a larger feasible domain. To address the "curse of dimensionality" encountered in the model's solution process, we propose a mixed approximation rule (MAR), which is transformed into a solvable mixed integer linear programming problem through duality theory. Applying the MDRUC model to the modified 6-bus and 118-bus systems, the operational value of flexibility can be enhanced by up to 4.30% and 0.27%, respectively. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Bi-level Optimization Method for Economic Operation of Integrated Energy Systems 3

A Bi-level Optimization Method for Economic Operation of Int...

引用

3rd International Conference on Energy, Power and Electrical Technology, ICEPET 2024

作者： Wu, Zhijia Sun, Ya Yuan, Shuangchen State Grid Tianjin Chengxi Electric Power Supply Branch Tianjin China Binhai Power Supply Branch of State Grid Tianjin Electric Power Company Tianjin China

ISBN: (纸本)9798350352658

This research aims to propose a bi-level optimization method to lower the cost for integrated energy systems(IES). In the first level, the electrical load is categorized an adjusted by particle swarm optimization algorithm. Then in the second level, the operation cost of IES is minimized by optimizing the output of micro sources in IES which contains a gas-fired generator, an energy storage system, a wind driven generator and a photovoltaic module. This model can be transferred and computed by the mixed integer linear programming method. In the case study, the operation costs solved by the bi-level optimization method and single level method are compared. The output of micro sources is also analyzed. The results demonstrate that the economic performance of IES can be improved to some extent by the proposed method. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimizing Pharmaceutical Supply Chain Configuration in Primary Healthcare: A Mathematical Modeling and Decision Support Approach 13

Optimizing Pharmaceutical Supply Chain Configuration in Prim...

引用

13th International Workshop on Innovative Simulation for Health Care, IWISH 2024, Held at the 21st International Multidisciplinary Modeling and Simulation Multiconference, I3M 2024

作者： AlZaidan, Manal Hadid, Majed Padmanabhan, Regina Kerbache, Laoucine Division of Engineering Management and Decision Sciences College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation Doha Qatar Primary Health Care Cooperation Doha Qatar

ISBN: (纸本)9791281988132

This research project aims to determine the optimal warehouse location allocation for medication distribution to ensure efficient and cost-effective pharmaceutical supply chain *** also aims to make significant contributions to pharmaceutical inventory management and supply chain resilience while providing a tangible and practical solution for improving patient care in public health centers in *** paper presents a mixed-integer linear programming (MILP) model for strategically allocating warehouse locations in a pharmaceutical supply chain, designed to minimize the total operational costs while satisfying regional medication *** demonstrated that a centralized warehouse in the West region, which has the highest number of health centers, offers the most cost-effective solution, indicating reduced transportation costs and improved distribution efficiency over decentralized *** optimal configuration results in significant cost savings and heightened operational efficiency, affirming the strategic advantage of aligning warehouse location with healthcare demand *** expected impacts of the project extend to both practical and scientific *** a practical perspective, the project outcomes will enhance the quality of patient care by improving accessibility to medications, reducing the burden on pharmacies, and reducing cost and efficiency. © 2024 The Authors.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Consideration of round-trip electric car-sharing in residential energy system modeling

Consideration of round-trip electric car-sharing in resident...

引用

2024 IEEE PES Innovative Smart Grid Technologies Europe Conference, ISGT EUROPE 2024

作者： Achatz, Julian Mohapatra, Anurag Hamacher, Thomas Germany

ISBN: (纸本)9789531842976

This paper presents a residential, round-trip, mixed ownership, electric car-sharing scheme with an optimized charging schedule, expressed as a mixed integer linear programming model. Representing the given travel demand as a graph, a mixed (shared and owned cars) ownership fleet configuration, with different trip fulfillment possibilities, is determined using maximal cliques. Next, a car-to-trip allocation model for feasible trip plans, with considerations for equal car utilization and charging price, is used to generate charging profiles for the fleet. The model and the outputs can be variously integrated into existing energy system modeling frameworks. A case study, using data from a test building with a residential car-sharing fleet in Munich, demonstrates the potential of the proposed models to derive meaningful operational insights for fleet and energy system planners. 92% of the recorded trips at the test building could have been feasibly accomplished with only 60% of the available cars. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Neural Embedded Optimization for Integrated Location and Routing Problems

Neural Embedded Optimization for Integrated Location and Rou...

引用

IISE Annual Conference and Expo 2024

作者： Kaleem, Waquar Ayala, Harshita Subramanyam, Anirudh Department of Industrial and Manufacturing Engineering The Pennsylvania State University University ParkPA16802 United States

ISBN: (纸本)9781713877851

We present a novel framework that combines supervised machine learning with integer programming to solve the Capacitated Location-Routing Problem (CLRP). The CLRP is strongly NP-hard and includes two classical combinatorial optimization problems: discrete facility location and vehicle routing. We develop a new solution method that begins by learning a permutation-invariant and sparse neural network that approximates the optimal vehicle routing cost over the sub-graph induced by assigning a subset of customers to any candidate facility. The trained neural network is used as a surrogate within a mixed-integer program (MIP), reformulated using additional variables and constraints, and then solved with an off-the-shelf solver. Computational experiments on large-scale test instances containing up to 200 customers show that our method identifies near-optimal solutions significantly faster than existing problem-specific heuristics. These findings suggest that our neural-embedded framework could be a viable approach for addressing general integrated planning and scheduling problems. © IISE Annual Conference and Expo *** rights reserved.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Sensing Resource Allocation Against Data-Poisoning Attacks in Traffic Routing 63

Sensing Resource Allocation Against Data-Poisoning Attacks i...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Yu, Yue Thorpe, Adam J. Milzman, Jesse Fridovich-Keil, David Topcu, Ufuk University of Minnesota Twin Cities Department of Aerospace Engineering and Mechanics MinneapolisMN United States University of Texas at Austin Oden Institute for Computational Engineering and Sciences Department of Aerospace Engineering and Engineering Mechanics AustinTX United States Devcom Army Research Laboratory 2800 Powder Mill Rd AdelphiMD United States

ISBN: (纸本)9798350316339

Data-poisoning attacks can disrupt the efficient operations of transportation systems by misdirecting traffic flows via falsified data. One challenge in countering these attacks is to reduce the uncertainties on the types of attacks, such as the distribution of their targets and intensities. We introduce a resource allocation method in transportation networks to detect and distinguish different types of attacks and facilitate efficient traffic routing. The idea is to first cluster different types of attacks based on the corresponding optimal routing strategies, then allocate sensing resources to a subset of network links to distinguish attacks from different clusters via lexicographical mixed-integer programming. We illustrate the application of the proposed method using the Anaheim network, a benchmark model in traffic routing that contains more than 400 nodes and 900 links. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A HEURISTIC ALGORITHM FOR SOLVING LOAD-DEPENDENT VEHICLE ROUTING PROBLEM 51

A HEURISTIC ALGORITHM FOR SOLVING LOAD-DEPENDENT VEHICLE ROU...

引用

51st International Conference on Computers and Industrial Engineering, CIE 2024

作者： Trang, N.T. Tai, P.D. Buddhakulsomsiri, J. Parthanadee, P. School of Manufacturing Systems and Mechanical Engineering Sirindhorn International Institute of Technology Thammasat University Pathum Thani12000 Thailand Department of Agro-Industrial Technology Faculty of Agro-Industry Kasetsart University Bangkok Thailand

This paper explores a class of vehicle routing problems that considers the load-dependent distance objective function instead of the total distance. The problem, originating from Thailand's e-commerce delivery business, is formulated as a mixed-integer linear programming model. Since only problem instances of small scale can be solved using the mathematical model, a heuristic algorithm is developed to handle large-scale instances. The algorithm features a load-dependent distance savings algorithm for clustering, and the mathematical model is used for the re-optimization of each cluster. The effectiveness of both the exact method and heuristic is evaluated on several problem instances modified from a standard library. The results indicate that the heuristic can reach near-optimal solutions for instances with known optimal solutions. For those with only lower bounds, solutions from the heuristic show relatively small gaps compared to that of the MILP. In terms of computational time, it is observed that the heuristic algorithm takes a significantly shorter time, especially for larger problem instances, to find a solution than does the mathematical model. © 2024 Computers and Industrial Engineering. All rights reserved.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共228页 << < 65 66 67 68 69 70 71 72 73 74 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：