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

In the determination of the most efficient decision making unit in data envelopment analysis

COMPUTERS & INDUSTRIAL ENGINEERING 2015年 79卷 76-84页

作者： Lam, Kim Fung City Univ Hong Kong Dept Management Sci Kowloon Hong Kong Peoples R China

In recent years, several mixed integer linear programming (MILP) models have been proposed for determining the most efficient decision making unit (DMU) in data envelopment analysis. However, most of these models do not determine the most efficient DMU directly;instead, they make use of other less related objectives. This paper introduces a new MILP model that has an objective similar to that of the super-efficiency model. Unlike previous models, the new model's objective is to directly discover the most efficient DMU. Similar to the super-efficiency model, the aim is to choose the most efficient DMU. However, unlike the super-efficiency model, which requires the solution of a linear programming problem for each DMU, the new model requires that only a single MILP problem be solved. Consequently, additional terms in the objective function and more constraints can be easily added to the new model. For example, decision makers can more easily incorporate a secondary objective such as adherence to a publicly stated preference or add assurance region constraints when determining the most efficient DMU. Furthermore, the proposed model is more accurate than two recently proposed models, as shown in two computational examples. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Data envelopment analysis Most efficient DMU Super-efficiency model mixed integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Optimal allocation of series FACTS devices in large-scale systems

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第8期12卷 1889-1896页

作者： Zhang, Xiaohu Tomsovic, Kevin Dimitrovski, Aleksandar Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Univ Cent Florida Dept Elect & Comp Engn Orlando FL 32816 USA

Series flexible AC transmission systems devices, such as the variable series reactor, have the ability to continuously regulate the transmission line reactance so as to control power flow. This study presents a new approach to optimally locating such devices in the transmission network considering multiple operating states and contingencies. To investigate optimal investment, a single target year planning with three different load patterns is considered. The transmission contingencies may occur under any of the three load conditions and the coupling constraints between base case and contingencies are included. A reformulation technique transforms the original mixed integer non-linear programming model into mixed integer linear programming model. To further relieve the computational burden and enable the planning model to be directly applied to practical large-scale systems, a two-phase decomposition algorithm is introduced. Detailed numerical simulation results on IEEE 118-bus system and the Polish 2383-bus system illustrate the efficient performance of the proposed algorithm.

关键词： flexible AC transmission systems load flow control power transmission economics power transmission planning investment integer programming linear programming numerical analysis series FACTS device optimal allocation large-scale systems Series flexible AC transmission system devices transmission line reactance regulation power flow control transmission network multiple operating states optimal investment single target year planning transmission contingencies coupling constraints reformulation technique mixed integer nonlinear programming model mixed integer linear programming model computational burden planning model two-phase decomposition algorithm numerical simulation IEEE 118-bus system Polish 2383-bus system

来源：评论

学校读者我要写书评

暂无评论

Integrated approach for the bucking and production planning problems in forest industry

引用

COMPUTERS & CHEMICAL ENGINEERING 2019年 125卷 155-163页

作者： Vanzetti, Nicolas Broz, Diego Montagna, Jorge M. Corsano, Gabriela CONICET UTN INGAR Inst Desarrollo & Diseno Avellaneda 3657S3002GJC Santa Fe Argentina Univ Nacl Litoral Fac Ingn Quim Santiago Estero 2829 Santa Fe Argentina UNAM CONICET FCF Bertoni 124N3382GDD Eldorado Misiones Argentina

The appropriate integration among production activities is a key factor for the development of the forest industry in the northeast of Argentina. Sawmills are one of the main logs consumers. However, production planning of sawmills has been managed independently of the forest production. In this work, a mixed integer linear programming formulation is proposed in order to achieve an adequate logs supply that allows carrying out an efficient lumber production plan. Bucking decisions, as the number of stems to be harvested and the employed bucking patterns, are jointly solved with sawmill planning decisions, like the number and type of processed logs and the used cutting patterns, in order to fulfill the boards demands maximizing the net profit along the time horizon composed by several time periods (days). Through examples, the capabilities of the proposed approach are highlighted and the computational results are analyzed. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Bucking Log procurement policy Sawmill production planning mixed integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Hybrid flexible flowshop problems: models and solution methods

引用

APPLIED MATHEMATICAL modelLING 2014年第24期38卷 5767-5780页

作者： Naderi, B. Gohari, Sheida Yazdani, M. Univ Kharazmi Dept Ind Engn Fac Engn Karaj Iran Qazvin Islamic Azad Univ Fac Ind & Mech Engn Dept Ind Engn Qazvin Iran

