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

Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs

COMPUTERS & OPERATIONS RESEARCH 2012年第7期39卷 1345-1354页

作者： Sadjady, Hannan Davoudpour, Hamid Amir Kabir Univ Technol Dept Ind Engn Tehran Iran

Designing distribution networks - as one of the most important strategic issues in supply chain management - has become the focus of research attention in recent years. This paper deals with a two-echelon supply chain network design problem in deterministic, single-period, multi-commodity contexts. The problem involves both strategic and tactical levels of supply chain planning including locating and sizing manufacturing plants and distribution warehouses, assigning the retailers' demands to the warehouses, and the warehouses to the plants, as well as selecting transportation modes. We have formulated the problem as a mixed integer programming model, which integrates the above mentioned decisions and intends to minimize total costs of the network including transportation, lead-times, and inventory holding costs for products, as well as opening and operating costs for facilities. Moreover, we have developed an efficient Lagrangian based heuristic solution algorithm for solving the real-sized problems in reasonable computational time. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Distribution Supply chain network design Facility location problems mixed-integer programming Lagrangian heuristic

来源：评论

学校读者我要写书评

暂无评论

Product line pricing for services with capacity constraints and dynamic substitution

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年第2期219卷 347-359页

作者： Burkart, Wolfgang R. Klein, Robert Mayer, Stefan Univ Augsburg D-86159 Augsburg Germany

In this paper, we address a service provider's product line pricing problem for substitutable products in services, such as concerts, sporting events, or online advertisements. For each product, a static price is selected from a pre-defined set such that the total revenue is maximised. The products are differentiated by some of their attributes, and their availability is restricted due to individual capacity constraints. Furthermore, they are simultaneously sold during a common selling period at the end of which the service is delivered. Consumers differ from one another with respect to their willingness to pay, and, hence, their reservation prices vary depending on the product. In the event of a purchase, they choose the product that maximises their consumer surplus. Even if the number of consumers, the sequence of their arrival, and their product-specific reservation prices are known, the selection of optimal prices is computationally expensive. Due to capacity constraints, products can be sold out early during the selling period, which causes spill and recapture effects by dynamic substitution. In other words, consumers can switch from their preferred products to other products. To model the resulting choice process and optimise total revenue, we propose a linear mixed-integer program. For the solution of this program, we present a branch and bound procedure as well as several heuristic algorithms and evaluate their performances in computational experiments. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Pricing mixed-integer programming Branch and bound Heuristics

来源：评论

学校读者我要写书评

暂无评论

Extending the QCR method to general mixed-integer programs

引用

MATHEMATICAL programming 2012年第1-2期131卷 381-401页

作者： Billionnet, Alain Elloumi, Sourour Lambert, Amelie CEDRIC CNAM F-75141 Paris France CEDRIC ENSIIE F-91025 Evry France

Let (MQP) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP), i.e. we reformulate (MQP) into an equivalent program, with a convex objective function. Such a reformulation can be solved by a standard solver that uses a branch and bound algorithm. We prove that our reformulation is the best one within a convex reformulation scheme, from the continuous relaxation point of view. This reformulation, that we call MIQCR (mixed integer Quadratic Convex Reformulation), is based on the solution of an SDP relaxation of (MQP). Computational experiences are carried out with instances of (MQP) including one equality constraint or one inequality constraint. The results show that most of the considered instances with up to 40 variables can be solved in 1 h of CPU time by a standard solver.

关键词： General integer programming mixed-integer programming Quadratic programming Convex reformulation Semi-definite programming Experiments

来源：评论

学校读者我要写书评

暂无评论

Investigation of Economic and Environmental-Driven Demand Response Measures Incorporating UC

引用

IEEE TRANSACTIONS ON SMART GRID 2012年第1期3卷 12-25页

作者： Abdollahi, Amir Moghaddam, Mohsen Parsa Rashidinejad, Masoud Sheikh-El-Eslami, Mohammad Kazem Tarbiat Modares Univ Fac Elect & Comp Engn Tehran Iran Shahid Bahonar Univ Dept Elect Engn Kerman Iran

