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

Environmentally Friendly Supply Chain Planning and Design for Biodiesel Production via Wastewater Sludge

TRANSPORTATION SCIENCE 2014年第4期48卷 555-574页

作者： Marufuzzaman, Mohammad Eksioglu, Sandra Duni Hernandez, Rafael Mississippi State Univ Dept Ind & Syst Engn Mississippi State MS 39762 USA Univ Louisiana Dept Chem Engn Lafayette LA 70504 USA

This study presents mathematical models that capture the impact of different carbon-emission-related policies on the design of the biodiesel supply chain. These mathematical models identify locations and production capacities for biocrude production plants by exploring the trade-offs that exist between transportation costs, facility investments costs, and emissions. The mathematical models capture the dynamics of biomass supply and transportation costs during a predefined time horizon. We analyze the behavior of the chain under different regulatory policies such as carbon cap, carbon tax, carbon cap and trade, and carbon offset mechanisms. A number of observations are made about the impact of each policy on the supply chain performance. The models we developed are solved by using a commercial software GAMS/CPLEX. We use the state of Mississippi as the testing grounds for these models, and employ ArcGIS to visualize and validate the results from the optimization models.

关键词： supply chain design mixed-integer programming biodiesel biocrude carbon emissions carbon footprint

来源：评论

学校读者我要写书评

暂无评论

A mathematical programming model for optimal layout considering quantitative risk analysis

引用

COMPUTERS & CHEMICAL ENGINEERING 2014年 68卷 165-181页

作者： Medina-Herrera, Nancy Jimenez-Gutierrez, Arturo Grossmann, Ignacio E. Inst Tecnol Celaya Dept Ingn Quim Celaya 38010 Gto Mexico Carnegie Mellon Univ Dept Chem Engn Pittsburgh PA 15213 USA

Safety and performance are important factors in the design and operation of chemical plants. This paper describes the formulation of a mixed integer nonlinear programming model for the optimization of plant layout with safety considerations. The model considers a quantitative risk analysis to take safety into account, and a bowtie analysis is used to identify possible catastrophic outcomes. These effects are quantified through consequence analyses and probit models. The model allows the location of facilities at any available point, an advantage over grid-based models. Two case studies are solved to show the applicability of the proposed approach. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Optimization mixed-integer programming Safety Quantitative risk analysis Plant layout

来源：评论

学校读者我要写书评

暂无评论

A periodic re-planning approach for demand-driven wood remanufacturing industry: a real-scale application

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第14期52卷 4198-4215页

作者： Rafiei, Rezvan Nourelfath, Mustapha Gaudreault, Jonathan Santa-Eulalia, Luis Antonio Bouchard, Mathieu Univ Laval Dept Mech Engn Quebec City PQ Canada VCO Value Chain Optimizat Network Quebec City PQ Canada Interuniv Res Ctr Enterprise Networks Logist & Tr Quebec City PQ Canada FORAC Res Consortium Quebec City PQ Canada Univ Laval Dept Comp Sci & Software Engn Quebec City PQ Canada Univ Sherbrooke Fac Adm Dept Syst Informat & Methodes Quantitat Gest Sherbrooke PQ J1K 2R1 Canada

This article develops an experimental platform to select production planning policy in demand-driven wood remanufacturing industry. This industry is characterised by divergent co-production, alternative processes, a make-to-order philosophy and short order cycle times. Under such complex characteristics, the selection of an efficient production plan is a complex task. Previous work has failed to address all the industrial characteristics encountered in wood remanufacturing mills. After defining key performance indicators (KPIs) to measure the production plan efficiency, our methodology uses a periodic re-planning strategy based on a rolling horizon. Then, mixed-integer programming models are formulated leading to different planning approaches. Finally, the resulting decision framework is experimented to prescribe the best planning policy based on the selected KPI. Each production planning is characterised by its planning approach and factors related to the re-planning interval and the planning horizon length. Simulations are conducted using multiple best subset selections combined with an experimental design approach. Using industrial data from a wood remanufacturing mill in Eastern Canada, results indicate that the manufacturing mill should use a planning approach that minimises cost, while utilising the full system capacity. Results also quantify the benefit of using lower re-planning intervals and higher planning horizons.

