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

Two novel MILP models with different flexibilities for solving integrated process planning and scheduling problems

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2023年第9期74卷 1955-1967页

作者： Liu, Qihao Li, Xinyu Gao, Liang Fan, Jiaxin Huazhong Univ Sci & Technol Sch Mech Sci & Engn State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China

Process planning and shop scheduling are considered two independent subsystems in traditional flexible manufacturing systems. For correlation and complementarity, integrated process planning and scheduling (IPPS), which has become the main focus of production research, is investigated. The commonly used approaches, intelligent algorithms and their variants, can efficiently find high-quality solutions but cannot guarantee their optimality and stability. To address these shortcomings, based on the OR-nodes of a process network, this paper establishes a mixed-integer linear programming (MILP) model with full-flexibility to solve small-scale IPPS problems. Additionally, for larger-scale problems, another model with semi-flexibility is generated by decomposing the flexibilities into two layers to simplify the original solution space of IPPS. Based on the semi-finished process routes generated by level-1 models, level-2 can search and obtain satisfactory results. The two proposed MILP models are coded in the optimisation programming language and solved by the linear solver CPLEX on 35 benchmark problems with different degrees of flexibility. Extensive experimental results successfully show the superiority of the two proposed models to the other state-of-the-art algorithms and MILP models.

关键词： Scheduling integrated process planning and scheduling mixed-integer linear programming mathematical model benchmark

来源：评论

学校读者我要写书评

暂无评论

Last fifty years of integer linear programming: A focus on recent practical advances

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2025年第3期324卷 707-731页

作者： Clautiaux, Francois Ljubic, Ivana Univ Bordeaux Inst Math Bordeaux CNRS Inria Bordeaux France ESSEC Business Sch Cergy Pontoise France

mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is driven by the enhanced efficiency of modern solvers, which can today find globally optimal solutions within seconds for problems that were out of reach a decade ago. The versatility of these solvers allowed successful applications in many areas, such as transportation, logistics, supply chain management, revenue management, finance, telecommunications, and manufacturing. Despite the impressive success already obtained, many challenges remain, and MILP is still a very active field. This article provides an overview of the most significant results achieved in advancing the MILP solution methods. Given the immense literature on this topic, we made deliberate choices to focus on computational aspects and recent practical performance improvements, emphasizing research that reports computational experiments. We organize our survey into three main parts, dedicated to branch-and-cut methods, Dantzig-Wolfe decomposition, and Benders decomposition. The paper concludes by highlighting ongoing challenges and future opportunities in MILP research.

关键词： Combinatorial optimization mixed-integer linear programming Branch-and-cut Dantzig-Wolfe decomposition Benders decomposition

来源：评论

学校读者我要写书评

暂无评论

Integrating shift planning and pick-up and delivery problems under limited courier availability

引用

European Journal of Operational Research 2025年第2期326卷 343-356页

作者： Ozyavas, Pinar Ursavas, Evrim Buijs, Paul Teunter, Ruud Faculty of Economics and Business University of Groningen Groningen Netherlands

Delivery couriers increasingly demand working in a flexible arrangement. Flexible contracts can be cost-effective from the perspective of a delivery company, but may also cripple its ability to serve all customers in time as couriers are not always available. To alleviate the complexities caused by courier-related constraints, delivery companies usually operate with a work schedule consisting of multiple shifts—allowing couriers to choose the shifts they prefer working in. Inspired by this trend and a real-world case, we propose a variant of pick-up and delivery problem with time windows considering multiple shifts and courier availability. We present a mixed-integer linear programming model and a set partitioning model that maximize the total profit by deciding on the shift allocation and the couriers’ delivery routes, taking courier shift preferences and vehicle availability into account. The model is solved exactly using a branch-price-and-cut algorithm. We generate a set of practically relevant instances to conduct computational experiments. Our results highlight the benefits of bundling customer requests and the challenges posed by limited courier availability in terms of the number of requests served. Bundling mitigates the negative impact of limited courier availability, while having more couriers can serve as an alternative. © 2025 The Authors

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Conception of a new 4-quadrant hydrogen compressed air energy storage power plant with an integrated electrolyzer

引用

Energy Reviews 2024年第3期3卷 92-101页

