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

mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem

引用

COMPUTERS & OPERATIONS RESEARCH 2025年 175卷

作者： Nixon, Tanner Curry, Robert M. Allaissem, B. Phanuel US Navy Arlington VA USA Univ Arkansas Coll Engn Dept Ind Engn 800 W Dickson St Fayetteville AR 72701 USA

Various applications in contested logistics and infrastructure restoration require dynamic flow solutions characterized by a schedule of network flows consecutively transmitted over a sequence of successive periods. For these schedules, we assume flows transmit via arcs during periods while flows reside at nodes from one period to the next. Within this context, we introduce the Maximum Value Dynamic Network Flow Problem (MVDFP) in which we seek to maximize the cumulative value of a non-simultaneous network flow schedule that accumulates node value whenever some minimum amount of flow resides at a node between periods. For solving the MVDFP, we first introduce a large mixed-integer program (MIP). As this MIP can become computationally-expensive for large networks, we present a trio of computationally-effective, easy to implement heuristic approaches that solve a series of smaller, more manageable MIPs. These heuristic approaches typically determine high-quality solutions significantly faster than the MIP obtains an optimal solution by dividing the full network flow schedule into a sequence of consecutive shorter network flow subschedules. In many cases, at least one of our heuristic approaches produces an optimal solution in a fraction of the MIP's computational time. We present extensive computational results to highlight our heuristics' efficacy, discuss for what instances each approach may be most applicable, and detail future research avenues.

关键词： Network flow optimization mixed-integer programming Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Multi-man-robot collaborative disassembly line balancing optimization via mixed-integer programming and genetic Jaya algorithm

引用

JOURNAL OF CLEANER PRODUCTION 2025年 490卷

作者： Yin, Tao Wu, Jiapeng Cao, Jungang Huang, Yunwei Li, Chuan Long, Jianyu Dongguan Univ Technol Sch Mech Engn Dongguan 523808 Peoples R China Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710049 Peoples R China Univ Seville Dept Comp Sci & Artificial Intelligence Seville 41003 Spain

Investigating disassembly line balancing problems (DLBP) is essential for the cleaner production and sustainable reuse of large-scale end-of-life products. Multi-man-robot shared-station and man-robot interactive collaboration are two critical approaches to enhance the efficiency of disassembly lines. This study combines these two approaches to innovatively design a multi-man-robot collaborative disassembly station and develops the corresponding DLBP (MMRC-DLBP). To effectively address this problem, a mixed-integer programming (MIP) model is established to solve the global minima of the number of stations, the number of operators (workers and robots), the total disassembly time and the idle balancing index. Given the limitations of MIP models in solving the NPhard problem, a genetic Jaya algorithm (GJA) combining the strengths of the genetic algorithm and the Jaya algorithm is proposed to optimize the large-scale MMRC-DLBP. Subsequently, correctness of the MIP model and GJA is mutually verified by solving a small-scale case. The superior performance of the GJA in solving DLBP is demonstrated by solving the medium-scale and large-scale cases and comparing the results with those of existing algorithms from the literature. Finally, GJA is applied to the balancing optimization of a multi-man-robot collaborative disassembly line for obsolete televisions, and its superiority in solving MMRC-DLBP is confirmed by comparing the results with those of the five published algorithms.

关键词： Interactive collaboration Disassembly line balancing mixed-integer programming Genetic Jaya algorithm

来源：评论

学校读者我要写书评

暂无评论

Real-Time mixed-integer Quadratic programming for Vehicle Decision-Making and Motion Planning

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2025年第1期33卷 77-91页

作者： Quirynen, Rien Safaoui, Sleiman Di Cairano, Stefano Mitsubishi Elect Res Labs Cambridge MA 02139 USA

We develop a real-time feasible mixed-integer programming-based decision-making (MIP-DM) system for automated driving (AD). Using a linear vehicle model in a road-aligned coordinate frame, the lane change constraints, collision avoidance, and traffic rules can be formulated as mixed-integer inequalities, resulting in a mixed-integer quadratic program (MIQP). The proposed MIP-DM performs maneuver selection and trajectory generation by solving the MIQP at each sampling instant. While solving MIQPs in real time has been considered intractable in the past, we show that our recently developed solver BB-ASIPM is capable of solving MIP-DM problems on embedded hardware in real time. The performance of this approach is illustrated in simulations in various scenarios, including merging points and traffic intersections, and hardware-in-the-loop (HIL) simulations in dSPACE Scalexio and MicroAutoBox-III (MABX-III). Finally, we show experiments using small-scale vehicles.

关键词： Trajectory Decision making Computer architecture Planning Real-time systems Vehicle dynamics Hardware Autonomous driving decision-making mixed-integer programming motion planning predictive control

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming techniques for the connected max-k-cut problem

引用

MATHEMATICAL programming COMPUTATION 2021年第1期13卷 75-132页

