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

Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm

引用

OPTIMIZATION AND ENGINEERING 2012年第4期13卷 663-687页

作者： Ballestin, Francisco Mallor, Fermin Mateo, Pedro M. Univ Zaragoza Dpto Metodos Estadist E-50009 Zaragoza Spain Univ Publ Navarra Fac Engn Dpto Estadist & Invest Operat Pamplona Spain

This paper describes a real problem in a market-driven medium sized foundry delivering a wide range of castings to different markets. The problem consists of finding an efficient production plan to schedule the different processes (moulding, furnacing, cutting, tooling, etc.) needed to the manufacture of the pieces. Different objectives and resources and technical constraints must be taken into account. To solve this problem we have first developed a more classical integer linear programming approach based on a rolling horizon strategy. The most innovative contribution of the paper is that it models the problem as a project scheduling problem. Based on this model we present a metaheuristic algorithm that adapts techniques from the area. Computational experiments comparing both approaches are provided on instances created by a generator simulating real instances.

关键词： Production scheduling mixed integer programming Project scheduling Metaheuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2012年第9-12期59卷 1143-1155页

作者： Doulabi, Seyed Hossein Hashemi Avazbeigi, Milad Arab, Sahar Davoudpour, Hamid Amirkabir Univ Technol Dept Ind Engn Tehran Iran European Ctr Soft Comp Mieres Spain

This paper addresses open shop scheduling problem from the viewpoint of just-in-time management in which the objective function is to minimize the sum of weighted earliness/tardiness penalties. The problem is formulated as two different mixed integer linear programming models. To solve the problem, a novel hybrid two-phase algorithm is presented. In the first phase, a simulated annealing is applied to search the appropriate sequences of jobs on machines. Based on the job sequences obtained in the first phase, one of the proposed mathematical formulations can be reduced to a linear programming model and in the second phase by solving the linear programming model, the start time of jobs on machines can be determined. In order to evaluate the quality of solutions, a specific branching strategy is applied in solving the other mathematical model to obtain a lower bound. Computational results show that the algorithm obtains high-quality solutions in reasonable time.

关键词： Open shop scheduling Earliness/tardiness criterion mixed integer programming Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年第3期218卷 636-647页

作者： Pureza, Vitoria Morabito, Reinaldo Reimann, Marc Univ Fed Sao Carlos Dept Engn Prod BR-13565905 Sao Carlos SP Brazil Graz Univ Inst Prod & Operat Management A-8044 Graz Austria

In real life distribution of goods, relatively long service times may make it difficult to serve all requests during regular working hours. These difficulties are even greater if the beginning of the service in each demand site must occur within a time window and violations of routing time restrictions are particularly undesirable. We address this situation by considering a variant of the vehicle routing problem with time windows for which, besides routing and scheduling decisions, a number of extra deliverymen can be assigned to each route in order to reduce service times. This problem appears, for example, in the distribution of beverage and tobacco in highly dense Brazilian urban areas. We present a mathematical programming formulation for the problem, as well as a tabu search and an ant colony optimization heuristics for obtaining minimum cost routes. The performance of the model and the heuristic approaches are evaluated using instances generated from a set of classic examples from the literature. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Vehicle routing with multiple deliverymen Vehicle routing with time windows mixed integer programming Tabu search Ant colony optimization Beverage distribution

来源：评论

学校读者我要写书评

暂无评论

mixed n-step MIR inequalities: Facets for the n-mixing set

引用

DISCRETE OPTIMIZATION 2012年第4期9卷 216-235页

作者： Sanjeevi, Sujeevraja Kianfar, Kiavash Texas A&M Univ Dept Ind & Syst Engn College Stn TX 77843 USA

Gunluk and Pochet [O. Gunluk, Y. Pochet, Mixing mixed integer inequalities. Mathematical programming 90 (2001) 429-457] proposed a procedure to mix mixed integer rounding (MIR) inequalities. The mixed MIR inequalities define the convex hull of the mixing set {(y(1), . . . , y(m), v) is an element of Z(m) x R+ : alpha(1)y(i) + v >= beta(i), i = 1, . . . , m} and can also be used to generate valid inequalities for general as well as several special mixed integer programs (MIPs). In another direction, Kianfar and Fathi [K. Kianfar, Y. Fathi, Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Mathematical programming 120 (2009) 313-346] introduced the n-step MIR inequalities for the mixed integer knapsack set through a generalization of MIR. In this paper, we generalize the mixing procedure to the n-step MIR inequalities and introduce the mixed n-step MIR inequalities. We prove that these inequalities define facets for a generalization of the mixing set with n integer variables in each row (which we refer to as the n-mixing set), i.e. {(y(1), . . . , y(m), v) is an element of (Z x Z(+)(n-1))(m) x R+ : Sigma(n)(j=1) alpha(j)y(j)(i) + v >= beta(i), i = 1, . . . , m}. The mixed MIR inequalities are simply the special case of n = 1. We also show that mixed n-step MIR can generate valid inequalities based on multiple constraints for general MIPs. Moreover, we introduce generalizations of the capacitated lot-sizing and facility location problems, which we refer to as the multi-module problems, and show that mixed n-step MIR can be used to generate valid inequalities for these generalizations. Our computational results on small MIPLIB instances as well as a set of multi-module lot-sizing instances justify the effectiveness of the mixed n-step MIR inequalities. (c) 2012 Elsevier B.V. All rights reserved.