作者： Hans-Peter Beck Ann-Kathrin Klaas Christoph Klaas Research Center Energy Storage Technologies Clausthal University of TechnologyAm Stollen 19A38640GoslarGermany Institute of Electrical Power Engineering and Energy Systems Clausthal University of TechnologyLeibnizstraße 2838678Clausthal-ZellerfeldGermany

A hydrogen compressed air energy storage power plant with an integrated electrolyzer is ideal for large-scale,long-term energy storage because of the emission-free operation and the possibility to offer multiple ancillary services on the German energy *** paper defines analyzes such a storage concept and conducts an extensive comparison with four additional storage concepts based on various *** results show that the combination of storing compressed air and hydrogen offers a higher efficiency than storing only hydrogen and lower specific investment costs than storing only compressed *** result is confirmed with analysis of the optimal sizing of each power plant component for simultaneous participation on multiple energy markets with a linear optimization dispatch *** hydrogen compressed air energy storage(HCAES)power plant can utilize more revenue possibilities than a hydrogen energy storage because of the higher round-trip efficiency and the combination of the air compressor and the integrated electrolyzer during charging *** integration of the electrolyzer,however,offers a couple of challenges itself because of the highly flexible operation mode.A new concept for the controllable 24-pulse diode-thyristor rectifier of the electrolyzer is presented,that uses mostly common components while offering little to no grid harmonics and a long *** flexible integrated electrolyzer allows for the 4-quadrant operation of the storage power plant.

关键词： Long-term energy storage Hydrogen energy storage Compressed air energy storage mixed-integer linear programming Electrolyzer 24-Pulse thyristor rectifier

来源：评论

学校读者我要写书评

暂无评论

4D BIM integrated optimization of construction steel bar procurement plan for limited storage capacity

引用

CONSTRUCTION INNOVATION-ENGLAND 2024年

作者： Khondoker, Md. Tareq Hossain Hossain, Md. Mehrab Saha, Ayan Khulna Univ Engn & Technol Dept Bldg Engn & Construct Management Khulna Bangladesh

PurposeDue to its longer length compared to other construction materials and distinctive stacking patterns, obtaining construction steel bars in congested construction sites with limited storage capacity becomes challenging. Lack of storage space in crowded places prompts the need for building steel bar storage choice optimization. Therefore, this study aims to optimize the construction steel bar procurement plan by providing when and how much rebar to order and how to stack different sizes of rebar considering limited storage ***/methodology/approachA novel approach has been presented in this paper by integrating 4D building information modelling (BIM) and mixed-integer linear programming (MILP). This technique uses BIM to retrieve material quantities, including rebar, during the design phase. Following that, activities are scheduled depending on the duration determined by crew productivity data and material quantity. Then, based on the prior price, the price of each unit of rebar is projected for the duration of construction using the exponential smoothing method. After that, the MILP approach is used to generate an optimal steel bar procurement plan for limited storage space following the scheduled rebar-related *** developed strategy minimizes overall procurement costs and ensures the storage of rebar as per standard guidelines. An optimal rebar procurement and storage plan to construct a six-storied RC frame has been presented in this paper as a demonstrative example to show the effectiveness of the proposed ***/valueThis work partially satisfies a long-sought research need for establishing a comprehensive construction steel bar procurement system, making it a very useful source of information for practitioners and researchers. The proposed method can be used to minimize a key performance limitation that the conventional rebar procurement practice for crowded building sites may experience.

关键词： Rebar procurement Capacity constraint 4D BIM mixed-integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective

引用

ANNALS OF OPERATIONS RESEARCH 2024年第1期338卷 13-40页

作者： Sanchidrian, Tamara Borreguero Portoleau, Tom Artigues, Christian Sanchez, Alvaro Garcia Mier, Miguel Ortega Lopez, Pierre Airbus Paseo John Lennon S-N Getafe 28906 Spain Univ Toulouse CNRS LAAS 7 Ave Colonel Roche F-31400 Toulouse France Univ Politecn Madrid Ind Engn & Logist Res Grp ETSII Jose Gutierrez Abascal 2 Madrid 28006 Spain

