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

Hybrid optimization procedures applying for two-echelon urban underground logistics network planning: A case study of Beijing

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2020年 144卷 106452-106452页

作者： Hu, Wanjie Dong, Jianjun Hwang, Bon-gang Ren, Rui Chen, Zhilong Nanjing Tech Univ Coll Civil Engn Nanjing 211816 Peoples R China Natl Univ Singapore Dept Bldg Singapore 117566 Singapore Army Engn Univ PLA Coll Def Engn Nanjing 210042 Peoples R China

Motivated by urban land scarcity and surging demand, the underground space has become a frontier domain for future city logistics industry. The Underground Logistics System (ULS) is a sustainable option to overcome traffic congestion while improving freight transport efficiency. This study presents a comprehensive layout design and facility planning method for the two-echelon urban ULS network with hub-and-spoke structure. The underground network is organized by the primary and secondary ULS nodes and tunnels which have strong alignment with existing logistics nodes such as distribution centers and major demand terminals. A bi-objective mixed-integer linear programming model considering minimal costs and maximal system utilization was established to formulate the location-allocation of ULS nodes, tunnel layout and flow routing in the network. Given the inherent problem complexity, a series of simplification techniques and hybrid optimization procedures integrating both exact and meta-heuristic algorithms were developed to obtain high quality solutions. Finally, a real-world simulation was carried out in Beijing, China to demonstrate the applicability of proposed method. Results show that our procedures can effectively obtain the best configurations of ULS network under various scenarios and has better convergence efficiency and optimality performance. Moreover, a group of horizontal tests and sensitivity analysis reveals further insights regarding ULS network decision-making and layout strategies.

关键词： Underground Logistics System (ULS) Logistics network design Facility planning mixed-integer programming Hybrid algorithm Case study

来源：评论

学校读者我要写书评

暂无评论

A Complementary Column Generation Approach for the Graph Equipartition Problem

引用

INFORMATICA 2020年第1期31卷 1-20页

作者： Al-Ykoob, Salem M. Sherali, Hanif D. Kuwait Univ Coll Sci Dept Math POB 5969 Safat 13060 Kuwait Virginia Tech Grad Dept Ind & Syst Engn 0118 Blacksburg VA 24061 USA

This paper investigates the problem of partitioning a complete weighted graph into complete subgraphs, each having the same number of vertices, with the objective of minimizing the sum of edge weights of the resulting subgraphs. This NP-complete problem arises in many applications such as assignment and scheduling-related group partitioning problems and micro-aggregation techniques. In this paper, we present a mathematical programming model and propose a complementary column generation approach to solve the resulting model. A dual based lower bounding feature is also introduced to curtail the notorious tailing-off effects often induced when using column generation methods. Computational results are presented for a wide range of test problems.

关键词： graph partitioning column generation complementary column generation mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

A planning approach for polymetallic mines using a sublevel stoping technique with pillars and ultimate stope limits

引用

ENGINEERING OPTIMIZATION 2020年第6期52卷 932-944页

作者： Sari, Yuksel Asli Kumral, Mustafa McGill Univ Dept Min & Mat Engn Montreal PQ Canada

A widely used unsupported underground mining technique is sublevel stoping, in which portions of ore-body within certain size constraints are extracted. In this article, a sequential approach is proposed to solve the sublevel determination problem, which is part of development and infrastructure planning, and the stope layout planning problem for polymetallic sublevel stope mining with pillars. First, a new algorithm is proposed to determine the sublevels, which focuses on minimizing the development costs while maintaining access to the profitable portions of the ore-body. Then, the stope layout is planned between the sublevels. A new mixed-integer linear programming formulation for determining the ultimate stope limits is introduced. A case study is conducted on a copper-molybdenum mine to demonstrate the proposed approaches. The results show that the output of the stope layout plan is within the optimal mining limits, which confirms the validity of the approach.

关键词： Sublevel stoping with pillars stope layout planning heuristics ultimate stope limits mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

Multi-choice and stochastic programming for transportation problem involved in supply of foods and medicines to hospitals with consideration of logistic distribution

引用

RAIRO-OPERATIONS RESEARCH 2020年第4期54卷 1119-1132页

作者： Mahapatra, Deshabrata Roy Panda, Shibaji Sana, Shib Sankar Kishorenagar Sachindra Sikshasadan Dept Math Contai 721401 W Bengal India Bengal Inst Technol Dept Math 1 Govt Colony Kolkata 700150 W Bengal India Kishore Bharati Bhagini Nivedita Coll Kolkata 700060 India

