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

TOPS Advanced Decision Support System for Port and Maritime Chemical Logistics

ASIAN JOURNAL OF SHIPPING AND LOGISTICS 2011年第1期27卷 143-156页

作者： Wu, Xue Oh, Hong Choon Karimi, Iftekhar A. Goh, Mark de Souza, Robert Natl Univ Singapore Logist Inst Asia Pacif Singapore Singapore Analyst Singapore Hlth Serv Singapore Singapore Natl Univ Singapore Singapore Singapore Natl Univ Singapore Logist Inst Asia Pacif Singapore Singapore Univ S Australia Sch Management Adelaide SA Australia Itional Univ Singapore Logitist Inst Singapore Singapore

This paper presents a decision support system named the Tanker Operations Planning System (TOPS). It is a user-friendly software with an advanced routing and scheduling algorithm to automate and aid the operational decision making process. It considers the key operations constraints faced by the tanker owners. The advanced routing and scheduling algorithm embedded in the decision engine uses heuristics to solve industrial scale problems under actual operating conditions. Besides, TOPS can easily generate the routing, scheduling, stowage plan and the financial reports, and it can process a large number of orders online as well. In addition, TOPS can be conveniently modified for evaluation purposes or to suit the preference of the tanker owners. In essence, TOPS is an effective optimization-based decision support system to assist the parcel tanker carriers to systematically and objectively plan vessel routes and schedules with the goal of maximizing profits and fleet utilization in a structured manner. Drawing from actual data provided by a tanker company operating in the Asia Pacific, our simulation results show that TOPS can generate a cost effective routing and scheduling plan of a large scale problem to within a practically acceptable time of around 10-20 minutes

关键词： Chemical Logistics Decision Support System Routing and Scheduling mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A permutation-based algorithm to optimally reschedule trains in a railway traffic network

引用

IFAC Proceedings Volumes 2011年第1期44卷 9537-9542页

作者： Ton J.J. van den Boom Nicolás Weiss Wilko Leune Rob M.P. Goverde Bart De Schutter Delft University of Technology Delft Center for Systems and Control Delft The Netherlands Delft University of Technology Department of Transport and Planning Delft The Netherlands

Abstract In this paper we discuss dynamic traffic management of railway traffic networks at an operational level. We design a model predictive controller based on measurements of the actual train positions. The core of the model predictive control approach is the railway traffic model, for which a switching max-plus linear system is proposed. If the model is affine in the controls, the optimisation problem can be recast as a mixed-integer linear programming problem. To this end we present a permutation-based algorithm to model the rescheduling of trains running on the same track. We apply the algorithm to a simple railway traffic network simulation model and show a significant reduction of delays compared to the uncontrolled case.

关键词： Switching max-plus linear models model predictive control mixed-integer linear programming railway traffic management

来源：评论

学校读者我要写书评

暂无评论

Continuous *** Lot Sizing and Scheduling:The Case of a Beverage Manufacturer

Continuous *** Lot Sizing and Scheduling:The Case of a Bever...

引用

The Twelfth Asia Pacific Industrial Engineering ＆ Management Systems Conference(APIEMS 2011)

作者： H.-O.Günther TU Berlin H95Production Management10623 BerlinGermanyStraβe des Juni 135

Traditionally,a discrete time scale is chosen to model lot sizing and *** paper proposes a novel continuous time based model formulation,called block planning,for application in the beverage *** block planning approach is compared with a classic discrete time based MILP model formulation for single stage capacitated lot sizing and *** a case study,the production of beverages at a leading European producer of fruit juice is *** beverage industry as well as other branches of the consumer goods industry faces an increased number of package forms,customized package prints and labels,and a variety of flavours and compositions of ingredients. Typically,combined bottling and packaging lines are established for each package form,*** bottles,carton boxes,and glass *** proposed model formulations determine the lot sizing and scheduling decisions by solving an MILP model under the objective of minimizing the *** is shown that the continuous time based model formulation is much more compact with respect to the number of decision variables and constraints.

关键词： Lot-sizing and scheduling block planning mixed-integer linear programming beverage industry

来源：评论

学校读者我要写书评

暂无评论

A Generation Expansion Planning Model of a Strategic Electricity Generating Firm

A Generation Expansion Planning Model of a Strategic Electri...

引用

IEEE Power and Energy Society General Meeting

作者： M. R. Hesamzadeh M. Amelin Royal Institute of Technology (KTH) Stockholm Sweden Electric Power Systems Laboratory at the School of Electrical Engineering RoyalInstitute of Technology (KTH) Stockholm Sweden

ISBN: (纸本)9781457710001