关键词： re-planning uncertain demand co-production wood remanufacturing industry mixed-integer programming simulation

来源：评论

学校读者我要写书评

暂无评论

Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第14期52卷 4351-4363页

作者： Rahim, Mohd Kamarul Irwan Abdul Zhong, Yiqing Aghezzaf, El-Houssaine Aouam, Tarik Univ Ghent Dept Ind Management Fac Engn & Architecture B-9000 Ghent Belgium Huaneng Clean Energy Res Inst Beijing Peoples R China Univ Ghent Fac Econ & Business Adm B-9000 Ghent Belgium

The inventory-routing problem (IRP) is a typical logistics optimisation problem that supply chains, implementing vendor managed inventory (VMI), are confronted with. It combines inventory control and vehicle routing. The main objective of the IRP is to jointly determine optimal quantities of the product to be delivered to the retailers, delivery periods and optimal vehicle routes for the shipment of these quantities. This paper considers a multiperiod inventory-routing problem with stochastic stationary demand rates (MP-SIRP). The problem is first formulated as a linear mixed-integer stochastic program for which we propose a deterministic equivalent approximation model (MP-DAIRP(alpha)). This latter model can be decomposed into two well-know subproblems: an inventory allocation subproblem and a vehicle routing subproblem. The stochastic aspect of the demand is accounted for in the inventory allocation subproblem. The vehicle routing subproblem is solved as a deterministic mixed-integer problem. Lagrangian relaxation is used to determine close to optimal feasible solutions for the MP-DAIRP(alpha). Results of the proposed Lagrangian relaxation approach on some numerical examples are reported and thoroughly discussed.

关键词： multiperiod inventory routing stochastic demand rate mixed-integer programming Lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

On max-min fair flow optimization in wireless mesh networks

引用

AD HOC NETWORKS 2014年第PART A期13卷 134-152页

作者： Pioro, Michal Zotkiewicz, Mateusz Staehle, Barbara Staehle, Dirk Yuan, Di Lund Univ Elect & Informat Technol Dept S-22100 Lund Sweden Warsaw Univ Technol Inst Telecommun PL-00665 Warsaw Poland Univ Wurzburg Chair Commun Networks D-97076 Wurzburg Germany Linkoping Univ Dept Sci & Technol S-60174 Norrkoping Sweden

The paper is devoted to modeling wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots. Such MIP models are formulated for several cases of the modulation and coding schemes (MCS) assignment. We present a general way of solving the max-min fairness (MMF) traffic objective for WMN using the formulated capacity models. Thus the paper combines WMN radio link modeling with a non-standard way of dealing with uncertain traffic, a combination that has not, to our knowledge, been treated so far by exact optimization models. We discuss several ways, including a method based on the so called compatible or independent sets, of solving the arising MIP problems. We also present an extensive numerical study that illustrates the running time efficiency of different solution approaches, and the influence of the MCS selection options and the number of time slots on traffic performance of a WMN. Exact joint optimization modeling of the WMN capacity and the MMF traffic objectives forms the main contribution of the paper. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Wireless mesh network Max-min fairness mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

Modeling lotsizing and scheduling problems with sequence dependent setups

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年第3期239卷 644-662页

作者： Guimaraes, Luis Klabjan, Diego Almada-Lobo, Bernardo Univ Porto Fac Engn INESC TEC P-4100 Oporto Portugal Northwestern Univ Dept Ind Engn & Management Sci Evanston IL 60208 USA

Several production environments require simultaneous planing of sizing and scheduling of sequences of production lots. Integration of sequencing decisions in lotsizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to real world problems. A two-dimensional classification framework is proposed to survey and classify the main modeling approaches to integrate sequencing decisions in discrete time lotsizing and scheduling models. The Asymmetric Traveling Salesman Problem can be an important source of ideas to develop more efficient models and methods to this problem. Following this research line, we also present a new formulation for the problem using commodity flow based subtour elimination constraints. Computational experiments are conducted to assess the performance of the various models, in terms of running times and upper bounds, when solving real-word size instances. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Production planning Lotsizing and scheduling mixed-integer programming Sequence-dependent setups Computational benchmark