The objective of the proposed article is to minimize the transportation costs of foods and medicines from different source points to different hospitals by applying stochastic mathematical programming model to a transportation problem in a multi-choice environment containing the parameters in all constraints which follow the Logistic distribution and cost coefficients of objective function are also multiplicative terms of binary variables. Using the stochastic programming approach, the stochastic constraints are converted into an equivalent deterministic one. A transformation technique is introduced to manipulate cost coefficients of objective function involving multi-choice or goals for binary variables with auxiliary constraints. The auxiliary constraints depends upon the consecutive terms of multi-choice type cost coefficient of aspiration levels. A numerical example is presented to illustrate the whole idea.

关键词： Multi-choice programming stochastic programming Logistic distribution transportation problem transformation technique mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

Global optimization of batch and steady-state recycling chromatography based on the equilibrium model

引用

COMPUTERS & CHEMICAL ENGINEERING 2020年第0期135卷 106687-000页

作者： Dienstbier, Jana Schmoelder, Johannes Burlacu, Robert Liers, Frauke Kaspereit, Malte Friedrich Alexander Univ Erlangen Nurnberg Inst Separat Sci & Technol Erlangen Germany Friedrich Alexander Univ Erlangen Nurnberg Discrete Optimizat Erlangen Germany

A bi-level approach is presented for the optimal design of batch and steady-state recycling (SSR) chromatography. On the first level, an efficient formulation as mixed-integer problem (MIP) is applied to obtain optimal fractionation times for chromatograms simulated by the equilibrium model. On the second level, the optima are evaluated against a parametrized objective function. The combination of model and optimization method provides a computationally very efficient tool. A comprehensive example study demonstrates that batch chromatography achieves the highest productivities at the cost of limited yields, which is optimal only for vanishing feed costs. In other instances, the more flexible SSR concept provides larger profits. The results reveal also new optimal operating policies for SSR processes with segmented product fractions and waste streams. (C) 2019 Published by Elsevier Ltd.

关键词： Chromatography Steady-state recycling Global optimization mixed-integer programming Cost function

来源：评论

学校读者我要写书评

暂无评论

Reducing the computational burden of a microgrid energy management system

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2020年 143卷 106384-106384页

作者： McIlvenna, Amelia Herron, Andrew Hambrick, Joshua Ollis, Ben Ostrowski, James Univ Tennessee Ind & Syst Engn Knoxville TN 37996 USA Oak Ridge Natl Lab POB 2009 Oak Ridge TN 37830 USA

As renewable technology advances and decreases in cost, microgrids are becoming an appealing means of distributed generation both for isolated communities and integrated with existing electrical grid systems. Due to their small size, however, microgrids may have financial limitations which preclude them from using commercial software to optimize control of their assets. Open-source optimization solvers are a viable alternative, but increase computation time. This work expands on a rolling horizon optimization framework for economic dispatch within an existing residential microgrid located in Hoover, Alabama. The microgrid has an open-source solver requirement and a need for quick solution time on a rolling horizon as opposed to a day-ahead commitment. We present a method of reducing integer variables by relaxation which completes two goals: reduction in computation time for real-time operations, and reduction in daily operational cost for the microgrid. Seasonal data for load and photovoltaic (PV) power was also collected from the microgrid to facilitate simulation testing. Computation time was successfully reduced using multiple variations of the relaxation method, while obtaining solution quality with operational cost similar to or better than the original model.

关键词： Microgrids mixed-integer programming Energy management system Rolling horizon

来源：评论

学校读者我要写书评

暂无评论

A mathematical model and tabu search algorithm for multi-manned assembly line balancing problems with assignment restrictions

引用

ENGINEERING OPTIMIZATION 2020年第5期52卷 856-874页

作者： Yilmaz, Hamid Yilmaz, Mustafa Bayburt Univ Engn Fac Ind Engn Dept Bayburt Turkey Ataturk Univ Erzurum Engn Fac Ind Engn Dept Erzurum Turkey

A multi-manned assembly line is a set of workstations where task operations can be performed on multiple sides of the line. Such assembly lines are important for large products, such as buses, cars and trucks. In this study, a mathematical model for multi-manned assembly lines with assignment restrictions is proposed. The purpose of the mathematical model is to minimize the total number of workers and open multi-manned workstations along the line for a given cycle time simultaneously under various assignment restrictions. The model provides a more realistic situation for multi-manned assembly line problems. The tabu search algorithm (TSA) is also used to solve the problem. The performances of both methods on well-known data-set problems are analysed. Based on the computational experiments, the performance of the proposed TSA is compared with the mathematical model solutions on various problem instances. The experimental results verify the effectiveness and efficiency of the proposed TSA.