This paper considers the problem of hybrid flowshop scheduling. First, we review the shortcoming of the available model in the literature. Then, four different mathematical models are developed in form of mixed integer linear programming models. A complete experiment is conducted to compare the models for performance based on the size and computational complexities. Besides the models, the paper proposes a novel hybrid particle swarm optimization algorithm equipped with an acceptance criterion and a local search heuristic. The features provide a fine balance of diversification and intensification capabilities for the algorithm. Using Taguchi method, the algorithm is fine tuned. Then, two numerical experiments are performed to evaluate the performance of the proposed algorithm with three particle swarm optimization algorithms available in the scheduling literature and one well-known iterated local search algorithm in the hybrid flowshop literature. All the results show the high performance of the proposed algorithm. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Hybrid flowshop scheduling mixed integer linear programming model Hybrid particle swarm optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

An MILP model for risk-based placement of RCSs, DDGs, and tie lines in distribution systems with complex topologies

引用

IET RENEWABLE POWER GENERATION 2023年第4期17卷 829-839页

作者： Zare-Bahramabadi, Majid Farzin, Hossein Ehsan, Mehdi Sharif Univ Technol Elect & Elect Engn Tehran Iran Shahid Chamran Univ Ahvaz Elect & Elect Engn Ahwaz Khuzestan Iran

Remote-controlled switches (RCSs) have the ability to quickly isolate the faulted area from other parts of distribution systems. On the other hand, the distributed generation resources (DGs) and tie lines can supply the interrupted loads after fault occurrence as a microgrid. In this regard, this paper proposes a planning model for simultaneous placement of RCSs, dispatchable DGs (DDGs), and tie lines in distribution systems with complex topologies to improve their reliability. Presence of renewable DGs (RDGs) including photovoltaic cells (PVs) and wind turbines (WTs), as well as the uncertainties of loads, RDGs, and outage duration of the faulted areas are also considered in the proposed planning model. Conditional value at risk (CVaR) is used to manage the system risk. The proposed planning model is formulated as a mixed integer linear programming model (MILP), which can be solved using various commercial solvers and give the global optimal solution. Finally, the proposed planning model is implemented on the IEEE 33 bus system as various cases to illustrate its effectiveness on improving the reliability of distribution systems and managing the system risk.

关键词： Distribution networks DDGs risk-based placement Reliability Optimisation techniques Wind power plants Power system management, operation and economics Solar power stations and photovoltaic power systems faulted area IEEE 33 bus system RCSs wind turbines Power system planning and layout mixed integer linear programming model complex topologies fault occurrence remote-controlled switches distribution systems MILP model distributed power generation planning model distributed generation resources Power system control renewable DGs including photovoltaic cells integer programming system risk linear programming Distributed power generation dispatchable DGs

来源：评论

学校读者我要写书评

暂无评论

modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2011年第5-8期53卷 751-760页

作者： Naderi, Bahman Ghomi, S. M. T. Fatemi Aminnayeri, M. Zandieh, M. Shahid Beheshti Univ Management & Accounting Fac Dept Ind Management GC Tehran Iran Amirkabir Univ Technol Dept Ind Engn Tehran Iran

It is known that in many real industrial settings, some setup is carried out before the process of a job. Usually, the magnitude of this setup depends on the order of two consecutive jobs. In this case, the setup is called sequence-dependent. This paper deals with open shop scheduling with sequence-dependent setup times to minimize the total completion time. The problem is formulated as an effective mixed integer linear programming model that best characterizes and solves to optimality small-sized instances of the problem under consideration. Since the electromagnetism-like metaheuristic (EM) is successfully applied to some NP-hard problems, we have been motivated to employ and assess the effectiveness of EM to solve the open shop with setup times. To further enhance EM, a local search engine in form of a fast and simple simulated annealing is incorporated. In order to evaluate the performance of the proposed algorithms, an experiment is designed where the proposed methods are compared against some algorithms in the literature. The related results are analyzed by statistical tools. The experimental results and statistical analyses demonstrate that the proposed model and EM are effective for the problem.

关键词： Scheduling Open shops Total completion time mixed integer linear programming model Hybrid electromagnetism-like metaheuristic

来源：评论

学校读者我要写书评

暂无评论

A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times

引用

COMPUTERS & OPERATIONS RESEARCH 2010年第9期37卷 1624-1640页

作者： Wang, Xianpeng Tang, Lixin Northeastern Univ Logist Inst Liaoning Key Lab Mfg Syst & Logist Shenyang 110004 Peoples R China

This paper investigates a single machine scheduling problem with strong industrial background, named the prize-collecting single machine scheduling problem with sequence-dependent setup times. In this problem, there are n candidate jobs for processing in a single machine, each job has a weight (or profit) and a processing time, and during processing a symmetric sequence-dependent setup time exists between two consecutive jobs. Since there is a maximum available time limitation of the machine, it is generally impossible to complete the processing of all the candidate jobs within this time limitation. The objective is to find a job processing sequence of maximal job weights (or profits) over a subset of all candidate jobs whose makespan does not exceed the given time limitation. This problem can be considered as an application of the orienteering problem (OP) in the field of discrete manufacturing. We formulate this problem as a mixed integer linear programming (MILP) model and propose a hybrid metaheuristic combining the structures of scatter search and variable neighborhood search. Computational results on a large number of randomly generated instances with different structures show that the proposed hybrid metaheuristic outperforms CPLEX and two metaheuristics proposed for the OP. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Prize-collecting single machine scheduling Sequence-dependent setup times Orienteering problem mixed integer linear programming model Hybrid metaheuristic