作者： Hojny, Christopher Joormann, Imke Luethen, Hendrik Schmidt, Martin Tech Univ Eindhoven Combinatorial Optimizat Grp POB 513 NL-5600 MB Eindhoven Netherlands Tech Univ Carolo Wilhelmina Braunschweig Inst Automot Management & Ind Prod Muhlenpfordtstr 23 D-38106 Braunschweig Germany Tech Univ Darmstadt Discrete Optimizat Dolivostr 15 D-64293 Darmstadt Germany Trier Univ Dept Math Univ Ring 15 D-54296 Trier Germany

We consider an extended version of the classical Max-k-Cut problem in which we additionally require that the parts of the graph partition are connected. For this problem we study two alternative mixed-integer linear formulations and review existing as well as develop new branch-and-cut techniques like cuts, branching rules, propagation, primal heuristics, and symmetry breaking. The main focus of this paper is an extensive numerical study in which we analyze the impact of the different techniques for various test sets. It turns out that the techniques from the existing literature are not sufficient to solve an adequate fraction of the test sets. However, our novel techniques significantly outperform the existing ones both in terms of running times and the overall number of instances that can be solved.

关键词： Max-cut Connectivity Branch-and-cut mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming model and hybrid local search genetic algorithm for human-robot collaborative disassembly line balancing problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第5期62卷 1758-1782页

作者： Wu, Tengfei Zhang, Zeqiang Zeng, Yanqing Zhang, Yu Southwest Jiaotong Univ Sch Mech Engn Chengdu Peoples R China Technol & Equipment Rail Transit Operat & Maintena Chengdu Peoples R China Southwest Jiaotong Univ Sch Mech Engn Chengdu 610031 Peoples R China Technol & Equipment Rail Transit Operat & Maintena Chengdu 610031 Peoples R China

Human-robot collaborative technology maximises the advantages of the capabilities of humans and robots, and provides diverse operating scenarios for the remanufacturing industry. Accordingly, this paper proposes an innovative human-robot collaborative disassembly line balancing problem (HRC-DLBP). First, a mixed-integer programming (MIP) model is devised for the HRC-DLBP to minimise the number of workstations, smoothness index, and various costs. Second, a hybrid local search genetic algorithm (HLSGA) is developed to solve the proposed HRC-DLBP efficiently. According to the problem characteristics, a four-layer encoding and decoding strategy was constructed. The search mechanism of the local search operator was improved, and its search strategy was adjusted to suit the genetic algorithm structure better. Furthermore, the accuracy of the proposed MIP model and HLSGA is verified through two HRC-DLBP examples. Subsequently, three HRC-DLBP examples are used to prove that the HLSGA is superior to five other excellent algorithms. The case of the two-sided disassembly line problem reported in the literature is also solved using the HLSGA. The results are found to be significantly better than the reported outputs of the improved whale optimisation algorithm. Besides, HLSGA also outperforms the results reported in the literature in solving EOL state-oriented DLBP. Finally, the HLSGA is applied to a power battery disassembly problem, and several optimal allocation schemes are obtained.

关键词： Human-robot collaborative disassembly line balancing mixed-integer programming hybrid local search genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming for QoS-Based Web Service Matchmaking

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2009年第2期2卷 122-139页

作者： Kritikos, Kyriakos Plexousakis, Dimitris Univ Crete GR-71409 Iraklion Crete Greece Fdn Res & Technol Hellas FORTH Inst Comp Sci GR-70013 Iraklion Crete Greece

QoS-based Web Service (WS) discovery has been recognized as the main solution for filtering and selecting between functionally equivalent WSs stored in registries or other types of repositories. There are two main techniques for QoS-based WS matchmaking (filtering): ontology-based and Constraint programming (CP)-based. Unfortunately, the first technique is not efficient as it is based on the rather immature technology of ontology reasoning, while the second one is not accurate as it is based on syntactic QoS-based descriptions and faulty matchmaking metrics. In our previous work, we have developed an extensible and rich ontology language for QoS-based WS description. Moreover, we have devised a semantic alignment algorithm for aligning QoS-based WS descriptions so as to increase the accuracy of QoS-based WS matchmaking algorithms. Finally, we have developed two alternative CP-based QoS-based WS matchmaking algorithms: a unary-constrained and n-ary-constrained one. In this paper, we claim that mixed-integer programming (MIP) should be used as a matchmaking technique instead of CP and we provide experimental results proving it. In addition, we analyze and experimentally evaluate our matchmaking algorithms against a competing techniques one in order to demonstrate their efficiency and accuracy.

关键词： QoS Web-based services service discovery service matchmaking constraint programming linear programming mixed-integer programming performance evaluation

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming formulation of a data-driven solver in computational elasticity

引用

OPTIMIZATION LETTERS 2019年第7期13卷 1505-1514页