关键词： mixed n-step MIR Mixing mixed integer programming Cutting planes Multi-module capacitated lot-sizing Multi-module capacitated facility location

来源：评论

学校读者我要写书评

暂无评论

Stochastic optimization of the daily operation of wind farm and pumped-hydro-storage plant

引用

RENEWABLE ENERGY 2012年 48卷 571-578页

作者： Ding, Huajie Hu, Zechun Song, Yonghua Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

This paper proposes a new coordination operation mode of wind farm (WF) and pumped-hydro-storage plant (PHSP) based on day-ahead wind power output forecasts. Firstly, a deterministic mixed integer programming (MIP) formulation is built considering the constraints of unit total startup and shutdown frequencies, as well as unit state exclusion between pumping and generating. Secondly, the paper presents the chance-constrained and scenario-based optimization formulations to deal with errors of wind power forecast. These two formulations target on maximizing the expected profit of joint operation of WF and PHSP. Case studies and sensitivity analyses are conducted, which demonstrate that the coordination of WF and PHSP can greatly alleviate the negative effect of wind power fluctuations on power grid and also increase remarkable profit. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Wind farm Pumped-hydro-storage plant Coordination operation Startup/shutdown constraints mixed integer programming Stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal Locations for Methanol and CHP Production in Eastern Finland

引用

BIOENERGY RESEARCH 2012年第2期5卷 412-423页

作者： Natarajan, Karthikeyan Leduc, Sylvain Pelkonen, Paavo Tomppo, Erkki Dotzauer, Erik UEF Sch Forest Sci Joensuu 80101 Finland IIASA A-2361 Laxenburg Austria Finnish Forest Res Inst METLA Vantaa 01301 Finland Malardalen Univ S-72123 Vasteras Sweden

Finland considers energy production from woody biomass as an efficient energy planning strategy to increase the domestic renewable energy production in order to substitute fossil fuel consumption and reduce greenhouse gas emissions. Consequently, a number of developmental activities are implemented in the country, and one of them is the installation of second generation liquid biofuel demonstration plants. In this study, two gasification-based biomass conversion technologies, methanol and combined heat and power (CHP) production, are assessed for commercialization. Spatial information on forest resources, sawmill residues, existing biomass-based industries, energy demand regions, possible plant locations, and a transport network of Eastern Finland is fed into a geographically explicit mixed integer programming model to minimize the costs of the entire supply chain which includes the biomass supply, biomass and biofuel transportation, biomass conversion, energy distribution, and emissions. The model generates a solution by determining the optimal number, locations, and technology mix of bioenergy production plants. Scenarios were created with a focus on biomass and energy demand, plant characteristics, and cost variations. The model results state that the biomass supply and high energy demand are found to have a profound influence on the potential bioenergy production plant locations. The results show that methanol can be produced in Eastern Finland under current market conditions at an average cost of 0.22 a,not sign/l with heat sales (0.34 a,not sign/l without heat sales). The introduction of energy policy tools, like cost for carbon, showed a significant influence on the choice of technology and CO2 emission reductions. The results revealed that the methanol technology was preferred over the CHP technology at higher carbon dioxide cost (> 145 a,not sign/t(CO2)). The results indicate that two methanol plants (360 MWbiomass) are needed to be built to meet the transp

关键词： Bioenergy production Gasification mixed integer programming Spatial information Supply chain

来源：评论

学校读者我要写书评

暂无评论

Automatic aircraft cargo load planning

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2012年第9期63卷 1271-1283页

作者： Limbourg, S. Schyns, M. Laporte, G. Univ Liege HEC Management Sch B-4000 Liege Belgium HEC Montreal Montreal PQ Canada

The goal of this paper is the development of a new mixed integer linear program designed for optimally loading a set of containers and pallets into a compartmentalised cargo aircraft. It is based on real-world problems submitted by a professional partner. This model takes into account strict technical and safety constraints. In addition to the standard goal of optimally positioning the centre of gravity, we also propose a new approach based on the moment of inertia. This double goal implies an increase in aircraft efficiency and a decrease in fuel consumption. Cargo loading generally remains a manual, or at best a computer-assisted, and time-consuming task. A fully automatic software was developed to quickly compute optimal solutions. Experimental results show that our approach achieves better solutions than manual planning, within only a few seconds. Journal of the Operational Research Society (2012) 63, 1271-1283. doi:10.1057/jors.2011.134 Published online 14 December 2011

关键词： mixed integer programming cargo aircraft unit load devices weight and balance moment of inertia fuel economy

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis and Comparison on Energy Storage Devices for Smart Building Energy Management

