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

Computing Data-driven Multilinear Metro Maps

CARTOGRAPHIC JOURNAL 2023年第4期60卷 367-382页

作者： Noellenburg, Martin Terziadis, Soeren TU Wien Algorithms & Complex Grp Vienna Austria

Traditionally, most schematic metro maps in practice as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and 45(degrees)-diagonal edges. Despite growing interest in more general multilinear metro maps, generic algorithms to draw metro maps based on a system of k >= 2 not necessarily equidistant slopes have not been investigated thoroughly. In this paper, we present and implement an adaptation of the octolinear mixed-integer linear programming approach of N & ouml;llenburg and Wolff (2011) that can draw metro maps schematized to any set C of arbitrary orientations. We further present a data-driven approach to determine a suitable set C by either detecting the best rotation of an equidistant orientation system or by clustering the input edge orientations using a k-medians algorithm. We demonstrate the new possibilities of our method using several real-world examples.

关键词： Metro map layout C-oriented schematization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimization of Electrolyte Rebalancing in Vanadium Redox Flow Batteries

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 2022年第1期37卷 748-751页

作者： Jafari, Mehdi Sakti, Apurba Botterud, Audun MIT Lab Informat & Decis Syst LIDS 77 Massachusetts Ave Cambridge MA 02139 USA MIT MIT Energy Initiat MITEI 77 Massachusetts Ave Cambridge MA 02139 USA

This paper presents a novel algorithm to optimize energy capacity restoration of vanadium redox flow batteries (VRFBs). VRFB technologies can have their lives prolonged through a partial restoration of the lost capacity by electrolyte rebalancing. Our algorithm finds the optimal "number" and "time" of these rebalancing services to minimize the life-time service cost, while maximizing revenues from energy arbitrage. We show that the linearized form of this problem can be analytically solved, and that the objective function is convex. To solve the complete problem, we develop a two-step mixed integer linear programming (MILP) algorithm, which first finds the bounds for optimal number of services and then optimizes the number, and time of the services. We then present a theoretical analysis and optimization results for a case study of energy arbitrage in New York ISO.

关键词： Costs Electrolytes Optimization Degradation Vanadium Mathematical models Lithium-ion batteries Flow batteries degradation cycle aging capacity restoration mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An Optimal Energy Management Algorithm Considering Regenerative Braking and Renewable Energy for EV Charging in Railway Stations

An Optimal Energy Management Algorithm Considering Regenerat...

引用

IEEE-Power-and-Energy-Society General Meeting (PESGM)

作者： Pierrou, Georgia Zwirner, Yannick Hug, Gabriela ETU Zurich Power Syst Lab Dept Informat Technol & Elect Engn CH-8092 Zurich Switzerland SBB Energy CH-3000 Bern Switzerland

ISBN: (纸本)9781665464413

This paper proposes a novel optimal Energy Management System (EMS) algorithm for Electric Vehicle (EV) charging in smart electric railway stations with renewable generation. As opposed to previous railway EMS methods, the proposed EMS coordinates the combined Regenerative Braking Energy (RBE), renewable generation, electric railway demand and EV charging demand at the EV parking lot of the railway station. Numerical results using a scenario -based approach on an actual railway station in Chur, Switzerland demonstrate that the proposed algorithm can effectively minimize the expected daily operating cost for the train station over an entire year.

关键词： Terms Electric vehicles energy management railway systems regenerative braking energy renewable energy mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Sequencing and Scheduling of Airport Operations

Optimal Sequencing and Scheduling of Airport Operations

引用

AIAA Aviation Forum

作者： Chakrabarti, Sharmistha Vela, Adan E. Univ Cent Florida Ind Engn & Management Syst Orlando FL 32816 USA

ISBN: (数字)9781624107047

ISBN: (纸本)9781624107047

Air traffic controllers engage in complex and dynamic decision-making when managing an airspace. This is especially true in the immediate vicinity of an airport. Unlike in en-route or terminal area airspace where aircraft usually traverse well established routes and procedures, near the airport after completing a standard arrival procedure, the routes to the final approach are only partially defined. In this airspace (i.e., 10-12 nautical miles from the airport), the local tower controllers tactically guide aircraft through tromboning and vectoring commands to maintain separation requirements between aircraft and space them out at the runway. In this paper, a mixed-integer linear programming formulation is used to design the order-sequencing of aircraft at a single runway, by allowing vectoring and tromboning, to maximize airport throughput and minimize the distance traversed while maintaining safety. The mathematical model is formulated by time-metering aircraft at potential conflict points to avoid conflicts. With the goal of building a decision support tool that emulates the control techniques and tactical maneuvers of local tower controllers, the proposed optimization formulation generates conflict-free and safe trajectories that conform to the scheduling.

