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

Refinery Production Scheduling Involving Operational Transitions of Mode Switching under Predictive Control System

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2014年第19期53卷 8155-8170页

作者： Shi, Lei Jiang, Yongheng Wang, Ling Huang, Dexian Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

In the refinery industry, especially in large-scale modern refineries, production scheduling modeling is an essential tool in the operation and management. By scheduling systems, better economic performance can be achieved. In order to implement the scheduling schemes, the influence of control systems has to be considered in scheduling models. This paper presents a novel refinery scheduling model where several controllable and realizable operation modes for production units are established based on unitwide predictive control. Furthermore, operational transitions resulting from switching operation modes of production units are taken into account to reflect the dynamic nature of production. A novel mixed integer linear programming (MILP) discrete-time model is developed, and computational tests show the efficiency of the proposed model.

关键词： PRODUCTION scheduling SWITCHING theory PREDICTIVE control mixed integer linear programming DISCRETE-time systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling Additional Train Unit Services on Rail Transit Lines

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-13页

作者： Jiang, Zhibin Tan, Yuyan Yalcinkaya, Ozgur Tongji Univ Minist Educ Key Lab Rd & Traff Engn Sch Transportat Engn Shanghai 201804 Peoples R China Tech Univ Carolo Wilhelmina Braunschweig Inst Railway Syst Engn & Traff Safety D-38106 Braunschweig Germany Dokuz Eylul Univ Dept Ind Engn TR-35160 Buca Izmir Turkey

This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel times of additional trains and minimizing shifts of initial trains. We illustrated our model using computational experiments drawn from the real rail transit line 16 in Shanghai and reached results which show that rail transit agencies can obtain a reasonable new timetable for different managerial goals in a matter of seconds, so the model is well suited to be used in daily operations.

关键词： mixed integer linear programming SCHEDULING RAILROAD rails PASSENGERS MATHEMATICAL optimization COMPUTATIONAL complexity

来源：评论

学校读者我要写书评

暂无评论

Multi-objectives, multi-period optimization of district energy systems: II-Daily thermal storage

引用

COMPUTERS & CHEMICAL ENGINEERING 2014年 71卷 648-662页

作者： Fazlollahi, Samira Becker, Gwenaelle Marechal, Francois Veolia Environm Rech & Innovat F-78520 Limay France Ecole Polytech Fed Lausanne Ind Energy Syst Lab CH-1015 Lausanne Switzerland

District heating is an efficient way of providing heat to urban areas. The use of storage tanks integrated with district heating network would permit to increase the annual utilization of base load equipment, avoiding over estimation of the size of backup equipment, and balancing the energy demand fluctuation during day and night. In the present work a multi-objective optimization model for sizing and operation optimization of district heating systems with heat storage tanks is presented. The model includes process design and energy integration techniques for optimizing the temperature intervals, the volume and the operation strategy of thermal storage tanks. The proposed model is demonstrated by means of two test cases. Results show that the efficiency, environmental impacts and total costs of an urban system can be improved after integrating the thermal storage by 4.7%, 5% and 2% respectively. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Daily thermal storage District energy systems mixed integer linear programming Evolutionary algorithm Multi-objective optimization CO2 mitigation

来源：评论

学校读者我要写书评

暂无评论

Cell loading and family scheduling for jobs with individual due dates to minimise maximum tardiness

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第19期52卷 5656-5674页

作者： Sueer, Guersel A. Ates, Ozan K. Mese, Emre M. Ohio Univ Russ Coll Engn & Technol Ind & Syst Engn Dept Athens OH 45701 USA

This paper focuses on cell loading and family scheduling in a cellular manufacturing environment. The performance measure is minimising the maximum tardiness of jobs. What separates this study from others is the presence of individual due dates for every job in a family and also allowing family splitting among cells. Three methods are examined in order to solve this problem, namely mathematical modelling, genetic algorithms (GA) and heuristics. The results showed that GA is capable of finding the optimal solution with varying frequency of 60-100% and it is efficient as compared to the mathematical modelling especially for larger problems in terms of execution times. The heuristics, on the other hand, were easy to implement but they could not find the optimal solution. The results of experimentation also showed that family splitting was observed in all multi-cell optimal solutions and therefore it can be concluded that family splitting is a good strategy for the problem considered in this paper.

