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

Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations

COMPUTERS & OPERATIONS RESEARCH 2024年 167卷

作者： Elidrissi, Abdelhak Benmansour, Rachid Hasani, Keramat Werner, Frank Int Univ Rabat Rabat Business Sch Rabat Morocco Inst Natl Stat & Econ Appl INSEA Rabat Morocco Natl Univ Singapore Dept Ind Syst Engn & Management Singapore Singapore Otto Von Guericke Univ Fak Math PSF 4120 D-39016 Magdeburg Germany

This paper addresses the scheduling problem on two identical parallel machines with a single server in charge of loading and unloading operations of jobs. Each job has to be loaded by the server before being processed on one of the two machines and unloaded by the same server after its processing. No delay is allowed between loading and processing, and between processing and unloading. The objective function involves the minimization of the makespan. This problem referred to as P2, S1 vertical bar s(j), t(j)vertical bar C-max generalizes the classical parallel machine scheduling problem with a single server which performs only the loading (i.e., setup) operation of each job. For this NP-hard problem, no solution algorithm was proposed in the literature. Therefore, we present two mixed-integer linear programming (MILP) formulations, one with completion-time variables along with two valid inequalities and one with time-indexed variables. In addition, we propose some polynomial-time solvable cases and a tight theoretical lower bound. We also show that the minimization of the makespan is equivalent to the minimization of the total idle-times on the machines. To solve large-sized instances of the problem, an efficient General Variable Neighborhood Search (GVNS) metaheuristic with two mechanisms for finding an initial solution is designed. The GVNS is evaluated by comparing its performance with the results provided by the MILPs and another metaheuristic. The results show that the average percentage deviation from the theoretical lower bound of GVNS is within 0.642%. We finally compare our approaches with the related literature.

关键词： Parallel machine scheduling Single server Loading operations Unloading operations mixed-integer linear program General variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

Analysis of rebound effect modelling for flexible electrical consumers ⁎

引用

IFAC-PapersOnLine 2019年第4期52卷 6-11页

作者： Giulia De Zotti Daniela Guericke S. Ali Pourmousavi Juan Miguel Morales Henrik Madsen Niels Kjølstad Poulsen Department of Applied Mathematics and Computer Science Technical University of Denmark Kgs.Lyngby Denmark The University of Queensland St. Lucia Australia University of Malaga Spain

Demand response (DR) will be an inevitable part of the future power system operation to compensate for stochastic variations of the ever-increasing renewable generation. A solution to achieve DR is to broadcast dynamic prices to customers at the edge of the grid. However, appropriate models are needed to estimate the potential flexibility of different types of consumers for day-ahead and real-time ancillary services provision, while accounting for the rebound effect (RE). In this study, two RE models are presented and compared to investigate the behaviour of flexible electrical consumers and quantify the aggregate flexibility provided. The stochastic nature of consumers’ price response is also considered in this study using chance-constrained (CC) programming.

关键词： Rebound effect Flexible consumers mixed-integer linear program Chanced-constrained programming Demand response dynamic prices

来源：评论

学校读者我要写书评

暂无评论

Estimating lower probability bound of power system's capability to fully accommodate variable wind generation

引用

JOURNAL OF ENGINEERING-JOE 2019年第16期2019卷 1011-1015页

作者： Liu, Bin Zhai, Bingxu Liu, Mengchen Liu, Feng Lan, Haibo Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia State Grid Corp China Jibei Elect Power Dispatching & Control Ctr Beijing 100053 Peoples R China Goldwind Australia Pty Ltd Dept Grid Connect Sydney NSW 2000 Australia Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

As the penetration of wind generation increases, the uncertainty it brings has imposed great challenges to power system operation. To cope with the challenges, tremendous research work has been conducted, among which two aspects are of most importance, that is, making immune operation strategies and accessing the power system's capability to accommodate the variable energy. Driven and inspired by the latter problem, this paper will discuss the power system's capability to accommodate variable wind generation in a probability sense. Wind generation, along with its uncertainty is illustrated by a polyhedron, which contains prediction, risk, and uncertainty information. Then, a three-level optimisation problem is presented to estimate the lower probability bound of power system's capability to fully accommodate wind generation. After reformulating the inner max-min problem, or feasibility check problem, into its equivalent mixed-integer linear program (MILP) form, the bisection algorithm is presented to solve this challenging problem. Modified IEEE systems are adopted to show the effectiveness of the proposed method.