作者： Kanno, Yoshihiro Univ Tokyo Math & Informat Ctr Hongo 7-3-1 Tokyo 1138656 Japan

This paper presents a mixed-integer quadratic programming formulation of an existing data-driven approach to computational elasticity. This formulation is suitable for application of a standard mixed-integer programming solver, which finds a global optimal solution. Therefore, the results obtained by the presented method can be used as benchmark instances for any other algorithm. Preliminary numerical experiments are performed to compare quality of solutions obtained by the proposed method and a heuristic conventionally used in the data-driven computational mechanics.

关键词： Global optimization mixed-integer programming Exact solution method Data-driven computing Model-free computational mechanics

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations

引用

ANNALS OF OPERATIONS RESEARCH 2007年第1期155卷 119-142页

作者： Al-Yakoob, Salem M. Sherali, Hanif D. Kuwait Univ Coll Sci Dept Math & Comp Sci Safat 13060 Kuwait Virginia Polytech Inst & State Univ Grado Dept Ind & Syst Engn Blacksburg VA 24061 USA

This paper is concerned with the problem of assigning employees to gas stations owned by the Kuwait National Petroleum Corporation (KNPC), which hires a firm to prepare schedules for assigning employees to about 86 stations distributed all over Kuwait. Although similar employee scheduling problems have been addressed in the literature, certain peculiarities of the problem require novel mathematical models and algorithms to deal with the specific nature and size of this problem. The problem is modeled as a mixed-integer program, and a problem size analysis based on real data reveals that the formulation is too complex to solve directly. Hence, a two-stage approach is proposed, where the first stage assigns employees to stations, and the second stage specifies shifts and off-days for each employee. Computational results related to solving the two-stage models directly via CPLEX and by specialized heuristics are reported. The two-stage approach provides daily schedules for employees for a given time horizon in a timely fashion, taking into consideration the employees' expressed preferences. This proposed modeling approach can be incorporated within a decision support system to replace the current manual scheduling practice that is often chaotic and has led to feelings of bias and job dissatisfaction among employees.

关键词： employee scheduling mixed-integer programming partitioning two-stage approach manpower scheduling

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming FOR CYCLE DETECTION IN NONREVERSIBLE MARKOV PROCESSES

引用

MULTISCALE MODELING & SIMULATION 2018年第1期16卷 248-265页

作者： Witzig, Jakob Beckenbach, Isabel Eifler, Leon Fackeldey, Konstantin Gleixner, Ambros Grever, Andreas Weber, Marcus Zuse Inst Berlin Dept Optimizat D-14195 Berlin Germany Zuse Inst Berlin Dept Numer Math D-14195 Berlin Germany

In this paper, we present a new, optimization-based method to exhibit cyclic behavior in nonreversible stochastic processes. While our method is general, it is strongly motivated by discrete simulations of ordinary differential equations representing nonreversible biological processes, in particular, molecular simulations. Here, the discrete time steps of the simulation are often very small compared to the time scale of interest, i.e., of the whole process. In this setting, the detection of a global cyclic behavior of the process becomes difficult because transitions between individual states may appear almost reversible on the small time scale of the simulation. We address this difficulty using a mixed-integer programming model that allows us to compute a cycle of clusters with maximum net flow, i.e., large forward and small backward probability. For a synthetic genetic regulatory network consisting of a ring oscillator with three genes, we show that this approach can detect cycles that have a productivity one magnitude larger than classical spectral analysis methods. Our method applies to general nonequilibrium steady state systems such as catalytic reactions, for which the objective value computes the effectiveness of the catalyst.

关键词： mixed-integer programming nonreversible Markov processes NESS Markov state models

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming optimization-Based Method for Switch device Placement in Distribution Systems Considering Distributed Generation

Mixed-integer Programming optimization-Based Method for Swit...

引用

Australasian Universities Power Engineering Conference (AUPEC)

作者： Heidari, Alireza Agelidis, Vassilios G. Kia, Mohsen Setayeshnazar, Mehrdad Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Univ Shahid Behesti Coll Engn Abbaspour Tehran Iran

ISBN: (纸本)9781862959132

This paper presents a mathematical optimization methodology to placement of switches in power distribution systems. The primary objective is to minimize the total cost of reliability with consideration of achieving high-distribution reliability levels. mixed-integer linear programming (MILP) is adopted to determine (i) the number of sectionalizing switches and (ii) the locations of the switches. The introduction of DGs based on island operation mode is also considered is this paper. The effectiveness of the proposed methodology is examined on a reliability test system. The presented results indicate that the proposed methodology is provided a global optimum solution for the switch placement problem while the reliability, capital investment and annual operation and maintenance costs are considered.

关键词： Reliability Analysis Distribution System Distributed Generation mixed-integer programming optimization Switch Placement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：