This paper deals with a scheduling problem arising at the tactical decision level in aeronautical assembly line. It has the structure of a challenging multi-mode resource-constrained project scheduling problem with incompatibility constraints, a resource leveling objective and also a large number of tasks. We first present a new event-based mixed-integer linear programming formulation and a standard constraint programming formulation of the problem. A large-neighborhood search approach based on the constraint programming model and tailored to the resource leveling objective is proposed. The approaches are tested and compared using industrial instances, yielding significant improvement compared to the heuristic currently used by the company. Moreover, the large-neighborhood search method significantly improves the method proposed in the literature on a related multi-mode resource investment problem when short CPU times are required.

关键词： Aeronautical assembly line scheduling Multiple modes Resource leveling mixed-integer linear programming Constraint programming Large neighborhood search

来源：评论

学校读者我要写书评

暂无评论

Optimal Switch and Tie Line Planning in Distribution Networks: Benchmarking a Practical MILP Model with a Fast Heuristic Approach

引用

IEEE Transactions on Power Systems 2024年第4期40卷 2860-2872页

作者： Jooshaki, Mohammad Karimi-Arpanahi, Sahand Millar, R. John Anttila, Jaakko Lehtonen, Matti Fotuhi-Firuzabad, Mahmud Circular Economy Solutions Unit EspooFI-02151 Finland University of Adelaide School of Electrical and Mechanical Engineering AdelaideSA 5005 Australia Aalto University Department of Electrical Engineering and Automation Espoo02150 Finland Trimble Utilities & Public Administration - Europe Espoo02600 Finland Sharif University of Technology Electrical Engineering Department Tehran11155-4363 Iran

Optimal placement of switches and tie lines is an integral task in distribution system planning. Owing to the problem complexity and the presence of binary decision variables, using heuristic methods for obtaining a close to optimal switch and tie line plan is a common practice in industry. Efforts to employ mixed-integer linear programming (MILP) to guarantee the solution optimality also tend to sacrifice the modeling accuracy through oversimplifying assumptions to make the problem tractable. Aiming to tackle these challenges, we present an efficient, yet accurate, MILP model for optimal switch and tie line planning. The proposed model avoids common simplifying assumptions in the state-of-the-art MILP models while preserving the solving efficiency. In order to demonstrate the applicability and scalability of the proposed MILP approach, it is applied to multiple test networks, and the results are compared with those of a fast heuristic model. The outcomes not only represent the high efficiency and accuracy of the MILP model but also validate the close to optimality of the heuristic approach developed for practical applications as a module in a commercial distribution system planning toolbox. © 1969-2012 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The synchronised asymmetric multiple travelling salesman problem in a job shop with transportation environment

引用

JOURNAL OF CONTROL AND DECISION 2025年

作者： Zhang, Hui Si, Pengju Fu, Yaping Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China Jiangsu Univ Sci & Technol Sch Econ & Management Zhenjiang 212003 Peoples R China Henan Univ Sci & Technol Sch Informat Engn Luoyang Peoples R China Qingdao Univ Sch Business Qingdao Peoples R China

In smart factories, transfer vehicles streamline the material handling of machines, leading to the complex job shop scheduling problem with transportation (JSSPT). Establishing a concise and effective mixed-integer linear programming (MILP) model for the JSSPT is challenging due to the intricate interaction of job scheduling and vehicle routing. To address the challenge, this paper described the JSSPT as a synchronised asymmetric multiple travelling salesman problem based on a disjunctive directed graph. A MILP model is subsequently developed, followed by an analysis of its inherent properties. Numerical experiments demonstrate that the proposed MILP model outperforms several published heuristic algorithms and MILP models on standard instances. Further analysis reveals that under specific parameters, the optimisation objectives of makespan and exit time align. Additionally, a heuristic strategy of scheduling vehicles prior to scheduling jobs yields better lower and upper bounds for the optimal solution compared to scheduling jobs first.

关键词： Synchronised asymmetric multiple travelling salesman problem job shop scheduling problem with transportation mixed-integer linear programming multi-attribute disjunctive directed graph material handling

来源：评论

学校读者我要写书评

暂无评论

Enabling Research through the SCIP Optimization Suite 8.0

引用

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2023年第2期49卷 1-21页