来源：评论

学校读者我要写书评

暂无评论

Relaxations for two-level multi-item lot-sizing problems

引用

MATHEMATICAL programming 2014年第1-2期146卷 495-523页

作者： Van Vyve, Mathieu Wolsey, Laurence A. Yaman, Hande CORE B-1348 Louvain La Neuve Belgium Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkey

We consider several variants of the two-level lot-sizing problem with one item at the upper level facing dependent demand, and multiple items or clients at the lower level, facing independent demands. We first show that under a natural cost assumption, it is sufficient to optimize over a stock-dominant relaxation. We further study the polyhedral structure of a strong relaxation of this problem involving only initial inventory variables and setup variables. We consider several variants: uncapacitated at both levels with or without start-up costs, uncapacitated at the upper level and constant capacity at the lower level, constant capacity at both levels. We finally demonstrate how the strong formulations described improve our ability to solve instances with up to several dozens of periods and a few hundred products.

关键词： mixed-integer programming Lot-sizing Extended formulation Multi-level Multi-item

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Model for Minmax Regret in Combinatorial Optimization

引用

OPERATIONS RESEARCH 2014年第1期62卷 160-181页

作者： Natarajan, Karthik Shi, Dongjian Toh, Kim-Chuan Singapore Univ Technol & Design Singapore 138682 Singapore Natl Univ Singapore Dept Math Singapore 119076 Singapore

In this paper, we propose a new probabilistic model for minimizing the anticipated regret in combinatorial optimization problems with distributional uncertainty in the objective coefficients. The interval uncertainty representation of data is supplemented with information on the marginal distributions. As a decision criterion, we minimize the worst-case conditional value at risk of regret. The proposed model includes the interval data minmax regret model as a special case. For the class of combinatorial optimization problems with a compact convex hull representation, a polynomial sized mixed-integer linear program is formulated when (a) the range and mean are known, and (b) the range, mean, and mean absolute deviation are known;and a mixed-integer second order cone program is formulated when (c) the range, mean, and standard deviation are known. For the subset selection problem of choosing K elements of maximum total weight out of a set of N elements, the probabilistic regret model is shown to be solvable in polynomial time in the instances (a) and (b) above. This extends the current known polynomial complexity result for minmax regret subset selection with range information only.

关键词： minmax regret probability mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

Semi-continuous network flow problems

引用

MATHEMATICAL programming 2014年第1-2期145卷 565-599页

作者： Angulo, Gustavo Ahmed, Shabbir Dey, Santanu S. Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA

We consider semi-continuous network flow problems, that is, a class of network flow problems where some of the variables are restricted to be semi-continuous. We introduce the semi-continuous inflow set with variable upper bounds as a relaxation of general semi-continuous network flow problems. Two particular cases of this set are considered, for which we present complete descriptions of the convex hull in terms of linear inequalities and extended formulations. We consider a class of semi-continuous transportation problems where inflow systems arise as substructures, for which we investigate complexity questions. Finally, we study the computational efficacy of the developed polyhedral results in solving randomly generated instances of semi-continuous transportation problems.

关键词： mixed-integer programming Network flow problems Semi-continuous variables

来源：评论

学校读者我要写书评

暂无评论

A variable-reduction technique for the fixed-route vehicle-refueling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2014年第1期67卷 204-215页

作者： Suzuki, Yoshinori Iowa State Univ Coll Business Dept Supply Chain & Informat Syst Ames IA 50011 USA

The fixed-route vehicle-refueling problem (FRVRP) is a difficult combinatorial problem that is used extensively in the US truckload industry to manage fuel costs. This paper proposes a preprocessing technique for the FRVRP that cuts the problem size noticeably without eliminating the optimal solution(s), which allows users to enlarge the size of solvable instances or save the CPU time of solving the problem dramatically. Empirical testing with real-world instances shows that our method: (i) reduces the problem size by 54.8% and (ii) solves the FRVRPs to optimality in roughly 1/4 of the time it is currently taking. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Freight transportation Motor carriers Fuel cost mixed-integer programming Preprocessing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：