This paper derives a mathematical structure for investment decisions of a profit-maximising and strategic producer in liberalised electricity markets. The paper assumes a Cournot producer in an energy market with nodal pricing regime. The Cournot producer is assumed to have revenue from selling energy to the pool. The investment problem of the strategic producer is modelled through a leader-follower game in applied mathematics. The leader is the strategic producer seeking the optimal mix of its investment technologies and the follower is a stochastic estimator. The stochastic estimator forecasts the reactions of other producers in the market in response to the investment decisions of the producer in question. The stochastic estimator takes the investment decisions of the producer and it calculates the stochastic prices. The mathematical structure is a stochastic linear bilevel programming problem. This problem is reformulated as a stochastic MILP problem which can be solved using the commercially available software packages. Finally, the developed mathematical structure is applied to a six-node example system to highlight the strengths of the whole approach.

关键词： Generation expansion planning mixed-integer linear programming Uncertainty actor expansion plan mixed integer linear programming Stochastic Investments energy market Uncertainty power markets Software packages

来源：评论

学校读者我要写书评

暂无评论

Optimizing the use of public transit system during no-notice evacuation of urban areas

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2010年第4期59卷 488-495页

作者： Sayyady, Fatemeh Eksioglu, Sandra D. N Carolina State Univ Operat Res Grad Program Raleigh NC 27695 USA Mississippi State Univ Dept Ind & Syst Engn Mississippi State MS 39762 USA

This paper proposes a methodology that can be used to design plans for evacuating transit-dependent citizens during no-notice disasters. A mixed-integer linear program is proposed to model the problem of finding optimal evacuation routes. The objective of the problem is to minimize the total evacuation time and the number of casualties, simultaneously. A traffic simulation package is used to explicitly incorporate the traffic flow dynamics into our model in order to generate solutions which are consistent with the dynamics of traffic network. Due to the long running time of CPLEX, a Tabu search algorithm is designed that finds evacuation routes for transit vehicles. Computational experiments demonstrate that the solutions found are of high-quality. Numerical experiments are conducted using the transportation network of the city of Forth Worth, TX to illustrate the modeling procedure and solution approach. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： No-notice disasters Emergency evacuation Public transit system mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Sensitivity-Based Approaches for Handling Discrete Variables in Optimal Power Flow Computationse

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2010年第4期25卷 1780-1789页

作者： Capitanescu, Florin Wehenkel, Louis Univ Liege Dept Elect Engn & Comp Sci B-4000 Liege Belgium

This paper proposes and compares three iterative approaches for handling discrete variables in optimal power flow (OPF) computations. The first two approaches rely on the sensitivities of the objective and inequality constraints with respect to discrete variables. They set the discrete variables values either by solving a mixed-integer linear programming (MILP) problem or by using a simple procedure based on a merit function. The third approach relies on the use of Lagrange multipliers corresponding to the discrete variables bound constraints at the OPF solution. The classical round-off technique and a progressive round-off approach have been also used as a basis of comparison. We provide extensive numerical results with these approaches on four test systems with up to 1203 buses, and for two OPF problems: loss minimization and generation cost minimization, respectively. These results show that the sensitivity-based approach combined with the merit function clearly outperforms the other approaches in terms of: objective function quality, reliability, and computational times. Furthermore, the objective value obtained with this approach has been very close to that provided by the continuous relaxation OPF. This approach constitutes therefore a viable alternative to other methods dealing with discrete variables in an OPF.

关键词： Discrete variables mixed-integer linear programming mixed-integer nonlinear programming nonlinear programming optimal power flow

来源：评论

学校读者我要写书评

暂无评论

Efficient bulk maritime logistics for the supply and delivery of multiple chemicals

引用

COMPUTERS & CHEMICAL ENGINEERING 2010年第12期34卷 2118-2128页

作者： Li, Jie Karimi, I. A. Srinivasan, Rajagopalan Natl Univ Singapore Dept Chem & Biomol Engn Singapore 117576 Singapore Inst Chem & Engn Sci Singapore 627833 Singapore

Many multinational chemical companies (MNCs) manage the inventories of several raw materials at their worldwide sites. Maritime transportation plays a key role in this chemical logistics. In this paper, we address an inventory service problem in which a chemical MNC uses a fleet of multi-parcel ships with dedicated compartments to move multiple chemicals continually among its internal and external production and consumption sites. The objective is to ensure continuity of operation at all sites by maintaining adequate inventory levels of all raw materials. We develop a novel multi-grid continuous-time mixed-integer linear programming (MILP) formulation based (Susarla, Li, & Karimi. 2010) for this chemical logistics problem. Our model allows limited jetties at each site, non-zero transfer times, variable load/unload quantities, transfer task sequencing, etc. In contrast to the literature, it needs no separate estimates for arrivals at each site. Several examples are solved to illustrate the efficiency of our proposed formulation. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Routing Scheduling mixed-integer linear programming Transportation Chemical logistics Supply chains Inventory management