In recent years, load management (LM) programs are introduced as an impressive option in all energy policy decisions. Under deregulation, the scope of LM programs has considerably been expanded to include demand response programs (DRPs). Basically, DRPs are divided into two main categories namely, incentive-based programs (IBPs) and time-based rate (TBR) programs. In this paper, an economic model of responsive loads is derived based upon price elasticity of demand and customers' benefit function. In order to investigate the economic-driven and environmental-driven measures of demand response programs, a new linearized formulation of cost-emission based unit commitment problem associated with DRPs (UCDR) is presented. Here, UCDR is modeled as a mixed-integer programming (MIP) problem. The proposed model is applied to determine loads provided by DRPs and schedule commitment status of generating units. Moreover, the optimum value of incentive as a crucial issue for implementing DRPs is derived. Several analyses are conducted to investigate the impact of some important factors such as elasticity on the UCDR problem. The strategy success index (SSI) is employed to prioritize DRPs from the independent system operator (ISO) perspective. The conventional 10-unit test system is used to demonstrate effectiveness of the proposed methodology.

关键词： Economic-environmental driven measures incentive-based programs load economic model mixed-integer programming strategy success index (SSI) UCDR

来源：评论

学校读者我要写书评

暂无评论

MIP formulations and heuristics for two-level production-transportation problems

引用

COMPUTERS & OPERATIONS RESEARCH 2012年第11期39卷 2776-2786页

作者： Melo, Rafael A. Wolsey, Laurence A. Catholic Univ Louvain CORE B-1348 Louvain Belgium

A two-level supply chain with multiple items, production sites and client areas and a discrete time horizon is considered. After introducing different mixed integer programming formulations, including an initial formulation that is small but provides weak bounds and a multi-commodity extended formulation that provides much improved bounds but is of large size, we develop a hybrid heuristic that uses the strong formulation to provide a good dual bound and suggest certain variable fixing, and the initial formulation restricted by the variable fixing to then provide the heuristic solution. For different classes of medium-sized instances, we show that the hybrid heuristic provides solutions of a guaranteed quality that are as good or better than those provided by the MIP optimizer with a considerably larger run time. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Production-transportation Supply-chain mixed-integer programming MIP heuristics

来源：评论

学校读者我要写书评

暂无评论

Solving two-machine assembly scheduling problems with inventory constraints

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2012年第1期63卷 120-134页

作者： Terekhov, Daria Dogru, Mustafa K. Oezen, Ulas Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada Alcatel Lucent Bell Labs Dublin 15 Ireland

This paper considers a scheduling problem with component availability constraints in a supply chain consisting of two manufacturing facilities and a merge-in-transit facility. Three mixed-integer programming (MIP) models and a constraint programming (CP) model are compared in an extensive numerical study. Results show that when there are no components shared among the two manufacturers, the MIP model based on time-index variables is the best for proving optimality for problems with short processing times whereas the CP model tends to perform better than the others for problems with a large range of processing times. When shared components are added, the performance of all models deteriorates, with the time-indexed MIP providing the best results. By explicitly modelling the dependence of scheduling decisions on the availability of component parts, we contribute to the literature on the integration of inventory and scheduling decisions, which is necessary for solving realistic supply chain problems. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Assembly scheduling Inventory Order scheduling mixed-integer programming Constraint programming

来源：评论

学校读者我要写书评

暂无评论

mixed integer programming method to solve security constrained unit commitment with restricted operating zone limits

Mixed integer programming method to solve security constrain...

引用

IEEE International Conference on Electro/Information Technology

作者： Daneshi, Hossein Choobbari, Azim Lotfjou Shahidehpour, Mohammad Li, Zuyi IIT Elect Power & Power Elect Ctr Chicago IL 60616 USA

ISBN: (纸本)9781424420292