关键词： Airport Operations Runways Airspace Mathematical Models mixed integer linear programming Ronald Reagan Washington National Airport International Civil Aviation Organization Controller Pilot Communication Wake Turbulence Estimated Time of Arrival

来源：评论

学校读者我要写书评

暂无评论

A three-step framework for capacity Planning in a nursing home context

引用

HEALTH SYSTEMS 2023年第3期12卷 299-316页

作者： Dieleman, Nanne A. Buitink, Martijn Bekker, Rene Moeke, Dennis Vrije Univ Amsterdam Operat Analyt Amsterdam Netherlands Nederlandsche Bank Stat Dept Amsterdam Netherlands Vrije Univ Amsterdam Dept Math Amsterdam Netherlands HAN Univ Appl Sci Res Grp Logist & Alliances Arnhem Netherlands

This paper presents a three-step conceptual framework that can be used to structure the care-related capacity planning process in a nursing home context. The proposed framework provides a sound practical vehicle to organise client-centred care without overstretching available capacity. Within this framework, an MILP for shift scheduling and a Genetic Algorithm (GA) for task-scheduling are proposed. To investigate the performance of the proposed framework, it is benchmarked against the current situation. The results show that considerable improvements can be achieved in terms of efficiency and waiting time. More specifically, it is shown that very modest waiting times can be achieved without exceeding available capacity, despite the fluctuations in care demand across the day.

关键词： Nursing homes capacity planning framework clientcentred care mixed integer linear programming genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Route Planning and Power Management for Hybrid UAV Using A* Algorithm

Optimal Route Planning and Power Management for Hybrid UAV U...

引用

AIAA Aviation Forum

作者： Jadischke, Jacob H. Wolff, Mitch Zumberge, Jon Hencey, Brandon Ngo, Anhtuan Wright State Univ Dayton OH 45435 USA Air Force Res Lab Wright Patterson AFB OH 45433 USA

ISBN: (数字)9781624107047

ISBN: (纸本)9781624107047

For the practical application of a gas-electric hybrid UAV, algorithms are needed to synthesize joint motion and power plans that satisfy path and energy constraints. Specifically, this paper considers the problem of finding an energy-optimal flight path toward a destination under the flight path constraints and battery-only operational constraints. Standard techniques such as reinforcement learning, or Dynamic programming are computationally expensive. This paper investigates the performance of the A* algorithm on this problem to reduce the computational complexity and, by extension, the computational time. By constructing the objective as the minimization of unrecoverable energy expenditures, the A* algorithm, Dijkstra's Algorithm, and a proposed iterative A* solution, were successfully implemented for this problem. The developed optimal control policies were observed to satisfy regions with battery-only restrictions and match the total route cost through comparison to the Dynamic programming solution of the same environment. Results show that the use of the A* algorithm and Dijkstra's algorithm obtain an optimal solution of 1.64-8.85 times faster than the optimal solution obtained through Dynamic programming.

关键词： Unmanned Aerial Vehicle Optimal Control Problem Dijkstra's Algorithm Reinforcement Learning Energy Consumption Electric Power System Closed Loop Optimization Algorithm Dynamic programming Algorithm mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Mathematical Models for Order Batching and Assignment in a Deep-Frozen Warehouse 6

Mathematical Models for Order Batching and Assignment in a D...

引用

6th International Conference on Intelligent Traffic and Transportation (ICITT) / 6th International Conference on Communication and Network Technology (ICCNT)

作者： Pretolani, Daniele Chou, Xiaochen Loske, Dominic Klumpp, Matthias Montemanni, Roberto Univ Modena & Reggio Emilia Dept Sci & Methods Engn Reggio Emilia Italy Georg August Univ Gottingen Dept Business Adm Gottingen Germany

ISBN: (纸本)9781643683850

Picking operations inside a warehouse are the major share of the total costs of retailing operations. Optimization and harmonization of operations is therefore crucial in the economy of a successful business. In this paper we consider the case of a leading German grocery retailer company and we adapt to their case a mixed integer linear Program solving the order batching, assignment and pickers routing problems. Improvements to the model are also discussed, Computational experiments are finally presented, validating the different models and ranking them in terms of their applicability to real scenarios.

关键词： Warehouse optimization order batching order assignment case studies mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Study on operation strategy and load forecasting for distributed energy system based on Chinese supply-side power grid reform

引用

Energy and Built Environment 2022年第1期3卷 113-127页