关键词： probability wind power plants integer programming linear programming variable wind generation wind generation increases power system operation lower probability bound estmation immune operation strategies power system capability polyhedron three-level optimisation problem max-min problem mixed-integer linear program MILP bisection algorithm modified IEEE systems

来源：评论

学校读者我要写书评

暂无评论

The maximal covering location problem with accessibility indicators

引用

SOCIO-ECONOMIC PLANNING SCIENCES 2020年 71卷 100758-100758页

作者： Ibarra-Rojas, O. J. Ozuna, L. Lopez-Pinon, D. Univ Autonoma Nuevo Leon Fac Ciencias Fis Matemat San Nicolas De Los Garza Nuevo Leon Mexico Univ Autonoma Nuevo Leon Fac Ingn Mecan & Elect San Nicolas De Los Garza Nuevo Leon Mexico Univ Autonoma Nuevo Leon Ctr Desarrollo Empresarial & Posgrad FACPYA San Nicolas De Los Garza Nuevo Leon Mexico

Maximal covering location problems have been widely studied, due to the practical applications of their solutions in real-life scenarios where it is not possible to fulfill the total demand. For example, these solutions can be used to provide humanitarian relief or to allocate fire stations, hospitals, and commercial services. However, coverage is commonly based on the ability of clients to reach the facilities or on the ability of facilities to serve clients within a reasonable area (or radius) or in a limited service time. In this study, we assume that facilities have a limited service area, while people in demand centroids have a degree of mobility encompassing a reasonable travel distance to look for their demand. Based on the latter assumption, we define a maximum covering location problem that optimizes an accessibility measure. This is a weighted sum of accessibility indicators based on the coverage of demand centroids, the number of demand centroids with access to opportunities within their mobility radius, the number and location of opportunities, a travel cost function, and spatial disaggregation. We formulate our optimization problem through a mixed-integer linear program; an experimental stage on randomly-generated instances shows that a commercial solver is capable of obtaining near-optimal solutions in reasonable computational times for large instances. In addition, we use data from an economically-deprived region in Mexico to perform a sensitivity analysis for different service and mobility radii. Finally, we implement the linear Best Worst Method to obtain the value of weights parameters representing subjective preferences for different indicators of accessibility.

关键词： Coverage location problem Accessibility mixed-integer linear program linear best-worst method

来源：评论

学校读者我要写书评

暂无评论

The maximal covering location problem with accessibility indicators and mobile units

引用

SOCIO-ECONOMIC PLANNING SCIENCES 2023年第PartB期87卷

作者： Vicencio-Medina, Salvador J. Rios-Solis, Yasmin A. Ibarra-Rojas, Omar Jorge Cid-Garcia, Nestor M. Rios-Solis, Leonardo Tecnol Monterrey Sch Engn & Sci Ave Eugenio Garza Sada 2501 Monterrey 64849 NL Mexico Univ Autonoma Nuevo Leon Fac Ciencias Fisico Matemat San Nicolas De Los Garza 66455 Nuevo Leon Mexico CONACYT Ctr Invest Ciencias Informac Geoespacial Lab Nacl Geointeligencia Aguascalientes Aguascalientes Mexico Univ Edinburgh Inst Bioengn Sch Engn Edinburgh EH9 3BF Scotland Univ Edinburgh Ctr Synthet & Syst Biol SynthSys Edinburgh EH9 3BF Scotland Newcastle Univ Sch Nat & Environm Sci Mol Biol & Biotechnol Newcastle Upon Tyne NE1 7RU England

We study the Maximal Covering Location Problem with Accessibility Indicators and Mobile Units that maximizes the facilities coverage, the accessibility of the zones to the open facilities, and the spatial disaggregation. The main characteristic of our problem is that mobile units can be deployed from open facilities to extend the coverage, accessibility, and opportunities for the inhabitants of the different demand zones. We formulate the Maximal Covering Location Problem with Accessibility Indicators and Mobile Units as a mixed-integer linear programming model. To solve larger instances, we propose a matheuristic (combination of exact and heuristic methods) composed of an Estimation of Distribution Algorithm and a parameterized Maximal Covering Location Problem with Accessibility Indicators and Mobile Units integer model. To test our methodology, we consider the Maximal Covering Location Problem with Accessibility Indicators and Mobile Units model to cover the low-income zones with Severe Acute Respiratory Syndrome Coronavirus 2 patients. Using official databases, we made a set of instances where we considered the poverty index, number of population, locations of hospitals, and Severe Acute Respiratory Syndrome Coronavirus 2 patients. The experimental results show the efficiency of our methodologies. Compared to the case without mobile units, we drastically improve the coverage and accessibility for the inhabitants of the demand zones.