This paper presents a formulation of security-constrained unit commitment (SCUC) problem based on mixed integer programming (MIP) method with considering prohibited operating zone limits of thermal and hydro units. The objective of SCUC problem is to obtain minimum system operating cost while maintaining the system security. Thermal and hydro units in power system studies are assumed to possess smooth and convex input-output (IO) curves. Practically, not all the operating zones of generation units are available for load allocation due to some physical operation limits. This may cause to have a generator with nonsmooth IO curve with equality and inequality constraints which may not be solved easily by conventional mathematical methods. In this paper, non-convex characteristic of generator cost function, representing prohibited operating zones is considered in SCUC. Test results with an eight-bus system show the accuracy of the model and formulations.

关键词： security-constrained unit commitment (SCUC) mixed-integer programming prohibited operating zones unit forbidden zone hydrothermal scheduling

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach for modeling and solving product configuration problems

引用

CONCURRENT ENGINEERING-RESEARCH AND APPLICATIONS 2012年第1期20卷 31-42页

作者： Yang, Dong Dong, Ming Donghua Univ Sch Business & Management Shanghai 200051 Peoples R China Shanghai Jiao Tong Univ Antai Coll Econ & Management Shanghai 200030 Peoples R China

Within the context of build-to-order or assembly-to-order production strategy, an end product satisfying the requirements of a customer often comprises various components or parts that may be provided by the partnering suppliers. More probably, there exist a numerous number of alternative components or parts to be chosen when an end product is configured. Meanwhile, structures and constraints within the configurable product must be observed. To represent structures of products and constraints, object-oriented modeling method is employed to enable the share and reuse of configuration knowledge. To derive optimal configuration, product configuration problem with object-oriented configuration knowledge is formalized as a mixed-integer programming problem. The algorithm for product configuration optimization is implemented using Java CPLEX. Experiments are conducted to demonstrate and compare the performance of the algorithm. The results show that the computational time is reasonable and acceptable for medium-sized configuration problems.

关键词： mixed-integer programming product configuration configuration knowledge

来源：评论

学校读者我要写书评

暂无评论

mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations

引用

ANNALS OF OPERATIONS RESEARCH 2007年第1期155卷 119-142页

作者： Al-Yakoob, Salem M. Sherali, Hanif D. Kuwait Univ Coll Sci Dept Math & Comp Sci Safat 13060 Kuwait Virginia Polytech Inst & State Univ Grado Dept Ind & Syst Engn Blacksburg VA 24061 USA

This paper is concerned with the problem of assigning employees to gas stations owned by the Kuwait National Petroleum Corporation (KNPC), which hires a firm to prepare schedules for assigning employees to about 86 stations distributed all over Kuwait. Although similar employee scheduling problems have been addressed in the literature, certain peculiarities of the problem require novel mathematical models and algorithms to deal with the specific nature and size of this problem. The problem is modeled as a mixed-integer program, and a problem size analysis based on real data reveals that the formulation is too complex to solve directly. Hence, a two-stage approach is proposed, where the first stage assigns employees to stations, and the second stage specifies shifts and off-days for each employee. Computational results related to solving the two-stage models directly via CPLEX and by specialized heuristics are reported. The two-stage approach provides daily schedules for employees for a given time horizon in a timely fashion, taking into consideration the employees' expressed preferences. This proposed modeling approach can be incorporated within a decision support system to replace the current manual scheduling practice that is often chaotic and has led to feelings of bias and job dissatisfaction among employees.

关键词： employee scheduling mixed-integer programming partitioning two-stage approach manpower scheduling

来源：评论

学校读者我要写书评

暂无评论

An integer programming Model for Pricing American Contingent Claims under Transaction Costs

引用

COMPUTATIONAL ECONOMICS 2012年第1期39卷 1-12页

作者： Pinar, M. C. Camci, A. Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkey

We study the problem of computing the lower hedging price of an American contingent claim in a finite-state discrete-time market setting under proportional transaction costs. We derive a new mixed-integer linear programming formulation for calculating the lower hedging price. The linear programming relaxation of the formulation is exact in frictionless markets. Our results imply that it might be optimal for the holder of several identical American claims to exercise portions of the portfolio at different time points in the presence of proportional transaction costs while this incentive disappears in their absence.

关键词： American Contingent Claims Transaction Costs mixed-integer programming Linear programming Martingales Incomplete Markets Pricing Hedging Dividends

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：