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

Global planning in a multi-terminal and multi-modal maritime container port

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2017年 100卷 38-62页

作者： Schepler, Xavier Balev, Stefan Michel, Sophie Sanlaville, Eric Ecole Mines St Etienne LIMOS UMR CNRS 6158 St Etienne France Normandie Univ UNIHAVRE UNIROUEN INSA RouenLITIS F-76600 Le Havre France Normandie Univ UNIHAVRE LMAH F-76600 Le Havre France

This paper introduces an optimization model of a multi-terminal, multi-modal maritime container port, such as the ones in the European northern range. The decisions concern the scheduling of ships, trains and trucks on terminals, while limiting inter-terminal transport of containers and minimizing weighted turnaround time. Heuristics based on the decomposition of the resulting mixed-integer program are proposed and tested on realistic generated instances with up to four terminals. The efficiency of the restrict-and-fix heuristic allows to investigate the impact of a global management on port's performance: an average improvement of 5% was observed. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Maritime container port management Multi-terminal optimization mixed-integer programming Structural decomposition mixed-integer programming based heuristic

来源：评论

学校读者我要写书评

暂无评论

Bi-criteria single-machine batch scheduling with machine on/off switching under time-of-use tariffs

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2017年 112卷 721-734页

作者： Cheng, Junheng Chu, Feng Liu, Ming Wu, Peng Xia, Weili Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China Univ Evry Val dEssonne Lab IBISC F-91020 Evry France Xihua Univ Management Engn Res Ctr Chengdu 610039 Sichuan Peoples R China Tongji Univ Sch Econ & Management Shanghai 710049 Peoples R China Fuzhou Univ Sch Econ & Management Fuzhou 350116 Fujian Peoples R China

The industrial sector is the largest consumer of the world's total energy and most of its consumption is in form of electricity. In recent years, to strengthen the peak load regulation capability, time-of-use (TOU) pricing has been implemented in many countries to encourage consumers to shift their use from peak to mid- and off-peak periods such that their energy bills can be reduced. In this paper, we study a new single-machine batch scheduling problem with machine on/off switching under TOU tariffs, which aims to simultaneously minimize total electricity cost and makespan. For the problem, we first develop a bi-objective mixed-integer linear programming model. Based on optimal batch rule analysis, an improved model is further provided which greatly reduces Pareto optimal solution search space. To efficiently solve large-size problems, we propose a heuristic based epsilon-constraint method. The results from extensive computational experiments confirm the effectiveness and efficiency of the proposed model and the algorithm. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Single-machine batch scheduling Time-of-use tariffs Bi-criteria optimization mixed-integer programming Heuristic

来源：评论

学校读者我要写书评

暂无评论

Analyzing tax incentives for producing renewable energy by biomass cofiring

引用

IISE TRANSACTIONS 2018年第4期50卷 332-344页

作者： Karimi, Hadi Eksioglu, Sandra Duni Khademi, Amin Clemson Univ Dept Ind Engn Clemson SC 29634 USA

This article examines the impacts of governmental incentives for coal-fired power plants to generate renewable energy via biomass cofiring technology. The most common incentive is the Production Tax Credit (PTC), a flat-rate reimbursement for each unit of renewable energy generated. The work presented here proposes PTC alternatives, incentives that are functions of plant capacity and the biomass cofiring ratio. The capacity-based incentives favor plants of small capacity, whereas the ratio-based incentives favor plants that cofire larger percentages of biomass. Following a resource allocation perspective, this article evaluates the impacts of alternative PTC schemes on biomass utilization and power plants' profit-earning potentials. The efficiency of these incentive schemes is evaluated by comparing with a reference profit optimization model that finds a distribution of credits that maximizes the total profits in the system. To evaluate the fairness of the proposed schemes, the results of the max-min fairness solution are used as a basis. A realistic case study, developed with data pertaining to the southeastern. United States, suggests how total system costs and efforts to generate renewable energy are impacted by both the existing and proposed incentives. The observations presented in this study provide helpful insights to policymakers in designing effective incentive schemes that promote biomass cofiring.

关键词： Biomass cofiring renewable energy production mixed-integer programming resource allocation production tax credit

来源：评论

学校读者我要写书评

暂无评论

An efficient Ant Colony algorithm based on wake-vortex modeling method for aircraft scheduling problem

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2017年 317卷 157-170页

