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

A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints

APPLIED MATHEMATICAL MODELLING 2012年第8期36卷 3621-3629页

作者： Zhou, Zhen Che, Ada Yan, Pengyu NW Polytech Univ Sch Management Xian 710072 Peoples R China Univ Elect Sci & Technol China Sch Management & Econ Chengdu 610054 Peoples R China

This paper deals with the cyclic robotic flowshop scheduling problem with time window constraints, where parts are processed successively on multiple machines with upper and lower bounds on processing times and the transportation of parts among the machines is executed by a robot. in contrast with most previous studies, we consider the multi-cyclic scheduling problem in which two or more identical parts enter and leave the robotic flowshop during each cycle. We present the first mixed integer programming (MIP) model for the multi-cyclic robotic flowshop scheduling problem based on the description and analysis of the problem. We solve the model using commercial software CPLEX. Computational experiment on benchmark and randomly generated instances indicates that the proposed MIP approach can effectively solve real-life scheduling problems. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Multi-cyclic scheduling Robotic flowshop mixed integer programming Time window constraints

来源：评论

学校读者我要写书评

暂无评论

A mixed integer programming model and solution method for the operation of an integrated water supply system

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2022年第2期29卷 929-958页

作者： Santos, Maristela O. Soler, Edilaine M. Furlan, Marcos M. Viera, Jose C. M. Univ Sao Paulo Dept Appl Math & Stat Av Trabalhador Sao Carlense 400 BR-13560970 Sao Carlos SP Brazil Univ Estadual Paulista UNESP Dept Math Av Luiz Edmundo Carrijo Coube 14-01 BR-17033360 Bauru SP Brazil Fundacao Univ Fed Grande Dourados Dept Comp Sci Rodovia Dourados ItahumKm 12 BR-79804970 Dourados MS Brazil Univ Sao Paulo Dept Elect & Comp Engn Av Trabalhador Sao Carlense 400 BR-13560970 Sao Carlos SP Brazil

The problem addressed in this paper focuses on the reduction of electrical energy costs for the operation of hydraulic pumps, which are used for catchment and distribution of water in water supply systems. As the electricity tariffs are different according to the time of day, it is necessary to decide when and how many pumps must be used to collect and distribute water, in each period of time, and, when there must be water transfer among tanks so that the demand of each consumer center is met without a lack of resources. A mixed integer programming (MIP) model is proposed and a competitive MIP-based heuristic is developed to solve this problem. Numerical tests in a case study carried out with the water supply system of a Brazilian city demonstrate the efficiency of the proposed mathematical model and solution method.

关键词： water supply system hydraulic pumps mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年第3期285卷 884-901页

作者： Qin, Tianbao Du, Yuquan Chen, Jiang Hang Sha, Mei Shanghai Maritime Univ Coll Transport & Commun Shanghai 200135 Peoples R China Univ Tasmania Australian Maritime Coll Natl Ctr Ports & Shipping Launceston Tas 7250 Australia Xian Jiao Tong Liverpool Univ Int Business Sch Suzhou Suzhou 215123 Peoples R China

In the container terminals of seaports, the container handling system consists of a variety of container handling machines such as quay cranes, internal yard trucks, and yard cranes. This study applies a holistic approach to the integrated scheduling of these machines for the container handling operations of a single vessel. We formulate this special hybrid flow shop scheduling problem through both mixed integer programming (MIP) and constraint programming (CP) techniques. Then we develop an easily-implemented approach that combines the strengths of MIP and CP. First, the MIP model, which only considers quay crane scheduling, is solved by an MIP solver, and a quay crane allocation plan is retrieved from the MIP solution. Then, this quay crane allocation plan is fed to the CP model, warm-starting the branch-and-prune algorithm built in a CP optimizer. Our numerical experiments reveal that this hybrid MIP/CP approach can solve the large-sized instances with up to 10 00 containers, 6 quay cranes, 36 yard trucks, and 15 yard cranes to optimality with a gap of less than 3.31%, within a solution time of 2 minutes. If we increase the solution time to 5 minutes, this hybrid approach solves larger instances with up to 1400 containers to optimality with a gap of less than 1.41%. The state-of-the-art dedicated algorithms reported in the literature (which address an easier version of the same problem by ignoring non-crossing constraints and safety margins between quay cranes) are only able to find solutions for real-life instances with up to 500 containers within the solution time of 2930 or 5221 seconds, leaving a 4% or an unknown optimality gap. Thus, this study improves the solution of this integrated scheduling problem in terms of the instance size, solution efficiency, and solution optimality. (C) 2020 Elsevier B.V. All rights reserved.

关键词： OR in maritime industry Container terminal Container unloading/loading problem mixed integer programming Constraint programming

来源：评论

学校读者我要写书评

暂无评论

A new mixed integer programming formulation for facility layout design using flexible bays

引用

OPERATIONS RESEARCH LETTERS 2006年第6期34卷 660-672页

