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

A mixed-integer linear programming model for sustainable blood supply chain problems with shelf-life time and multiple blood types

引用

Decision Analytics Journal 2023年 8卷

作者： Mansur, Agus Handayani, Dwi Iryaning Wangsa, Ivan Darma Utama, Dana Marsetiya Jauhari, Wakhid Ahmad Department of Industrial Engineering Faculty of Industrial Technology Universitas Islam Indonesia Yogyakarta 55584 Indonesia Department of Industrial Engineering Universitas Panca Marga Jl. Raya Dringu Krajan Mayangan Probolinggo Indonesia Department of Industrial and Systems Engineering Institut Teknologi Sepuluh Nopember Surabaya Kampus ITS Sukolilo 60111 Indonesia Department of Industrial Engineering University of Muhammadiyah Malang Malang Indonesia Department of Industrial Engineering Universitas Sebelas Maret Jl. Ir Sutami 36 A Surakarta 57126 Indonesia

The blood supply chain (BSC) is a complex system with optimization challenges, whose activities impact carbon emissions and the environment, especially with regard to the disposal of expired blood bag waste. This study proposes a new mixed-integer linear programming (MILP) model that considers multiple echelons, multiple blood types, transportation and production emissions, and blood bag shelf life to maximize profit in the blood supply chain system. The model is applied to a real-world case study. The research results confirmed that the model could mitigate the BSC challenges. We also conducted sensitivity analysis of patient demand parameters, blood production capacity, selling price, and shelf life to investigate the impact of the key factors affecting the total profit, costs, carbon emissions, and number of obsolete products. © 2023 The Author(s)

关键词： Blood supply chain Blood type Carbon emission mixed-integer linear programming Shelf-life time Sustainability

来源：评论

学校读者我要写书评

暂无评论

Offline segmentation of spatio-temporal order trajectories by mixed-integer linear programming for determining process times in production systems

引用

Procedia CIRP 2022年 107卷 712-717页

作者： Maximilian Volk Carina Mieth Karlsruhe Institute of Technology Kaiserstraβe 12 76131 Karlsruhe Germany TRUMPF Machine Tools Inc. Johann-Maus-Straβe 2 71254 Ditzingen Germany TU Dortmund University Emil-Figge-Straβe 61 44227 Dortmund Germany

Real-time indoor positioning systems in manufacturing systems are used to track production orders. This generates spatio-temporal trajectories which can be segmented to determine process times. We present formulations of the offline segmentation problem as mixed-integer linear programs (MILPs) that utilize the sequence of processing steps from ERP systems. The MILP formulations are compared with online heuristics in terms of their accuracy and computational effort on data generated with features from a real job shop. We show that in terms of accuracy our offline segmentation formulations outperform the online heuristics with increasing measurement errors, justifying their higher computational effort.

关键词： indoor positiong systems mixed-integer linear programming process time estimation trajectory segmentation spatio-temporal production data

来源：评论

学校读者我要写书评

暂无评论

Formulating multi-class user equilibrium using mixed-integer linear programming

引用

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2022年 11卷

作者： Lin, Xiao Leclercq, Ludovic Tavasszy, Lorant van Lint, Hans Delft Univ Technol Dept Transport & Planning Stevinweg 1 NL-2628 CN Delft Netherlands Univ Gustave Eiffel ENTPE LICIT Lyon France

We introduce an approach to formulate and solve the multi-class user equilibrium traffic assignment as a mixed-integer linear programming (MILP) problem. Compared to simulation approaches, the analytical MILP formulation makes the solution of network assignment problems more tractable. When applied in a multi -class context, it obviates the need to assume a symmetrical influence between classes and thereby allows richer traffic behavior to be taken into account. Also, it integrates naturally in optimization problems such as maintenance planning and traffic management. We develop the model and apply it for the Sioux Falls network, showing that it outperforms the traditional Beckmann-based and MSA approaches in smaller-scale problems. Further research opportunities lie in developing extensions of MILP-based assignment, with different variants of user equilibrium or dynamic assignment, and in improving the model and solution algorithms to allow large-scale application.

关键词： Traffic assignment User equilibrium Mathematical programming mixed-integer linear programming Multi-class

来源：评论

学校读者我要写书评

暂无评论

Simultaneous line planning and timetabling based on a combinational travel network for both trains and passengers: a mixed-integer linear programming approach

引用

TRANSPORTMETRICA A-TRANSPORT SCIENCE 2020年第3期16卷 1333-1374页