来源：评论

学校读者我要写书评

暂无评论

Computational evaluation of a MIP model for multi-port stowage planning problems

引用

SOFT COMPUTING 2017年第7期21卷 1753-1763页

作者： Ambrosino, Daniela Paolucci, Massimo Sciomachen, Anna Univ Genoa Dept Econ & Business Studies DIEC Genoa Italy Univ Genoa Dept Informat Bioengn Robot & Syst Engn DIBRIS Genoa Italy

In this paper, we consider the problem of determining stowage plans for containers into ships having to visit a given number of ports in their circular route. The problem is denoted Multi-Port Master Bay Plan Problem (MP-MBPP). In practice, the MP-MBPP consists in determining how to stow a given set of containers, split into different groups, according to their size, type, class of weight and destination, into bay locations, either on the deck or in the stow. Some structural and operational constraints, related to the containers, the ship and the maritime terminals, have to be satisfied. The single port MBPP is a NP-hard optimization problem, and has been proposed in the literature from 2001. From then, some variants of the problem have been presented, together with the related solution methods, mainly aimed at including in the corresponding models realistic features, required as a consequence of the naval gigantism. As a novel issue, in the present work, we look for stowage plans where the set of containers to be loaded on board at each port of the route consists of standard, reefer and open top ones. Hatches positions in the ships are considered too. We present a new mixed integer programming (MIP) model for the MP-MBPP able to manage realistic scenarios and find stowage plans for containerships up to 18,000 TEUs. The model is finalized to be solved with a commercial MIP solver. The reported computational experimentation shows that the model is very efficient and could be fruitfully used for facing real-size instances of the problem.

关键词： Stowage plans Combinatorial optimization problem mixed integer linear programming model Computational evaluation

来源：评论

学校读者我要写书评

暂无评论

Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2019年 535卷 122286-122286页

作者： Yang, Fang Huang, Yao-Huei Li, Jun Southwest Jiaotong Univ Sch Econ & Management Chengdu 610031 Sichuan Peoples R China Fu Jen Catholic Univ Dept Informat Management New Taipei Taiwan

This study examines the winner determination problem (WDP) for the procurement of transportation service. The problem contains three important roles, namely, shippers, carriers, and third-party carriers. Shippers determine the service lanes that can be outsourced to carriers so that the transportation service cost may be reduced. The WDP can be formulated as a mixed integer linear programming (MILP) model. However, when solving a general MILP model, it is easy to fall into the imbalanced issue of branch-and-bound trees, such that the computational time becomes longer. This study proposes a deterministic model with a powerful and significant theoretical mechanism to conquer the imbalanced issue. Solving the proposed model can minimize the service costs subject to each lane being served by carriers and consider the quantity discount. The most important objective in this study is to identify an iterative algorithm that embeds the proposed model, which presents all alternative solutions for shippers to consider better options. Numerical experiment is also presented to confirm the usefulness of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Winner determination problem Transportation service mixed integer linear programming model Alternative solutions

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient job shop scheduling problem with transport resources considering speed adjustable resources

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2024年第3期62卷 867-890页

作者： Fontes, Dalila B. M. M. Homayouni, Seyed Mahdi Fernandes, Joao Chaves Univ Porto Fac Econ Porto Portugal INESC TEC LIAAD Campus FEUP Porto Portugal Univ Porto Fac Engn Porto Portugal Univ Porto Fac Econ P-4200464 Porto Portugal INESC TEC LIAAD P-4200465 Porto Portugal

This work extends the energy-efficient job shop scheduling problem with transport resources by considering speed adjustable resources of two types, namely: the machines where the jobs are processed on and the vehicles that transport the jobs around the shop-floor. Therefore, the problem being considered involves determining, simultaneously, the processing speed of each production operation, the sequence of the production operations for each machine, the allocation of the transport tasks to vehicles, the travelling speed of each task for the empty and for the loaded legs, and the sequence of the transport tasks for each vehicle. Among the possible solutions, we are interested in those providing trade-offs between makespan and total energy consumption (Pareto solutions). To that end, we develop and solve a bi-objective mixed-integer linear programming model. In addition, due to problem complexity we also propose a multi-objective biased random key genetic algorithm that simultaneously evolves several populations. The computational experiments performed have show it to be effective and efficient, even in the presence of larger problem instances. Finally, we provide extensive time and energy trade-off analysis (Pareto front) to infer the advantages of considering speed adjustable machines and speed adjustable vehicles and provide general insights for the managers dealing with such a complex problem.

关键词： Job shop scheduling problem transport resources energy-efficient mixed integer linear programming model BRKGA multi-population

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：