作者： Konak, Abdullah Kulturel-Konak, Sadan Norman, Bryan A. Smith, Alice E. Penn State Berks Reading PA 19610 USA Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15261 USA Auburn Univ Auburn AL 36849 USA

This paper presents a mixed-integer programming formulation to find optimal solutions for the block layout problem with unequal departmental areas arranged in flexible bays. The nonlinear department area constraints are modeled in a continuous plane without using any surrogate constraints. The formulation is extensively tested on problems from the literature. (c) 2005 Elsevier B.V. All rights reserved.

关键词： facility design facility layout mixed integer programming flexible bay unequal areas

来源：评论

学校读者我要写书评

暂无评论

Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice

引用

JOURNAL OF GLOBAL OPTIMIZATION 2021年第1期81卷 85-108页

作者： Shen, Ruobing Tang, Bo Liberti, Leo D'Ambrosio, Claudia Canu, Stephane Heidelberg Univ Inst Comp Sci D-69120 Heidelberg Germany Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 2E8 Canada Inst Polytech Paris Ecole Polytech LIX CNRS F-91128 Palaiseau France Normandie Univ INSA Rouen F-76801 St Etienne Du Rouvray France

Piecewise affine functions are widely used to approximate nonlinear and discontinuous functions. However, most, if not all existing models, only deal with fitting a continuous function. In this paper, we investigate the problem of fitting a discontinuous piecewise affine function to a given function defined on an arbitrary subset of an integer lattice, where no restriction on the partition of the domain is enforced (i.e., its geometric shape can be nonconvex). This is useful for segmentation and denoising when the given function corresponds to a mapping from pixels of a bitmap image to their color depth values. We propose a novel mixed integer Program (MIP) formulation for the piecewise affine fitting problem, where binary edge variables determine the boundary between two partitions of the function domain. To obtain a consistent partitioning (e.g., image segmentation), we include multicut constraints in the formulation. The resulting problem is NP-hard, and two techniques are introduced to improve the computation. One is to adopt a cutting plane method to add the exponentially many multicut inequalities on-the-fly. The other is to provide initial feasible solutions using a tailored heuristic algorithm. We show that the MIP formulation on grid graphs is approximate, while on king's graph, it is exact under certain circumstances. We conduct initial experiments on synthetic images as well as real depth images, and discuss the advantages and drawbacks of the two models.

关键词： Piecewise affine fitting mixed integer programming Cutting plane Image processing

来源：评论

学校读者我要写书评

暂无评论

A mixed integer programming approach to the patient admission scheduling problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019年第3期273卷 831-840页

作者： Bastos, Leonardo S. L. Marchesi, Janaina F. Hamacher, Silvio Fleck, Julia L. Pontificia Univ Catolica Rio de Janeiro Dept Ind Engn Rua Marques de Sao Vicente 225 BR-22451900 Rio De Janeiro RI Brazil

Among the many challenges involved in efficient healthcare resource planning, the Patient Admission Scheduling Problem is of particular significance, impacting organizational decisions at all planning levels. The problem of scheduling patient admissions involves assigning patients to beds over a given time horizon so as to maximize treatment efficiency, patient comfort and hospital utilization, while satisfying all necessary medical constraints and taking into consideration patient preferences as much as possible. A number of different variants of the Patient Admission Scheduling Problem exist at the strategic, tactical, and operational levels. In this paper, we consider a static offline operational level variant for which we propose a comprehensive mixed integer programming formulation and advance an exact solution method. We generate new best found solutions for 9 out of 13 benchmark instances from a publicly available repository. Additionally, we prove the optimality of two best known solutions reported in the literature. (C) 2018 Elsevier B.V. All rights reserved.

关键词： OR in health services Patient admission scheduling mixed integer programming Bed allocation Healthcare

来源：评论

学校读者我要写书评

暂无评论

A computational status update for exact rational mixed integer programming

引用

MATHEMATICAL programming 2023年第2期197卷 793-812页

作者： Eifler, Leon Gleixner, Ambros Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany HTW Berlin Treskowallee 8 D-10313 Berlin Germany

The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over the rational numbers was a hybrid-precision branch-and-bound algorithm published by Cook, Koch, Steffy, and Wolter in 2013. We describe a substantial revision and extension of this framework that integrates symbolic presolving, features an exact repair step for solutions from primal heuristics, employs a faster rational LP solver based on LP iterative refinement, and is able to produce independently verifiable certificates of optimality. We study the significantly improved performance and give insights into the computational behavior of the new algorithmic components. On the MIPLIB 2017 benchmark set, we observe an average speedup of 10.7x over the original framework and 2.9 times as many instances solved within a time limit of two hours.

关键词： mixed integer programming Exact computation Rational arithmetic Symbolic computations Certificate of correctness

来源：评论

学校读者我要写书评

暂无评论

Waste rock dumping optimisation using mixed integer programming (MIP)