作者： Zhou, Wenliang Li, Xiang Xue, Lijuan Deng, Lianbo Yang, Xia Cent South Univ Sch Traff & Transportat Engn Changsha 410075 Peoples R China Cent South Univ Rail Data Res & Applicat Key Lab Hunan Prov Changsha 410075 Peoples R China SUNY Polytech Inst Dept Civil Engn Utica NY USA

This paper is devoted to designing a mixed-integer linear programming to solve the simultaneous line planning and timetabling problem. A directed graph is first constructed to represent the combinational travel network for both candidate trains and passengers. Through this graph, it is easy to simultaneously describe trains' operation choices, passengers' travel choices, and their restrictive relations. Based on it, a mixed-integer linear programming model with many binary and non-negative integer decision variables is built to simultaneously optimize the line plan, timetable, and passenger travel choices, which can be efficiently solved using commercial solver CPLEX for small-scale network, while a decomposition strategy is required to combine with CPLEX for large-scale network. A set of numerical experiments are carried out to analyse the impacts of flow sub-units, number of candidate trains, and weight factors. Finally, we conduct two case studies for testing the practicability of our proposed method.

关键词： Timetabling line planning rail network combinational travel network mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling algorithm in point merge system including holding pattern based on mixed-integer linear programming

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING 2020年第10期234卷 1638-1647页

作者： Lee, Somang Hong, Youkyung Kim, Youdan Seoul Natl Univ Dept Aerosp Engn Seoul 08826 South Korea Seoul Natl Univ Inst Adv Aerosp Technol Seoul 08826 South Korea

An optimal scheduling algorithm of the point merge system that considers a holding pattern is presented based on mixed-integer linear programming. The route structure of the point merge system is constructed by adopting virtual fixes, and appropriate constraints are included to integrate a holding pattern into the formulation of point merge system. The performance of the proposed point merge system holding algorithm is demonstrated by comparing with the point merge system and first-come first-served algorithms via Monte Carlo simulation. Simulation reveals that the point merge system holding algorithm shows the best performance in terms of delay reduction and intervention rate by air traffic controllers. The proposed point merge system holding algorithm is expected to assist human air traffic controllers as a decision support tool.

关键词： Air traffic management point merge system holding pattern mixed-integer linear programming sequencing and scheduling

来源：评论

学校读者我要写书评

暂无评论

PAAMP: Polytopic Action-Set And Motion Planning for Long Horizon Dynamic Motion Planning via mixed integer linear programming

PAAMP: Polytopic Action-Set And Motion Planning for Long Hor...

引用

2024 International Conference on Intelligent Robots and Systems

作者： Jaitly, Akshay Farzan, Siavash Worcester Polytech Inst Robot Engn Dept Worcester MA 01609 USA Calif Polytech State Univ San Luis Obispo Elect Engn Dept San Luis Obispo CA 93407 USA

ISBN: (纸本)9798350377712;9798350377705

Optimization methods for long-horizon, dynamically feasible motion planning in robotics tackle challenging non-convex and discontinuous optimization problems. Traditional methods often falter due to the nonlinear characteristics of these problems. We introduce a technique that utilizes learned representations of the system, known as Polytopic Action Sets, to efficiently compute long-horizon trajectories. By employing a suitable sequence of Polytopic Action Sets, we transform the long-horizon dynamically feasible motion planning problem into a linear Program. This reformulation enables us to address motion planning as a mixed integer linear Program (MILP). We demonstrate the effectiveness of a Polytopic Action-Set and Motion Planning (PAAMP) approach by identifying swing-up motions for a torque-constrained pendulum as fast as 0.75 milliseconds. This approach is well-suited for solving complex motion planning and long-horizon Constraint Satisfaction Problems (CSPs) in dynamic and underactuated systems such as legged and aerial robots.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Determination of optimal breakpoint set of overcurrent relays using modified depth-first search and mixed-integer linear programming

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2020年第23期14卷 5607-5616页

作者： Ghotbi-Maleki, Mahdi Chabanloo, Reza Mohammadi Ebadi, Mohammad Amin Savaghebi, Mehdi Shahid Beheshti Univ Dept Elect Engn AC Tehran Iran Univ Southern Denmark Dept Mech & Elect Engn Elect Engn Sect DK-5230 Odense Denmark

