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

Ad hoc heuristic for the cover printing problem

DISCRETE OPTIMIZATION 2012年第1期9卷 17-28页

作者： Romero, David Alonso-Pecina, Federico Univ Nacl Autonoma Mexico Inst Matemat Cuernavaca 62210 Morelos Mexico

We address an NP-hard combinatorial optimization problem arising in a printing shop. An impression grid is composed by a set of plates. The cover printing problem consists in designing the composition of impression grids, and determining the number of times each grid is to be printed in order to fulfill the demand of different book covers at minimum total printing cost;the latter comes from three fixed costs: for printing one sheet, for producing one plate, and for composing one impression grid. For each cover an unlimited number of plates can be made. To deal with this challenging problem we present an ad hoc heuristic that outperforms all previously proposed approaches, including genetic algorithms, GRASP, and simulated annealing. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Combinatorial optimization integer nonlinear programming Cover printing Label printing Heuristic Job splitting

来源：评论

学校读者我要写书评

暂无评论

A maritime scheduling transportation-inventory problem with normally distributed demands and fully loaded/unloaded vessels

引用

APPLIED MATHEMATICAL MODELLING 2018年 53卷 540-566页

作者： Soroush, H. M. Al-Yakoob, S. M. Kuwait Univ Dept Stat & Operat Res POB 5969 Safat 13060 Kuwait Kuwait Univ Dept Math POB 5969 Safat 13060 Kuwait

Uncertainties in oil demands have significant effects on the routing and scheduling of oil tankers and inevitably influence the pertinent fleet operational expenses, shortage and excess inventory penalties, and chartering costs. In this paper, we study a stochastic maritime scheduling transportation-inventory problem to transport crude oil from a source using a set of fully loaded heterogeneous vessels to be fully unloaded at a destination over a finite time horizon. Daily demands at the destination are normally distributed random variables and different penalties are imposed on the shortages/excesses in daily storage levels at the destination. The expected total cost of such a fleet operation, consists of the total vessels' operational expenses, expected total penalties resulting from violating specified lower and upper bounds at the destination storage facility, and chartering expenses. We aim to simultaneously optimize the fleet schedules and maintain desirable daily storage levels to meet the stochastic demand requirements at the destination with acceptable reliability levels. We formulate the problem as a stochastic optimization model and then use chance constrained programming to convert it to an exact mixed integer nonlinear program with a convex objective function and linear constraints. Solutions obtained via the proposed stochastic model and its deterministic counterpart are compared and analyzed to gain insights into the impact of the variations in demands and the probabilities of meeting demands on the overall operation and cost structure. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Stochastic vessel scheduling Transportation Inventory/shortages Chance constraints integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Balancing producer and consumer risks in optimal attribute testing: A unified Bayesian/Frequentist design

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年第2期286卷 576-587页

作者： Fernandez, Arturo J. Correa-Alvarez, Cristian D. Pericchi, Luis R. Univ La Laguna Dept Matemat Estadist & Invest Operat Tenerife 38071 Canary Islands Spain Inst Tecnol Metropolitano ITM Dept Calidad & Prod Medellin Antioquia Colombia Univ Puerto Rico Rio Piedras Dept Math San Juan PR 00931 USA Univ Puerto Rico Rio Piedras Ctr Biostat & Bioinformat San Juan PR 00931 USA

Unified Bayesian/frequentist approaches for the design of attributes sampling plans are introduced by minimizing and limiting a weighted-average of the classical or expected producer and consumer risks adopted by the decision maker. This change of paradigm in the construction of test plans for lot acceptance provides optimal inspection schemes from both frequentist and Bayesian perspectives. Classes of admissible test plans minimizing the weighted-average risks are first defined. Constrained optimization problems are then solved in order to determine sample sizes with smallest classical or expected weighted-average risks, as well as acceptance test plans with minimal inspection effort and controlled risks. The proposed methodology to determine optimal sample sizes and decision criteria for lot sentencing constitutes a plausible consensus between Frequentists and Bayesians. Moreover, the use of prior information on the fraction defective allows the practitioners to appreciably reduce the required sample size for lot screening. Optimal lot inspection schemes can also be easily updated using past performance of the sampling plans. Besides the advantages the suggested approach has for hypothesis testing, namely large sample consistency and reproducible results, it permits to make a trade-off between the opposite goals of customers and manufacturers. Some applications in reliability demonstration testing and industrial quality control are presented for illustrative purposes. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Quality control Constrained optimization Lot sampling inspection integer nonlinear programming Reliability demonstration testing

来源：评论

学校读者我要写书评

暂无评论

Considering greenhouse gas emissions in maintenance optimisation

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年第3期307卷 1135-1145页