引用

INTERNATIONAL JOURNAL OF MINING RECLAMATION AND ENVIRONMENT 2013年第6期27卷 425-436页

作者： Li, Yu Topal, Erkan Williams, David Univ Queensland Geotech Engn Ctr Brisbane Qld Australia

Despite the fact that waste rock hauling and dumping comprises a large proportion of the cost of materials handling in an open pit mine, little detailed planning is devoted to optimising waste rock dumping. The lack of such planning could result in long-term exposure of potential acid forming (PAF) waste rock, causing acid mine drainage (AMD), which would incur ongoing collection and treatment costs. A waste rock dumping plan that not only minimises hauling costs, but also involves the encapsulation of PAF waste rock to minimise AMD, would benefit a mining operation economically and environmentally. In order to create such a plan, two new mixed integer programming (MIP) models are formulated and tested with a five-year mining schedule. Optimised dumping plans are automatically generated, which detail the dumping location for each mining block. A manual approach is also attempted, and comparison shows that the MIP models have obvious advantages in error prevention, faster solution time and cost saving, by up to 9.5%.

关键词： mine waste rock dumping optimisation mixed integer programming acid mine drainage prevention

来源：评论

学校读者我要写书评

暂无评论

A mixed integer programming model to evaluate integrating strategies in the forest value chain - a case study in the Chilean forest industry

引用

CANADIAN JOURNAL OF FOREST RESEARCH 2015年第7期45卷 937-949页

作者： Troncoso, Juan D'Amours, Sophie Flisberg, Patrik Roennqvist, Mikael Weintraub, Andres Univ Talca Fac Ingn Dept Ingn Ind Talca Chile Univ Laval Dept Mech Engn CIRRELT FORAC Res Consortium Quebec City PQ Canada Forestry Res Inst Sweden Uppsala Sweden Univ Chile Dept Ind Engn Santiago Chile

When a company is integrated vertically, it can manage and plan its overall value chain in one direct and integrated approach. However in many cases, companies follow a decoupled approach where forests and production plants optimize separately their processes in a supply-driven strategy. In Chile, the two largest forest companies are vertically integrated (i.e., they own forest and mills that produce logs, lumber, plywood, pulp, paper, and bioenergy, etc.). Historically, they have coordinated their value chains using a make-to-stock strategy, for which the forest is the main driver of the value chain activities. In this paper, we propose an integrated planning approach to show the impacts of a demand-driven integration of the value chain in the forest industry. To compare this strategy with the decoupled strategy, we propose a mixed integer programming (MIP) model for the integrated strategy. To illustrate our proposal, we use forest and production information from a Chilean forest company. The decoupled strategy, where the forest and industry planning are planned separately, uses two models. The first model deals with the forest management and harvesting decisions and maximizes the expected net present value (NPV) of logs. In this model, the planning horizon covers one full forest rotation, which in Chile corresponds to about 25 years. The second model maximizes the NPV of the downstream operations for a shorter business planning horizon (five years) constrained by the availability of the logs from the first model. In the integrated approach, all parts of the value chain (forest, transportation, and mills) are driven by final product demandand where the objective is to maximize the profit of the company (NPV of the entire value chain). The demand is only given for the shorter business planning horizon. The two strategies are evaluated using the MIP model, and NPV is used to determine the best practice. According to the results, the NPV can increase up to 5.0% when

关键词： value chain management forest industry push and pull strategies long term forest planning mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Clustering routing based on mixed integer programming for heterogeneous wireless sensor networks

引用

AD HOC NETWORKS 2018年第Apr.期72卷 81-90页

作者： Li, Chunlin Bai, Jingpan Gu, Jinguang Yan, Xin Luo, Youlong Wuhan Univ Technol Dept Comp Sci Wuhan 430063 Hubei Peoples R China Wuhan Univ Sci & Technol Hubei Prov Key Lab Intelligent Informat Proc & Re Wuhan Hubei Peoples R China

Heterogeneous wireless sensor network has the advantages of completing complex communication tasks and is widely applied to military, medical, environmental, industrial and commercial, family life and so on. But heterogeneous nodes are expensive, it is necessary to consider how to balance the energy consumption and prolong network lifetime by deploying minimum number of heterogeneous nodes. In this paper, a clustering routing algorithm for heterogeneous wireless sensor network (CHRA) is presented to balance energy and prolong the network lifetime. The proposed routing algorithm computes the optimal number of heterogeneous nodes and selects the cluster heads per round. In CHRA, all common nodes are divided into two kinds. The first kind includes the nodes which transmit data to Sink by heterogeneous node and the others belong to the second kind. Furthermore, the common nodes are clustered per round by LEACH-C. The performance analysis and numerical results show that the proposed routing algorithm can availably prolong network lifetime and stable period. And it also can balance the energy consumption significantly. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Wireless sensor network Heterogeneous nodes mixed integer programming Cluster heads

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：