作者： Xu, Bo Univ Shanghai Sci & Technol Sch Business Shanghai 200093 Peoples R China

The aircraft scheduling problem (ASP) is a salient problem in airport runway scheduling system. This paper originally proposes an Ant Colony (AC) algorithm based on the wake vortex modeling (WVM) method for ASP. Numerical results validate that this new method has better performance than CPLEX, general AC algorithm, and approximation algorithm in Ma et al. (2014). It is a promising method to improve the efficiency of the aircraft scheduling system from a theoretical standpoint. (c) 2016 Elsevier B.V. All rights reserved.

关键词： Aircraft scheduling problem WVM Rank 2 matrix approximation mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities

引用

INFORMS JOURNAL ON COMPUTING 2017年第3期29卷 388-404页

作者： Jena, Sanjay Dominik Cordeau, Jean-Francois Gendron, Bernard Univ Montreal CIRRELT Montreal PQ H3C 3J7 Canada Univ Montreal Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada HEC Montreal CIRRELT Montreal PQ H3T 2A7 Canada HEC Montreal Canada Res Chair Logist & Transportat Montreal PQ H3T 2A7 Canada

We consider the dynamic facility location problem with generalized modular capacities, a multiperiod facility location problem in which the costs for capacity changes may differ for all pairs of capacity levels. The problem embeds a complex cost structure and generalizes several existing facility location problems, such as those that allow temporary facility closing or capacity expansion and reduction. As the model may become very large, general-purpose mixed-integer programming (MIP) solvers are limited to solving instances of small to medium size. In this paper, we extend the generalized model to the case of multiple commodities. We propose Lagrangian heuristics, based on subgradient and bundle methods, to find good quality solutions for large-scale instances with up to 250 facility locations and 1,000 customers. To improve the final solution quality, a restricted MIP model is solved based on the information collected through the solution of the Lagrangian dual. Computational results show that the Lagrangian-based heuristics provide highly reliable results for all problem variants considered. They produce good quality solutions in short computing times even for instances where state-of-the-art MIP solvers do not find feasible solutions. The strength of the formulation also allows the method to provide tight bounds on the optimal value.

关键词： dynamic facility location modular capacities Lagrangian heuristics mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

MILP models for the selection of a small set of well-distributed points

引用

OPERATIONS RESEARCH LETTERS 2017年第1期45卷 46-52页

作者： D'Ambrosio, Claudia Nannicini, Giacomo Sartor, Giorgio Ecole Polytech CNRS LIX UMR7161 Palaiseau France IBM TJ Watson Yorktown Hts NY USA Singapore Univ Technol & Design ESD Singapore Singapore

Motivated by the problem of fitting a surrogate model to a set of feasible points in the context of constrained derivative-free optimization, we consider the problem of selecting a small set of points with good space-filling and orthogonality properties from a larger set of feasible points. We propose four mixed-integer linear programming models for this task and we show that the corresponding optimization problems are NP-hard. Numerical experiments show that our models consistently yield well-distributed points that, on average, help reducing the variance of model fitting errors. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Model fitting mixed-integer programming Derivative-free optimization Experimental design

来源：评论

学校读者我要写书评

暂无评论

A mixed-integer optimization approach for homogeneous magnet design

引用

TECHNOLOGY 2018年第2期6卷 49-58页

作者： Dayarian, Iman Chan, Timothy C. Y. Jaffray, David Stanescu, Teo Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada Techna Inst 124-100 Coll St Toronto ON M5G 1L5 Canada Univ Hlth Network Princess Margaret Canc Ctr Toronto ON M5G 2M9 Canada Univ Toronto Dept Radiat Oncol Toronto ON M5S 3E2 Canada

Magnetic resonance imaging (MRI) is a powerful diagnostic tool that has become the imaging modality of choice for soft-tissue visualization in radiation therapy. Emerging technologies aim to integrate MRI with a medical linear accelerator to form novel cancer therapy systems (MR-linac), but the design of these systems to date relies on heuristic procedures. This paper develops an exact, optimization-based approach for magnet design that 1) incorporates the most accurate physics calculations to date, 2) determines precisely the relative spatial location, size, and current magnitude of the magnetic coils, 3) guarantees field homogeneity inside the imaging volume, 4) produces configurations that satisfy, for the first time, small-footprint feasibility constraints required for MR-linacs. Our approach leverages modern mixed-integer programming (MIP), enabling significant flexibility in magnet design generation, e.g., controlling the number of coils and enforcing symmetry between magnet poles. Our numerical results demonstrate the superiority of our method versus current mainstream methods.