作者： Wu, Shaomin Wu, Di Peng, Rui Univ Kent Kent Business Sch Canterbury CT2 7PE KY England Xi An Jiao Tong Univ Sch Management Xian Peoples R China Beijing Univ Technol Sch Econ & Management Beijing 100124 Peoples R China

Greenhouse gases (GHG) from human activities are the main contributor to climate change since the mid-20th century. Reducing the release of GHG emissions is becoming a thematic research topic in many research disciplines. In the reliability research community, there are research papers relating to reliability and maintenance for systems in power generation farms such as offshore farms. Nevertheless, there is sparse research that aims to optimise maintenance policies for reducing the GHG emissions from sys-tems such as automotive vehicles or building service systems. To fill up this gap, this paper optimises replacement policies for systems that age and degrade and that produce GHG emissions (i.e., exhaust emissions) including the initial manufacturing GHG emissions produced during the manufacturing stage and the emissions generated during the operational stage. Both the exhaust emissions process and the failure process are considered as functions of two time scales (i.e., age and accumulated usage), respec-tively. Other factors that may affect the two processes such as ambient temperature and road conditions are depicted as random effects. Under these settings, the decision problem is a nonlinear programming problem subject to several constraints. Replacement policies are then developed. Numerical examples are provided to illustrate the proposed methods. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )

关键词： Maintenance policy Greenhouse gas emissions Condition-based monitoring Two time scales integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A DSS to manage platelet production supply chain for regional blood centers

引用

DECISION SUPPORT SYSTEMS 2010年第1期50卷 32-42页

作者： Ghandforoush, Parviz Sen, Tarun K. Virginia Polytech Inst & State Univ Falls Church VA 22043 USA Virginia Tech RB Pamplin Coll Business Falls Church VA 22043 USA

This paper presents a prototype decision support system for platelet production and blood mobile scheduling for a regional blood center. Unlike whole blood cells, platelets have a very short shelf life, which requires matching demand and supply closely. This is achieved by an efficient supply chain DSS that is optimized for delivery of platelets from production centers to transfusion centers, typically hospitals. One of the critical elements of the DSS is an embedded non-convex integer optimization model that assists the regional blood center manager to schedule the shuttle transportation of whole blood from collection sites to the regional processing center. The proposed non-convex integer model is transformed to a linear 0-1 problem using a two-step conversion process. The transformed model is successfully solved and the optimal solution is reached for the test data. An application of the integrated DSS using data from a regional blood center is described. The results suggest that the proposed DSS better meets the daily demand by producing a superior production plan and mobile assignment schedule. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Platelet supply management DSS integer nonlinear programming Blood bank DSS

来源：评论

学校读者我要写书评

暂无评论

A class of valid inequalities for multilinear 0-1 optimization problems

引用

DISCRETE OPTIMIZATION 2017年 25卷 28-47页

作者： Crama, Yves Rodriguez-Heck, Elisabeth Univ Liege HEC Management Sch QuantOM Liege Belgium

This paper investigates the polytope associated with the classical standard linearization technique for the unconstrained optimization of multilinear polynomials in 0-1 variables. A new class of valid inequalities, called 2-links, is introduced to strengthen the LP relaxation of the standard linearization. The addition of the 2-links to the standard linearization inequalities provides a complete description of the convex hull of integer solutions for the case of functions consisting of at most two nonlinear monomials. For the general case, various computational experiments show that the 2-links improve both the standard linearization bound and the computational performance of exact branch & cut methods. The improvements are especially significant for a class of instances inspired from the image restoration problem in computer vision. The magnitude of this effect is rather surprising in that the 2-links are in relatively small number (quadratic in the number of terms of the objective function). (C) 2017 Elsevier B.V. All rights reserved.

关键词： Multilinear binary optimization Pseudo-Boolean optimization integer nonlinear programming Standard linearization

来源：评论

学校读者我要写书评

暂无评论

Optimal truncated repetitive lot inspection with defect rates

引用

APPLIED MATHEMATICAL MODELLING 2019年 75卷 223-235页

作者： Perez-Gonzalez, Carlos J. Fernandez, Arturo J. Kohansal, Akram Asgharzadeh, Akbar Univ La Laguna Dept Matemat Estadist & Invest Operat San Cristobal la Laguna 38271 Spain Imam Khomeini Int Univ Dept Stat Qazvin Iran Univ Mazandaran Fac Math Sci Dept Stat Babol Sar Iran