引用

IEEE TRANSACTIONS ON SMART GRID 2012年第4期3卷 2136-2147页

作者： Xu, Zhanbo Guan, Xiaohong Jia, Qing-Shan Wu, Jiang Wang, Dai Chen, Siyun Xi An Jiao Tong Univ Moe Klinns Lab Xian 710049 Peoples R China Tsinghua Univ Ctr Intelligent & Networked Syst CFINS Dept Automat TNLIST Beijing 100084 Peoples R China Tsinghua Univ CFINS TNLIST Dept Automat Beijing 100084 Peoples R China

A smart building energy system usually contains multiple energy sources such as power grids, autonomous generators, renewable resources, storage devices, and schedulable loads. Storage devices such as batteries, ice/heat storage units, and water tanks play an important role in reducing energy cost in building energy systems since they can help sufficiently utilize renewable energy resources and time-of-use electricity prices. It is important to plan, schedule, and coordinate all the storage devices together with schedulable loads in a building facilitated by microgrid technology. To consider the above problem with uncertainties in solar radiation and demand profiles, a stochastic optimization problem is formulated and solved by the scenario tree method. The best combination and the optimal capacities of storage devices for specific building energy systems are then determined. Furthermore, the optimal operating strategy of building energy systems can be obtained. The performance analysis on the storage devices is conducted and the numerical results show that thermal storage devices (e. g., ice storage units, water tanks) are good for saving energy costs but batteries may not be economical due to their high investment cost and short lifetime. It is also observed that the aforementioned uncertainties have an impact on selecting which type and capacity of storage device should be used.

关键词： Building energy saving mixed integer programming optimal capacities and types storage devices

来源：评论

学校读者我要写书评

暂无评论

The opportunistic replacement problem: theoretical analyses and numerical tests

引用

MATHEMATICAL METHODS OF OPERATIONS RESEARCH 2012年第3期76卷 289-319页

作者： Almgren, Torgny Andreasson, Niclas Patriksson, Michael Stromberg, Ann-Brith Wojciechowski, Adam Onnheim, Magnus Chalmers Dept Math Sci S-41296 Gothenburg Sweden Volvo Aero Corp S-46181 Trollhattan Sweden Univ Gothenburg Dept Math Sci S-41296 Gothenburg Sweden

We consider a model for determining optimal opportunistic maintenance schedules w.r.t. a maximum replacement interval. This problem generalizes that of Dickman et al. (J Oper Res Soc India 28:165-175, 1991) and is a natural starting point for modelling replacement schedules of more complex systems. We show that this basic opportunistic replacement problem is NP-hard, that the convex hull of the set of feasible replacement schedules is full-dimensional, that all the inequalities of the model are facet-inducing, and present a new class of facets obtained through a -Chvatal-Gomory rounding. For costs monotone with time, a class of elimination constraints is introduced to reduce the computation time;it allows maintenance only when the replacement of at least one component is necessary. For costs decreasing with time, these constraints eliminate non-optimal solutions. When maintenance occasions are fixed, the remaining problem is stated as a linear program and solved by a greedy procedure. Results from a case study on aircraft engine maintenance illustrate the advantage of the optimization model over simpler policies. We include the new class of facets in a branch-and-cut framework and note a decrease in the number of branch-and-bound nodes and simplex iterations for most instance classes with time dependent costs. For instance classes with time independent costs and few components the elimination constraints are used favorably. For fixed maintenance occasions the greedy procedure reduces the computation time as compared with linear programming techniques for all instances tested.

关键词： Maintenance optimization mixed integer programming Complexity analysis Polyhedral analysis

来源：评论

学校读者我要写书评

暂无评论

Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2012年第6期23卷 2271-2280页

作者： Wang, I. -Lin Yang, Taho Chang, Yu-Bang Natl Cheng Kung Univ Dept Ind & Informat Management Tainan 701 Taiwan Natl Cheng Kung Univ Inst Mfg Informat & Syst Tainan 701 Taiwan

This paper investigates a difficult scheduling problem on a specialized two-stage hybrid flow shop with multiple processors that appears in semiconductor manufacturing industry, where the first and second stages process serial jobs and parallel batches, respectively. The objective is to seek job-machine, job-batch, and batch-machine assignments such that makespan is minimized, while considering parallel batch, release time, and machine eligibility constraints. We first propose a mixed integer programming (MIP) formulation for this problem, then gives a heuristic approach for solving larger problems. In order to handle real world large-scale scheduling problems, we propose an efficient dispatching rule called BFIFO that assigns jobs or batches to machines based on first-in-first-out principle, and then give several reoptimization techniques using MIP and local search heuristics involving interchange, translocation and transposition among assigned jobs. Computational experiments indicate our proposed re-optimization techniques are efficient. In particular, our approaches can produce good solutions for scheduling up to 160 jobs on 40 machines at both stages within 10 min.

关键词： Flow shop with multiple processors Scheduling Dispatching mixed integer programming Heuristic algorithm Makespan

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：