关键词： Facility location problem Matheuristic COVID-19 mixed-integer linear program Accessibility Estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

An Equilibrium Model of Power System with Peer-to-Peer Energy Transaction

An Equilibrium Model of Power System with Peer-to-Peer Energ...

引用

第40届中国控制会议

作者： Dong Pan Yuguang Xie Boshen Zheng Wei Wei Shengwei Mei State Grid Anhui Electric Power CO. LTD. State Grid Anhui Electric Power Research Institute State Key Laboratory of Power Systems Department of Electrical EngineeringTsinghua University

The technology advancement and cost decline of renewable and sustainable energy increase the penetration of distribution energy resources(DERs) in power ***-to-Peer(P2P) market is a typical energy transaction scheme in the smart *** a P2P market,a peer can share his surplus energy with local *** a market mechanism can increase the revenue of DERs owners and reduce consumers' energy cost.P2P transaction has attracted wide attention from *** paper proposes an equilibrium framework to model P2P energy transaction at multiple *** structure of the market is given and stakeholders' optimal function is formulated as the joint Karush-Kuhn-Tucker(KKT) conditions of the optimization problems of individual participants,which can be further solved via a mixed-integer linear program(MILP).The energy flow is further embedded in the optimal power flow problem to ensure network operating ***,case study demonstrates that our proposed P2P market benefits all participants.

关键词： Equilibrium mixed-integer linear program peer-to-peer energy trading transactive energy

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Model for Strategic Generation Expansion Planning

A Mathematical Model for Strategic Generation Expansion Plan...

引用

IEEE Power and Energy Society General Meeting

作者： Yaser Tohidi Mohammad Reza Hesamzadeh Electricity Market Research Group KTH Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)9781509041695

This paper proposes a mathematical model for strategic generation expansion planning problem. The model is developed based on the simultaneous-move game between Gencos. Gencos investment decisions are passed to the dispatch center which decides about the production level in operating scenarios considered. Using Karush-Kuhn-Tucker conditions (KKTs) and disjunctive linearization, the model is formulated as a mixed-integer linear program (MILP). The concepts of worst Nash equilibrium (WNE) and best Nash equilibrium (BNE) are introduced to handle multiple NE problem. The impact of uncertainty (scenarios) on equilibria band, i.e., the difference between WNE and BNE is discussed. The developed model is simulated on illustrative 2-node and 3-node example systems and also on IEEE-RTS96 test system.

关键词： mixed-integer linear program Nash equilibrium Generation planning

来源：评论

学校读者我要写书评

暂无评论

Analyzing the delivery determination problem of new retail stores considering crowdsourcing under the background of blockchain

引用

RESEARCH IN TRANSPORTATION BUSINESS AND MANAGEMENT 2024年 52卷

作者： Li, Yue Zhao, Jianyou Chen, Zenghua Changan Univ Sch Automobile Xian 710061 Peoples R China Chinese Acad Sci Inst Automat State Key Lab Management & Control Complex Syst Beijing 310013 Peoples R China

The parcel delivery industry is experiencing rapid growth due to the rise of new retail stores. However, the traditional self-operated delivery model often leads to idle and wasteful distribution resources due to uneven temporal and spatial distribution of delivery orders. In this study, we propose a delivery system that combines crowdsourcing and self-operated delivery for new retail stores using blockchain technology to optimize the delivery algorithm. Our proposed system solves the problem of wasted resources by introducing crowdsourcing delivery and completes the distribution task allocation on a blockchain platform to protect customer privacy and quantify the performance of crowdsourcing couriers. We present a mixed-integer nonlinear programming formulation for the 2-Echelon Winning Determination Problem, in which the delivery decision is based on the lowest total cost. The cost of crowdsourcing delivery is a dynamic cost comprising of crowdsourcing courier service errors and bid prices recorded on the tamper-evident blockchain system. We also analyzed the impact of different crowdsourcing bidding prices on the choice of delivery method and total cost. Synthetic experiments show that our proposed hybrid delivery model ensures high-quality and efficient delivery of new retail stores while saving delivery costs.

关键词： Transportation and logistics Blockchain Crowdsourcing and self-operated delivery system 2-Echelon winning determination problem Vehicle routing problem mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：