Single and repetitive sampling schemes are conventional methods for evaluating the quality of lots or batches of products. Truncation repetitive sampling plans are introduced in this paper in order to significantly reduce the size of samples drawn from the lot. Under this scheme type, if a decision about the acceptance or rejection of the lots cannot be made in the original inspection, they can be reinspected, at most, a prefixed number of times. The Poisson distribution is assumed for the number of defects found in the samples drawn from the lot. Best truncated repetitive sampling plans are determined by solving integer nonlinear programming problems. A simplified methodology is suggested to obtain the plans with optimal inspection effort and controlled risks by using an iterative procedure. According to the results obtained, optimal truncated plans are shown to be better than the optimal single and repetitive schemes in reducing the average sample number of the inspection. An application to the manufacturing of glass is presented for illustrative purposes. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Quality control Producer and consumer risks Average sample number Poisson distribution integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT REDUCTION OF POLYNOMIAL ZERO-ONE OPTIMIZATION TO THE QUADRATIC CASE

引用

SIAM JOURNAL ON OPTIMIZATION 2008年第4期18卷 1398-1413页

作者： Buchheim, Christoph Rinaldi, Giovanni Univ Cologne Inst Informat D-50969 Cologne Germany CNR Ist Anal Sistemi Informat Antonio Ruberti I-00185 Rome Italy

We address the problem of optimizing a polynomial with real coefficients over binary variables. We show that a complete polyhedral description of the linearization of such a problem can be derived in a simple way from the polyhedral description of the linearization of some quadratic optimization problem. The number of variables in the latter linearization is only slightly larger than in the former. If polynomial constraints are present in the original problem, then their linearized counterparts carry over to the linearized quadratic problem unchanged. If the original problem formulation does not contain any constraints, we obtain a reduction to unconstrained quadratic zero-one optimization, which is equivalent to the well-studied max-cut problem. The separation problem for general unconstrained polynomial zero-one optimization thus reduces to the separation problem for the cut polytope. This allows us to transfer the entire knowledge gained for the latter polytope by intensive research and, in particular, the sophisticated separation techniques that have been developed. We report preliminary experimental results obtained with a straightforward implementation of this approach.

关键词： polynomial zero-one optimization integer nonlinear programming pseudo-boolean functions max-cut problem multilinear function optimization

来源：评论

学校读者我要写书评

暂无评论

Economic lot sampling inspection from defect counts with minimum conditional value-at-risk

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年第2期258卷 573-580页

作者： Fernandez, Arturo J. Univ La Laguna Dept Matemat Estadist & Invest Operat Tenerife 38071 Spain

Expected cost functions are often minimized to determine optimal inspection schemes for lot acceptance purposes. However, minimum mean cost sampling plans usually have high probabilities of suffering great losses. A risk management perspective based on minimizing the conditional value-at-risk (CVaR) is proposed in order to avoid unacceptably large costs. In essence, the CVaR associated with an inspection scheme is the expected cost of a given proportion of the most costly cases. Optimal defects-per-unit acceptance sampling plans with controlled producer and consumer risks for screening lots of incoming materials and outgoing products are determined by minimizing the CVaR for a given risk aversion degree. The decision criterion is based on the uniformly most powerful test. The Poisson distribution is used to model the number of nonconformities per sampled unit and the natural prior uncertainty on the defect rate A is described by a truncated gamma distribution. A computational algorithm is suggested to solve the underlying integer nonlinear programming problem. Practitioners can assume a restricted range for the defect rate and prior knowledge on A may be updated using past performance of the inspection plan. The developed methodology is applied to the manufacturing of paper for illustrative purposes. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Quality control Acceptance sampling Constrained optimization integer nonlinear programming Poisson defect rate

来源：评论

学校读者我要写书评

暂无评论

INLP-BPN approach for recommending hotels to a mobile traveler

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2018年第2期9卷 329-336页

作者： Chen, Toly Lin, Chi-Wei Feng Chia Univ Dept Ind Engn & Syst Management 100 Wenhwa Rd Taichung Taiwan

Existing systems for recommending hotels to mobile travelers are subject to several problems. For example, a traveler might choose a dominated hotel that is inferior to another hotel in all aspects. This problem cannot be solved by simply changing the weights assigned to the attributes of a hotel. In addition, a nonlinear recommendation mechanism, instead of a linear one, may be more effective for tailoring the recommendation result to a traveler's choice. To address these concerns, this study applied two treatments. First, an artificial attribute is added to each hotel to model a traveler's unknown preference for that hotel. The value of a traveler's unknown preference is determined by solving an integer nonlinear programming problem. Subsequently, a backward propagation network is constructed to map the recommendation results to travelers' choices, to improve the successful recommendation rate. The effectiveness of the proposed methodology was evaluated in a field study conducted in a small region of Seatwen District, Taichung City, Taiwan, and the experimental results supported its superiority over several existing methods in improving the successful recommendation rate.

关键词： Hotel Mobile Recommendation integer nonlinear programming Backward propagation network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：