关键词： cell scheduling group scheduling genetic algorithms mixed integer linear programming heuristics

来源：评论

学校读者我要写书评

暂无评论

Operational planning models for distribution networks

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第1期52卷 89-116页

作者： Manzini, Riccardo Accorsi, Riccardo Bortolini, Marco Alma Mater Studiorum Univ Bologna Dept Ind Engn Bologna Italy

The design and optimisation of a logistic network deals with a wide set of decisions, e.g. the determination of the best location and capacity of the different logistic facilities (production plants, distribution centres, transit points, wholesalers, etc.), the allocation of the product demand coming from customers in presence (or absence) of fractionable flows of material, the determination of the best transportation mode (truck, rail, etc.) as well as loading and routing of vehicles. These decisions involve multiple stages of a distribution network: customers-regional distribution centres (RDC), RDCs-central distribution centres (CDC) and CDCs-production plants and sources, in presence of multiple products and the variable time (i.e. time-dependent product demand and flows of material). This paper presents a top-down methodology that joins the strategic planning, the tactical planning and the operational planning of distribution networks with a special focus on the development of effective heuristic methods to face the vehicle routing problem. Original models and heuristic algorithms for the operational planning are illustrated. The impact of the strategic and tactical decisions on the performance of the operational planning is evaluated by the application of the proposed hierarchical approach to two realistic case studies. Obtained results are illustrated in a what-if experimental analysis conducted on multiple problem settings and realistic scenarios.

关键词： supply chain (SC) facility layout location allocation problem (LAP) vehicle routing transportation mixed integer linear programming decision support system (DSS)

来源：评论

学校读者我要写书评

暂无评论

On d-regular schematization of embedded paths

引用

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2014年第3期47卷 381-406页

作者： Delling, Daniel Gemsa, Andreas Noellenburg, Martin Pajor, Thomas Rutter, Ignaz Microsoft Res Silicon Valley Mountain View CA USA Karlsruhe Inst Technol D-76021 Karlsruhe Germany

Motivated by drawing route sketches, we consider the d-regular path schematization problem. For this problem we are given an embedded path P (e.g., a route in a road network) and a positive integer d. The goal is to find a d-schematized embedding of P in which the orthogonal order of all vertices in the input is preserved and in which every edge has a direction that is an integer multiple of (90/d)(o). We show that deciding whether a path can be d-schematized is NP-complete for any positive integer d. Despite the NP-hardness of the problem we still want to be able to generate route sketches and thus need to solve the d-regular path schematization problem. We explore two different algorithmic approaches, both of which consider two additional quality constraints: We require that every edge is drawn with a user-specified minimum length and we want to maximize the number of edges that are drawn with their preferred direction. The first algorithmic approach restricts the input paths to be axis-monotone. We show that there exists a polynomial-time algorithm that solves the d-regular path schematization problem for this restricted class of embedded paths. We extend this approach by a heuristic such that it can handle arbitrary simple paths. However, for the second step we cannot guarantee that the orthogonal order of the input embedding is maintained. The second approach is a formulation of the d-regular path schematization problem as a mixed integer linear program. Finally, we give an experimental evaluation which shows that both approaches generate reasonable route sketches for real-world data. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Path schematization NP-hardness mixed integer linear programming Dynamic programming Graph drawing

来源：评论

学校读者我要写书评

暂无评论

Modeling and scheduling no-wait open shop problems

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2014年 158卷 256-266页

作者： Naderi, B. Zandieh, M. Kharazmi Univ Fac Engn Dept Ind Engn Tehran Iran Shahid Beheshti Univ Accounting & Management Fac Dept Ind Management Tehran Iran