来源：评论

学校读者我要写书评

暂无评论

A win-win collaboration approach for a two-echelon supply chain: a case study in the pulp and paper industry

引用

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2010年第4期4卷 493-514页

作者： Lehoux, Nadia D'Amours, Sophie Langevin, Andre Univ Laval CIRRELT FORAC Quebec City PQ G1K 7P4 Canada Ecole Polytech CIRRELT Montreal PQ H3C 3A7 Canada

Because of international competition, the development of new technologies and the increase of production and energy costs, enterprises must improve their supply chains and change their ways of doing business. They also have to collaborate with their suppliers, distributors and retailers in order to better respond to market demand. This kind of relationship can be based on well-known collaboration models like collaborative, planning, forecasting and replenishment (CPFR) or vendor managed inventory (VMI), so as to correctly exchange products and information. However, it is necessary to choose the right collaboration approach that will be profitable for all partners. In this article, we study different collaboration strategies between a pulp and paper producer and its retailer. For this particular context, we identify the collaboration mode that is the most profitable for each actor, based on real costs and parameters obtained from the industrial case. We also develop a method to better share collaboration benefits and ensure a relationship advantageous for everyone. We demonstrate that if the producer shares a part of the transportation or inventory savings with its partner, the CPFR method can be profitable for both partners and generate the greatest total system profit.

关键词： win-win approach enterprise collaborations two-echelon supply chain producer-retailer relationship pulp and paper industry case study collaborative planning, forecasting and replenishment CPFR vendor managed inventory VMI incentives mixed-integer linear programming industrial engineering

来源：评论

学校读者我要写书评

暂无评论

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks

引用

COMPUTER NETWORKS 2010年第11期54卷 1805-1822页

作者： Guney, Evren Aras, Necati Altinel, I. Kuban Ersoy, Cem Bogazici Univ Dept Comp Eng TR-34342 Istanbul Turkey Bogazici Univ Dept Ind Eng TR-34342 Istanbul Turkey

Sensors spend most of their limited battery energy on communicating the collected environmental information to sinks. Therefore, the determination of the optimal sink locations and sensor-to-sink information flow routes becomes important for the survivability of sensor networks. In this work, we address these important design issues using an integrated approach and propose new mixed-integer linear programming models to determine the optimal sink locations and information flow paths between sensors and sinks when sensor locations are given. The first group of proposed models is energy-aware and tries to minimize total routing energy, whereas the second group is financially driven with the objective of minimizing total cost. We do not only report computational results providing information on the solution efficiency of the new formulations, and the accuracy of their linear programming relaxations, but also propose and test new heuristics and lower bounding approaches for the most efficient formulation. (C) 2010 Elsevier B.V. All rights reserved.

关键词： mixed-integer linear programming Routing Sink location Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

In the determination of weight sets to compute cross-efficiency ratios in DEA

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2010年第1期61卷 134-143页

作者： Lam, K. F. City Univ Hong Kong Dept Management Sci Kowloon Hong Kong Peoples R China

Data envelopment analysis (DEA) measures the production performance of decision-making units (DMUs) which consume multiple inputs and produce multiple outputs. Although DEA has become a very popular method of performance measure, it still suffers from some shortcomings. For instance, one of its drawbacks is that multiple solutions exist in the linear programming solutions of efficient DMUs. The obtained weight set is just one of the many optimal weight sets that are available. Then why use this weight set instead of the others especially when this weight set is used for cross-evaluation? Another weakness of DEA is that extremely diverse or unusual values of some input or output weights might be obtained for DMUs under assessment. Zero input and output weights are not uncommon in DEA. The main objective of this paper is to develop a new methodology which applies discriminant analysis, super-efficiency DEA model and mixed-integer linear programming to choose suitable weight sets to be used in computing cross-evaluation. An advantage of this new method is that each obtained weight set can reflect the relative strengths of the efficient DMU under consideration. Moreover, the method also attempts to preserve the original classificatory result of DEA, and in addition this method produces much less zero weights than DEA in our computational results. Journal of the Operational Research Society (2010) 61, 134-143. doi:10.1057/jors.2008.138

关键词： data envelopment analysis discriminant analysis linear programming mixed-integer linear programming performance measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：