作者： Canjun Li Zhengrong Li Han Zhu Zhe Tian Wei Feng School of Mechanical Engineering Tongji UniversityShanghaiChina School of Environmental Science and Engineering Tianjin UniversityTianjinChina Lawrence Berkeley National Laboratory BerkeleyCAUSA

This study focuses on the development and analysis of a real-time updated operations strategy of a distributed energy system(DES).Owing to the relevant Chinese policy of electrical transmission and distribution,combined cooling,heating,and power system(CCHP)and photovoltaic(PV)systems are not currently ***,with the Chinese supply-side power grid reform,the permissions for connections between DESs and utilities are gradually *** performing building simulation and using mixed integer linear programming(MILP),a real-time updated operation strategy of a DES is ***,considering the DES from Tianjin Eco-city as a case study,a comparative analysis between this updated strategy and the current operation strategy is performed by evaluating three factors:economic efficiency,energy consumption,and CO2 *** results show that the updated strategy can reduce 29.12%of electricity time-of-use cost,10.11%of total fuel consumption,and 18.40%of CO2 emission during the cooling ***,a method of“rolling load forecasting”for DES by using Support vector regression machine(SVR)is proposed and *** testing shows that the Mean Absolute Percentage Error(MAPE)is below 7.5%.And when the training sample is large,the particle swarm optimization algorithm can be used to shorten the modeling time of the air conditioning load forecasting model.

关键词： Distributed Energy System(DES) mixed integer linear programming Energy efficiency,Operation strategy establishment

来源：评论

学校读者我要写书评

暂无评论

MIP model-based heuristics for the minimum weighted tree reconstruction problem

引用

OPERATIONAL RESEARCH 2022年第3期22卷 2305-2342页

作者： Fajarda, Olga Requejo, Cristina Univ Aveiro Inst Elect & Informat Engn Aveiro IEETA P-3810193 Aveiro Portugal Univ Aveiro P-3810193 Aveiro Portugal

We consider the minimum weighted tree reconstruction (MWTR) problem and two matheuristic methods to obtain optimal or near-optimal solutions: the Feasibility Pump heuristic and the Local Branching heuristic. These matheuristics are based on a mixed integer programming model used to find feasible solutions. We discuss the applicability and effectiveness of the matheuristics to obtain solutions to the MWTR problem. The purpose of the MWTR problem is to find a minimum weighted tree connecting a set of leaves in such a way that the length of the path between each pair of leaves is greater than or equal to a given distance between the considered pair of leaves. The Feasibility Pump matheuristic starts with the linear programming solution, iteratively fixes the values of some variables and solves the corresponding problem until a feasible solution is achieved. The Local Branching matheuristic, in its turn, improves a feasible solution by using a local search. Computational results using two different sets of instances, one from the phylogenetic area and another from the telecommunications area, show that these matheuristics are quite effective in finding feasible solutions and present small gap values. Each matheuristic can be used independently;however, the best results are obtained when used together. For instances of the problem having up to 17 leaves, the feasible solution obtained by the Feasibility Pump heuristic is improved by the Local Branching heuristic. Noticeably, when comparing with existing based models processes that solve instances having up to 15 leaves, this achievement of the matheuristic increases the size of solved instances.

关键词： Feasibility pump Local branching mixed integer linear programming Matheuristics Tree realization Topology discovery Routing topology inference Minimum evolution problem Balanced minimum evolution problem

来源：评论

学校读者我要写书评

暂无评论

An Optimization Model and Decision Support System of Operating Room Scheduling in a Teaching Hospital

JOURNAL OF APPLIED SCIENCE AND ENGINEERING

引用

JOURNAL OF APPLIED SCIENCE AND ENGINEERING 2022年第5期25卷 731-739页

作者： Meliana, Innaka Rizki Purwoko, Pasca Aisyati, Azizah Priyandari, Yusuf Rosyidi, Cucuk Nur Univ Sebelas Maret Ind Engn Dept Surakarta Indonesia

Department of Surgery (DOS) contributes to a major portion of hospital's expenditures and revenues. The costs come from resources which are involved in a surgery. These resources must be used optimally through proper scheduling. Recently, there are still many hospitals schedule the operating rooms manually which will take relatively longer time. Whereas the scheduling of the operating room can be done through developing a mathematical model. We consider several aspects in the model of this research, including the number of operating rooms, working hours, the available number of anesthetic machines, and utilization of each room. We propose a mixed integer linear programming (MILP) model to solve the operating room scheduling problem and based on the model, a decision support system (DSS) is developed to allow the hospital generates a better schedule with a shorter time. The results of sensitivity shows that the model is sensitive to the changes of surgery duration and the available number of anesthetic machines.

关键词： Decision support system mixed integer linear programming Operating rooms Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：