This paper studies the problem of scheduling open shops with no intermediate buffer, called no-wait open shops under makespan minimization. No-wait scheduling problems arise in many realistic production environments such as hot metal rolling, the plastic molding, chemical and pharmaceutical, food processing and several other industries. To tackle such problems, we first develop three different mathematical models, mixed integer linear programs, by which we can solve the problem to optimality. Besides the models, we propose novel metaheuristics based on genetic and variable neighborhood search algorithms to solve the large-sized problems in an acceptable computational time. The key point in any scheduling solver is the procedure of encoding and decoding schemes. In this paper, we propose a simple yet effective tailor-made procedure of encoding and decoding schemes for no-wait open shop problems. The operators of the proposed metaheuristics are designed so as to consider the specific encoding scheme of the problem. To evaluate the performance of models and metaheuristics, we conduct two computational experiments. The first includes small-sized instances by which we compare the mathematical models and assess general performance of the proposed metaheuristics. In the second experiment, we further evaluate the potential of metaheuristics on solving some benchmarks in the literature of pure open shops. The results show that the models and metaheuristics are effective to deal with the no-wait open shop problems. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Scheduling Open shop No-wait mixed integer linear programming Genetic algorithm Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

Solution Methodology for Scheduling Problems in Batch Plants

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2014年第49期53卷 19265-19281页

作者： Moniz, Samuel Barbosa-Povoa, Ana Paula de Sousa, Jorge Pinho Duarte, Pedro Univ Nova Lisboa Inst Super Tecn Ctr Estudos Gestao P-1049001 Lisbon Portugal INESC TEC P-4200465 Oporto Portugal Univ Porto Fac Engn P-4200465 Oporto Portugal Hovione FarmaCiencia SA P-2674506 Loures Portugal

This paper proposes a solution methodology for the production scheduling of batch plants. The methodology is defined by an integrated approach that simultaneously considers the representation of the scheduling problem, the optimization model, and the decision-making process. A problem representation and a mixed integer linear programing (MILP) model are developed and applied to solve a real world scheduling problem from the chemical-pharmaceutical industry. The main advantage of this approach is that it includes a general process representation that can be used across several departments of the company. Moreover, we also discuss development and implementation challenges of optimization methods for the process industry, and we provide some guidelines to mitigate existing problematic issues in this domain.

关键词： SOLUTION (Chemistry) PRODUCTION scheduling mixed integer linear programming PROBLEM solving MATHEMATICAL models

来源：评论

学校读者我要写书评

暂无评论

Improving the robustness in railway station areas

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年第1期235卷 276-286页

作者： Dewilde, Thijs Sels, Peter Cattrysse, Dirk Vansteenwegen, Pieter Univ Leuven KU Leuven Ctr Ind Management Traff & Infrastruct B-3001 Louvain Belgium Infrabel B-1070 Brussels Belgium Logically Yours BVBA B-2100 Deume Belgium

In order to improve the robustness of a railway system in station areas, this paper introduces an iterative approach to successively optimize the train routing through station areas and to enhance this solution by applying some changes to the timetable in a tabu search environment. We present our vision on robustness and describe how this vision can be used in practice. By introducing the spread of the trains in the objective function for, the route choice and timetabling module, we improve the robustness of a railway system. Using a discrete event simulation model, the performance of our algorithms is evaluated based on a case study for the Brussels' area. The computational results indicate an average improvement in robustness of 6.2% together with a decrease in delay propagation of about 25%. Furthermore, the effect of some measures like changing the train offer to further increase the robustness is evaluated and compared. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Transportation Robustness Railway timetabling Train routing Bottleneck scheduling mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2014年第11期65卷 1735-1747页

作者： Belo-Filho, Marcio A. F. Toledo, Franklina M. B. Almada-Lobo, Bernardo Univ Sao Paulo BR-13566590 Sao Paulo Brazil Univ Porto P-4100 Oporto Portugal

Setup operations are significant in some production environments. It is mandatory that their production plans consider some features, as setup state conservation across periods through setup carryover and crossover. The modelling of setup crossover allows more flexible decisions and is essential for problems with long setup times. This paper proposes two models for the capacitated lot-sizing problem with backlogging and setup carryover and crossover. The first is in line with other models from the literature, whereas the second considers a disaggregated setup variable, which tracks the starting and completion times of the setup operation. This innovative approach permits a more compact formulation. Computational results show that the proposed models have outperformed other state-of-the-art formulation.

关键词： lot sizing setup carryover setup crossover mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：