作者： Bestuzheva, Ksenia Besancon, Mathieu Chen, Wei-Kun Chmiela, Antonia Donkiewicz, Tim Van Doornmalen, Jasper Eifler, Leon Gaul, Oliver Gamrath, Gerald Gleixner, Ambros Gottwald, Leona Graczyk, Christoph Halbig, Katrin Hoen, Alexander Hojny, Christopher Van Der Hulst, Rolf Koch, Thorsten Luebbecke, Marco Maher, Stephen J. Matter, Frederic Muehmer, Erik Mueller, Benjamin Pfetsch, Marc E. Rehfeldt, Daniel Schlein, Steffan Schloesser, Franziska Serrano, Felipe Shinano, Yuji Sofranac, Boro Turner, Mark Vigerske, Stefan Wegscheider, Fabian Wellner, Philipp Weninger, Dieter Witzig, Jakob Zuse Inst Berlin Dept AIS2T Takustr 7 D-14195 Berlin Germany Beijing Inst Technol Sch Math & Stat 5 Zhongguancun South St Beijing 100081 Peoples R China Rhein Westfal TH Aachen Lehrstuhl Operat Res Kackertstr 7 D-52072 Aachen Germany Eindhoven Univ Technol Dept Math & Comp Sci POB 513 NL-5600 MB Eindhoven Netherlands Zuse Inst Berlin Dept ZIB AIS2T & I2DAMO GmbH Englerallee 19 D-14195 Berlin Germany Friedrich Alexander Univ Erlangen Nurnberg Dept Data Sci Cauerstr 11 D-91058 Erlangen Germany Univ Twente Dept Discrete Math & Math Programming POB 217 NL-7500 AE Enschede Netherlands Tech Univ Berlin Chair Software & Algorithms Discrete Optimizat Str 17 Juni 135 D-10623 Berlin Germany ZIB Dept A2IM Takustr 7 D-14195 Berlin Germany Univ Exeter Coll Engn Math & Phys Sci Harrison BldgStreatham CampusN Pk Rd Exeter EX4 4QF England Tech Univ Darmstadt Fachbereich Math Dolivostr 15 D-64293 Darmstadt Germany Zuse Inst Berlin Dept A2IM Takustr 7 D-14195 Berlin Germany Tech Univ Berlin Berlin Germany Zuse Inst Berlin GAMS Software GmbH Dept AIS2T Takustr 7 D-14195 Berlin Germany

The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. The focus of this article is on the role of the SCIP Optimization Suite in supporting research. SCIP's main design principles are discussed, followed by a presentation of the latest performance improvements and developments in version 8.0, which serve both as examples of SCIP's application as a research tool and as a platform for further developments. Furthermore, this article gives an overview of interfaces to other programming and modeling languages, new features that expand the possibilities for user interaction with the framework, and the latest developments in several extensions built upon SCIP.

关键词： Constraint integer programming linear programming mixed-integer linear programming mixed-integer nonlinear programming optimization solver branch-and-cut branch-and-price column generation parallelization mixed-integer semidefinite programming

来源：评论

学校读者我要写书评

暂无评论

Tight power and energy coupling constraints of energy storage resources for unit commitment

引用

IET RENEWABLE POWER GENERATION 2023年第9期17卷 2276-2289页

作者： Yu, Yaowen Yan, Bing Gao, Yijie Li, Yuanzheng Sun, Liangliang Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Key Lab Image Proc & Intelligent Control Wuhan Hubei Peoples R China Rochester Inst Technol Elect & Microelect Engn Rochester NY 14623 USA Northeastern Univ Sch Control Engn Shenyang Liaoning Peoples R China

Energy Storage Resources (ESRs) can help promote high penetrations of renewable generation and shift the peak load. However, the increasing number of ESRs and their features different from conventional generators bring computational challenges to operations of wholesale electricity markets. In order to improve the computational efficiency, this paper tightens the generic ESR formulation for unit commitment. To avoid the complexity caused by ESR operations in both discharge and charge directions, a novel "decoupled analysis" is conducted to analyze one direction at a time. For each direction, ESRs over two and three time periods are categorized into several types based on their parameters. For each type, our recent four-step systematic formulation tightening approach is used to construct the corresponding tight formulation. In order to consider more periods without analyzing all the drastically increased number of types, a series of major types are selected based on how many periods an ESR is able to discharge (charge) consecutively at the upper power limit. A related generic form of tight constraints over multiple periods is established. Moreover, validity and facet-defining proofs of our tight constraints have been provided. Numerical testing results illustrate the tightening process and demonstrate computational benefits of the tightened formulations.

关键词： energy storage formulation tightening mixed-integer linear programming unit commitment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：