关键词： Magnetic Resonance Imaging MRI Magnet Design Optimization Method mixed-integer programming Linear programming MR-Guided Radiation Therapy

来源：评论

学校读者我要写书评

暂无评论

Optimizing global thermal coal shipments

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2017年 72卷 118-127页

作者： Arigoni, Ashley Newman, Alexandra Turner, Cameron Kaptur, Casey Colorado Sch Mines Dept Mech Engn 1500 Illinois St Golden CO 80401 USA Clemson Univ Dept Mech Engn 206 Fluor Daniel EIB Clemson SC USA RungePincockMinarco 500 S Union Blvd Lakewood CO USA

Thermal coal is used to produce energy;with changing emissions standards and advents in renewable technology, the thermal coal market has seen significant transformation over the past decade. We develop a mixed-integer optimization problem that seeks to minimize shipment costs while meeting demand for thermal coal, and which respects quality constraints, supply limits, and port capacity;we use this model to analyze the following scenarios: (i) a counterfactual setting in which we compare historical shipping patterns to model results using a 2012 base year;(ii) the explicit effect of Chinese mandates on coal shipments;(iii) the impact on our shipping patterns of reduced Chinese and Indian demand;(iv) the effects of the Baltic Dry Index and oil prices;and (v) a comparison of shipments prior and subsequent to Panama Canal expansion. Our work can be used to inform policy, study responses to variable price and demand scenarios, and provide insight to both coal producers and consumers about the international coal market. For example, removal of mandates set by the Chinese government to fill its own demand decreases coal flows from Northern to Southern China by 56%, which has a spill-over effect on European and American markets;and, expansion of the Panama Canal leads to only modest shipping increases through the canal (6.7%), with more coal originating from Colombia serving Asian demand. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Thermal coal Blending Commodity Shipping mixed-integer programming Underlying network structure

来源：评论

学校读者我要写书评

暂无评论

PATH COVER AND PATH PACK INEQUALITIES FOR THE CAPACITATED FIXED-CHARGE NETWORK FLOW PROBLEM

引用

SIAM JOURNAL ON OPTIMIZATION 2017年第3期27卷 1943-1976页

作者： Atamturk, Alper Kucukyavuz, Simge Tezel, Birce Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Univ Washington Dept Ind & Syst Engn Seattle WA 98195 USA

Capacitated fixed-charge network flows are used to model a variety of problems in telecommunication, facility location, production planning, and supply chain management. In this paper, we investigate capacitated path substructures and derive strong and easy-to-compute path cover and path pack inequalities. These inequalities are based on an explicit characterization of the submodular inequalities through a fast computation of parametric minimum cuts on a path, and they generalize the well-known flow cover and flow pack inequalities for the single-node relaxations of fixed-charge flow models. We provide necessary and sufficient facet conditions. Computational results demonstrate the effectiveness of the inequalities when used as cuts in a branch-and-cut algorithm.

关键词： valid inequalities submodular functions covers and packs fixed-charge networks mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints

引用

COMPUTERS & OPERATIONS RESEARCH 2017年 86卷 86-93页

作者： Gendron, Bernard Khuong, Paul-Virak Semet, Frederic Univ Montreal CIRRELT Interuniv Res Ctr Enterprise Networks Logist & Tr Dept Informat & Rech Operat CP 6128Succ Ctr Ville Montreal PQ H3C 3J7 Canada Univ Lille CNRS Cent Lille Inria UMR 9189CRIStAL Ctr Rech Informat Signal & F-59000 Lille France

We consider the two-level uncapacitated facility location problem with single assignment constraints (TUFLP-S), an extension of the uncapacitated facility location problem. We present six mixed-integer programming models for the TUFLP-S based on reformulation techniques and on the relaxation of the integrality of some of the variables associated with location decisions. We compare the models by carrying out extensive computational experiments on large, hard, artificial instances, as well as on instances derived from an industrial application in freight transportation. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Two-level uncapacitated facility location mixed-integer programming Relaxations Formulations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：