In the process of determination of breakpoints for overcurrent relays (OCR), different sets with equal number of OCRs can be selected as minimum breakpoint set (MBPS). Therefore, determination of the most appropriate MBPS is an issue which must be considered. This paper proposes a prioritization between different MBPSs based on the sum of operating times of OCRs. In this case, a set which results the minimum sum of operating times is selected as the appropriate MBPS. For this purpose, the proposed method combines two problems: determination of MBPS and coordination of OCRs, and is expressed in mixed-integer linear programming (MILP) form. Also, a modified depth-first search (DFS) algorithm is applied to determine the OCRs contained loops of studied networks. It is shown that the proposed method has the capability to be combined with previous defined expert rules in this field in order to consider the network conditions in the process of determination of optimal breakpoint set (OBPS). The proposed method has been implemented on various size networks, and the results show the effectiveness of proposed method in determining breakpoint set with the least number in first priority and minimum operating times of relays in second priority.

关键词： relay protection overcurrent protection integer programming linear programming search problems minimum breakpoint set mixed-integer linear programming optimal breakpoint set 14-bus 30-bus 118-bus 3120-bus overcurrent relays power delivery systems modified depth-first search network conditions expert rule

来源：评论

学校读者我要写书评

暂无评论

Task allocation and trajectory planning for multiple agents in the presence of obstacle and connectivity constraints with mixed-integer linear programming

引用

INTERNATIONAL JOURNAL OF ROBUST AND NONlinear CONTROL 2020年第14期30卷 5464-5491页

作者： Afonso, Rubens J. M. Maximo, Marcos R. O. A. Galvao, Roberto K. H. Tech Univ Munich Inst Flight Syst Dynam Dept Aerosp & Geodesy Bavaria Germany Inst Tecnol Aeronaut Elect Engn Div Sao Paulo Brazil Inst Tecnol Aeronaut Autonomous Computat Syst Lab LAB SCA Div Comp Sci Sao Paulo Brazil

This article addresses the problem of maneuvering multiple agents that must visit a number of target sets, while enforcing connectivity constraints and avoiding obstacle as well as interagent collisions. The tool to cope with the problem is a formulation of model predictive control including binary decision variables. In this regard, two mixed-integer linear programming formulations are presented, considering a trade-off between optimality and scalability between them. Simulation results are also shown to illustrate the main features of the proposed approaches.

关键词： connectivity maintenance cooperative multiple agents mixed-integer linear programming obstacle avoidance

来源：评论

学校读者我要写书评

暂无评论

Peak Load Shaving in Virtual Power Plants Utilizing mixed integer linear programming 7

Peak Load Shaving in Virtual Power Plants Utilizing Mixed In...

引用

7th IEEE Student Conference on Electric Machines and Systems, SCEMS 2024

作者： Zhu, Haoze He, Yaoming Xu, Dali Guan, Kesi Zhao, Xunan State Grid Liaoning Electric Power Co. Ltd Anshan Power Supply Company Anshan China

ISBN: (数字)9798350366945

ISBN: (纸本)9798350366945

This paper proposes a virtual power plant (VPP) peak load shaving control strategy that takes into account both safety and economic factors, aiming to reduce operational costs for the power system. By employing mixed integer linear programming (MILP), the strategy minimizes energy and demand charges, effectively shaving peak load demands. It optimizes embedded energy resources (EERs), including distributed energy storage (DES) and renewable energy sources (RES), to decrease load during peak times. Additionally, demand response (DR) is utilized during peak periods to limit the use of consumers' electric water heaters (EWH), heat pumps (HP), and baseboard heater (BBH). The results demonstrate that the proposed control strategy can shave up to three daily load peaks, meeting the requirements for safety and reliability while enhancing the economic benefits for power companies and consumers. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A mixed-integer linear programming model for solving fuzzy stochastic resource constrained project scheduling problem

引用

OPERATIONAL RESEARCH 2020年第1期20卷 197-217页

作者： Alipouri, Yagub Sebt, Mohammad Hassan Ardeshir, Abdollah Zarandi, Mohammad Hossein Fazel Amirkabir Univ Technol Dept Civil & Environm Engn Tehran Polytech Hafez St Tehran 158754413 Iran Amirkabir Univ Technol Dept Ind Engn Tehran Polytech Hafez St Tehran Iran

This paper addresses resource-constrained project scheduling problem with mixed uncertainty of randomness and fuzziness (FS-RCPSP). The activity durations are considered to be fuzzy random variables. A resource flow network based mathematical model with fuzzy random variables is presented. Then, this model is transformed into a mixed-integer linear programming model with crisp variables. The CPLEX 12.6.0.1 solver in AIMMS (2014) is employed for applying the proposed model to solve 960 benchmark instances generated from the well-known sets J30 and J60 in PSPLIB. The computational results are encouraging and indicate the ability of the proposed model to handle the FS-RCPSP.

关键词： Combinatorial optimization Fuzzy stochastic resource-constrained project scheduling problem Fuzzy random variables mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：