关键词： Assembly line balancing multi-manned workstations mixed-integer programming tabu search algorithm assignment restrictions

来源：评论

学校读者我要写书评

暂无评论

On the structure of linear programs with overlapping cardinality constraints

引用

DISCRETE APPLIED MATHEMATICS 2020年 275卷 42-68页

作者： Fischer, Tobias Pfetsch, Marc E. Fraunhofer Inst Ind Math ITWM Kaiserslautern Germany Tech Univ Darmstadt Dept Math Darmstadt Germany

Cardinality constraints enforce an upper bound on the number of variables that can be nonzero. This article investigates linear programs with cardinality constraints that mutually overlap, i.e., share variables. We present the components of a branch-and-cut solution approach, including new branching rules that exploit the structure of the corresponding conflict hypergraph. We also investigate valid or facet defining cutting planes for the convex hull of the feasible solution set. Our approach can be seen as a continuous analogue of independence system polytopes. We study three different classes of cutting planes: hyperclique bound cuts, implied bound cuts, and flow cover cuts. In a computational study, we examine the effectiveness of an implementation based on the presented concepts. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Cardinality constraints Complementarity constraints Flow cover inequalities mixed-integer programming Branch-and-cut

来源：评论

学校读者我要写书评

暂无评论

An optimization model for selecting wood supply contracts

引用

CANADIAN JOURNAL OF FOREST RESEARCH 2020年第4期50卷 399-412页

作者： Rahimi, Ali Ronnqvist, Mikael LeBel, Luc Audy, Jean-Francois Univ Laval Dept Genie Mecan Quebec City PQ G1V 0A6 Canada Univ Laval Fac Foresterie Geog & Geomat Quebec City PQ G1V 0A6 Canada Univ Quebec Trois Rivieres Dept Management Trois Rivieres PQ G9A 5H7 Canada

Procurement for forest companies with pulp and paper mills aims to ensure that a sufficient volume of wood supply enters the production process. Numerous suppliers and contract types are available;however, their selection is a complex decision for procurement managers. In addition, managers typically dedicate a portion of their wood fiber demand to each group of suppliers, which is referred to as a portfolio strategy. Despite the available literature in contract selection, the consideration of contract types and their characteristics have not been addressed for the complex procurement process. In this study, a mixed-integer optimization model is proposed to best select contracts for pulp and paper procurement. The challenge was to plan deliveries in each time period to satisfy the demand of raw material at the mills. The potential of this model is demonstrated with a case study based on characteristics from a forest company in Quebec, Canada. A comparison between traditional fixed and flexible contracts is presented. Different portfolio strategies are also evaluated for groups of suppliers to investigate potential improvements.

关键词： contract selection procurement mixed-integer programming pulp and paper supplier portfolio strategy

来源：评论

学校读者我要写书评

暂无评论

Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年第3期286卷 811-827页

作者： Naderi, Bahman Roshanaei, Vahid Univ Windsor Fac Engn Dept Mech Automot & Mat Windsor ON Canada Univ Toronto Rotman Sch Management Dept Operat Management & Stat Toronto ON Canada

We model and solve an order acceptance and scheduling problem in an identical parallel machine setting. The goal is to maximize profit by making four decisions: (i) accept or reject an order, (ii) assign accepted orders to identical parallel machines, (iii) sequence accepted orders, and (iv) schedule order starting times. First, we develop a mixed-integer model that simultaneously optimizes the above four decisions. We enhance the model with pre-processing techniques, valid inequalities, and dominance rules. Second, we show that the model has a special structure that allows us to develop both classical and combinatorial Benders decomposition. We thus develop a classical Benders decomposition approach and two combinatorial Benders variants: (i) logic-based Benders decomposition and (ii) Branch-Relax-and-Check (BRC). The BRC, as the primary contribution of this paper, extends the literature in three ways: (1) it incorporates novel sequencing sub-problem relaxations that expedite convergence, (2) it employs a novel cutting-plane partitioning procedure that allows these sub-problem relaxations to be separately optimized outside the master problem, and (3) it uses temporary Benders cuts that communicate sub-problem relaxation solutions to the master problem. Third, we demonstrate that the BRC outperforms significantly other methods and finds integer feasible solutions for 100% of instances, guarantees optimality in 50% of instances, and achieves an average optimality gap of 3.20% within our time limit. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Combinatorial optimization Order acceptance identical parallel machine scheduling mixed-integer programming Benders decomposition Temporary cuts

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：