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

AIAA SciTech Forum

作者： Choi, Euihyeon Ahn, Jaemyung Korea Adv Inst Sci & Technol KAIST Dept Aerosp Engn 291 Daehak Ro Daejeon 34141 South Korea

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

This paper discusses a routing problem for planetary surface exploration with precedence constraints. In missions such as in-situ resource utilization (ISRU), exploration sites can be categorized into resource supply and consumption sites, and resource supply sites should be visited before consumption sites. The mathematical formulation of the proposed problem is defined as the vehicle routing problem with precedence constraints (VRPPC) and considers only pure precedence constraints without any complex constraints, such as time windows. Additionally, we employ a technique called feasible column generation to reduce the computation time of VRPPC and demonstrate its efficiency through numerical analysis in various cases.

关键词： In Situ Resource Utilization Planetary Surface Exploration Numerical Analysis Extravehicular Activity Aerospace Engineering Fuel Consumption National Aeronautics and Space Administration mixed integer linear programming C programming language linear programming

来源：评论

学校读者我要写书评

暂无评论

Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem

Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depo...

引用

AIAA SciTech Forum

作者： Kumar, Deepak Prakash Rathinam, Sivakumar Darbha, Swaroop Bihl, Trevor Texas A&M Univ Mech Engn 3123 TAMU College Stn TX 77843 USA Air Force Res Lab Sensing Management Branch Dayton OH 45433 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

In this article, a heuristic is proposed for a min-max heterogeneous multi-vehicle multi-depot traveling salesman problem (TSP), wherein heterogeneous vehicles start from given depot positions and need to cover a given set of targets. The vehicles should cover given targets such that the maximum tour time is minimized. In the considered problem, vehicles considered can be functionally heterogeneous, wherein specific targets must be covered by a particular vehicle, structurally heterogeneous, wherein the vehicles can travel at different speeds, or both. The proposed heuristic generalizes the MD heuristic for the min-max homogeneous multi-vehicle multi-depot TSP and has three stages: an initialization stage to generate a feasible solution, a local search stage in which the vehicle with the maximum tour time is improved, and a perturbation stage to break from a local minimum. The proposed heuristic is benchmarked with the optimal solution obtained by solving a mixed integer linear program using branch and cut for instances considering three vehicles covering thirty targets. Variations in the percentage of vehicle-target assignments and the number of vehicles starting at the same depot are studied to show the heuristic's effectiveness in producing high-quality solutions. It was observed that the heuristic generated feasible solutions within 4% of the optimum on average for the considered instances.

关键词： mixed integer linear programming Python Memetic Algorithm linear programming

来源：评论

学校读者我要写书评

暂无评论

The Trading Strategy of Distributed Energy Storage Participating in Energy and Frequency Modulation Market 7

The Trading Strategy of Distributed Energy Storage Participa...

引用

7th International Conference on Energy, Electrical and Power Engineering (CEEPE)

作者： Xu, Jing Fu, Zhixin Wang, Chunyi Liu, Haoming Hohai Univ Sch Elect & Power Engn Nanjing Peoples R China State Grid Shandong Elect Power Co Jinan Peoples R China

ISBN: (纸本)9798350375794;9798350375800

With the deepening reform of the electricity market in China, the study focuses on incentivizing distributed energy storage to provide frequency modulation ancillary services to the power system through market-based mechanisms. The research investigates the transaction decision-making of distributed energy storage in the energy and frequency modulation ancillary services market. An overall trading framework for the energy and frequency modulation ancillary services market is proposed. A bi-level decision model is developed, considering both maximizing the revenue of distributed energy storage and minimizing system costs. A hybrid integer linear programming equilibrium solution algorithm is designed based on duality theory and KKT conditions conversion. The effectiveness of the proposed model is verified through case analysis. The results demonstrate that the revenue from distributed energy storage accounts for more than 50% of the total revenue in the frequency modulation market, and strategic bidding by distributed energy storage can increase its revenue.

关键词： distributed energy storage energy market frequency modulation ancillary service market trading decision mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multi-Use Operation of Aggregated Battery Energy Storage Systems

Multi-Use Operation of Aggregated Battery Energy Storage Sys...

引用

International Conference on Smart Energy Systems and Technologies (SEST) - Driving the Advances for Future Electrification

作者： Schmidtke, Florian Ernst, Constantin Kortmann, Steffen Jeup, Johannes Ulbig, Andreas Rhein Westfal TH Aachen IAEW Aachen Germany Fraunhofer FIT Digital Energy Aachen Germany

ISBN: (纸本)9798350386509;9798350386493

This paper introduces a multi-use operation algorithm for aggregated battery energy storage systems (BESSs). The primary focus of this research is to coordinate dispatches for small and medium-scale BESSs in multi-use applications. The coordination involves dynamically allocating power for various single-use applications, leading to time-based conflicts. To address these challenges, a receding horizon control algorithm, ensuring effective management and coordination of the BESSs, is proposed. Additionally, an information architecture to support the implementation, connecting stakeholders and behind-themeter assets, is designed. The conceptual model is evaluated, and through a case study, findings are validated. The results presented in this paper prove the dynamic stacking of four applications, maximizing BESS utilization.

关键词： Multi-use Aggregation Battery energy storage system Flexibility mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

WEEE Flow for Magnets 43rd

WEEE Flow for Magnets

引用

43rd IFIP WG 5.7 International Conference on Advances in Production Management Systems (APMS)

作者： Bitsis, Kyriakos Spanos, Alexandros Kaparis, Konstantinos Zois, Georgios Univ Macedonia Dept Business Adm Quantitat Methods & Decis Anal Lab Thessaloniki 54636 Greece Athens Univ Econ & Business Dept Management Sci & Technol ELTRUN Res Lab Athens 10434 Greece

ISBN: (纸本)9783031716249;9783031716225;9783031716218

The recovery of Waste from Electrical and Electronic Equipment (WEEE) poses a significant challenge in the realm of solid waste management. With the global urgency to develop innovative disposal methods for WEEE, the creation of value chains that facilitate the recovery of valuable secondary raw materials is crucial. This paper explores a value network formulated specifically for the recovery and reuse of magnets from WEEE. To this direction, we introduce a holistic mixed integer linear programming (MILP) model, capable to optimise the material flows and the total cost incurred within the value network. Interestingly, our model integrates the proposed policies and directives of the European Commission (EC), aiming to devise a strategy that efficiently blends secondary and virgin magnetic materials to minimize total energy costs. We validate our modeling approach through a set of computational results, applying sensitivity analysis to assess the robustness of the proposed solutions under specific fluctuations in the energy cost. We conclude with the introduction of a two-stage stochastic model that extends the deterministic framework of the MILP, offering broader applicability and resilience in planning.

关键词： WEEE Permanent magnets mixed integer linear programming Network flow Circularity

来源：评论

学校读者我要写书评

暂无评论

Shared Backup Path Protection with QoT Guarantee in Elastic Optical Networks 14

Shared Backup Path Protection with QoT Guarantee in Elastic ...

引用

14th International Workshop on Resilient Networks Design and Modeling

作者： Chebolu, Venkatesh Savva, Giannis Ellinas, Georgios Univ Cyprus KIOS Res & Innovat Ctr Excellence CY-1678 Nicosia Cyprus Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

ISBN: (纸本)9798331518189;9798331518196

Shared backup path protection (SBPP) mechanisms can be utilized to effectively protect elastic optical networks (EONs) against any single link failures, offering numerous advantages over other protection techniques. However, maintaining the quality-of-transmission (QoT) in EONs after the recovery process in the presence of physical layer impairments is a complex task, mainly due to the different interference patterns that appear when different links fail. To address this issue in SBPP-based EONs, this work proposes a mixed integer linear program (MILP) where candidate working paths are pre-computed in a pre-processing step, while the backup paths for each demand are computed within the MILP. The proposed MILP ensures that the QoT remains above a predetermined threshold in both the working and backup paths of each demand, for both the normal and single link failure operation scenarios.

关键词： Shared backup path protection link failure quality of transmission elastic optical networks mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Trolley Optimisation for Loading Printed Circuit Board Components

引用

Operations Research Forum 2024年第3期5卷 72页

作者： Chauhan, Vinod Kumar Bass, Mark Parlikad, Ajith Kumar Brintrup, Alexandra Department of Engineering University of Cambridge Cambridge United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Rolls-Royce Headquarters Kings Place90 York Way London United Kingdom

A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an NP-complete problem. A case study of an aerospace manufacturing company is used to illustrate the TOP which successfully automated the manual process in the company and resulted in significant cost reductions and flexibility in the building process. © The Author(s) 2024.

关键词： Manufacturing mixed integer linear programming Printed circuit board The bin packing problem Trolley optimisation

来源：评论

学校读者我要写书评

暂无评论

An uncertain sustainable supply chain network design for regulating greenhouse gas emission and supply chain cost

引用

CLEANER LOGISTICS AND SUPPLY CHAIN 2024年 10卷

作者： Kumar, Amit Kumar, Kaushal Univ Delhi Fac Math Sci Dept Operat Res Delhi India

The increasing global concern for sustainability in supply chain management is driven by stricter government regulations addressing environmental pollution and social injustice. This has led to a growing emphasis on integrating sustainability into supply chain practices. However, there is limited research on incorporating all three dimensions of sustainability (economic, environmental, and social) into supply chain management. This study presents a mixed-integer linear programming model for designing an uncertain supply chain network design that aims to minimize overall costs (establishment, production, and transportation/routing costs) while considering carbon emissions and a few social factors simultaneously. The study considers sustainable aspects of decision-making process and utilizes chance-constrained programming to address uncertainties. The proposed model attempts to maintain balanced flow levels across all stages of the network, optimizing the utilization of raw materials and production. The proposed optimization model is a cost minimization model that also tries to minimize greenhouse gas emissions throughout the entire network. A greedy based heuristic is provided for dealing with larger instances of the given decision making problem. Additionally, sensitivity analysis has also been carried out to explore the impact of various parameters involved.

关键词： Sustainable supply chain management Supply chain network design Greenhouse gas emission Chance -constrained programming mixed integer linear programming Greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Strategic Conflict Management Algorithm for AAM Using Cell-Based Demand Capacity Balancing

Strategic Conflict Management Algorithm for AAM Using Cell-B...

引用

AIAA SciTech Forum

作者： Yokoyama, Nobuhiro Japan Aerosp Explorat Agcy Aeronaut Technol Directorate Tokyo 1810015 Japan

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

Strategic conflict management is expected to be essential from the initial to mature phases of the practical implementation of advanced air mobility (AAM) operations. In the pre-flight phase of AAM, because the scheduled takeoff time and flight duration include significant uncertainties, demand capacity balancing (DCB), which takes into account both uncertainty and conflict prevention, has been considered effective. Thus, this study presents a candidate algorithm for strategic conflict management using DCB to address the uncertainty in fourdimensional flight plans of AAM and adjust the density of operations to a level where full deconfliction at later stages, such as sequencing and spacing before/during flight, and tactical separation provision, is locally achievable. In the developed algorithm, we apply a cell-based DCB, in which the demand is expressed by the number of flight plans in individual cells (i.e., subdivided airspace regions) at regular intervals and is controlled not to exceed the capacity. In addition, a novel approach to accommodate spatial and temporal uncertainty of flight plans is introduced to solve the DCB problem in the framework of mixed-integer linear programming. Through numerical simulations, the effectiveness of the algorithm is confirmed in terms of the performance to control the demand to be within specified values.

关键词： Advanced Air Mobility Aircraft Operations Airspace Region Flight Trajectory mixed integer linear programming Numerical Simulation Air Traffic Management System Takeoff and Landing Collision Avoidance Guidance, Navigation, and Control

来源：评论

学校读者我要写书评

暂无评论

Planning strategy based on visibility graph and traveling salesman problem with time window constraints 28

Planning strategy based on visibility graph and traveling sa...

引用

28th International Conference on System Theory Control and Computing

作者： Barb-Ciorbea, Mihaela-Alexandra Kloetzer, Marius Mahulea, Cristian Gheorghe Asachi Tech Univ Iasi Dept Automat Control & Appl Informat Iasi Romania Univ Zaragoza Aragon Inst Engn Res I3A Zaragoza Spain

ISBN: (纸本)9798350364309;9798350364293

This paper addresses the problem of planning the motion of a mobile robot that has to visit some points of interest, each point having a specific time interval in which it can be reached. The robot is omnidirectional and it evolves with constant speed in an environment cluttered with polygonal obstacles. In the case of no obstacles, the problem would be a Travelling Salesman Problem with Time Window (TSPTW) constraints. Our solution is innovative by enabling obstacles for TSPTW scenarios, and it accomplishes this by coupling visibility graphs, graph reduction and mathematical programming. The method first constructs a visibility graph based on the obstacles and points to be visited, and then it maps this graph to another graph whose nodes correspond only to robot's initial position and points of interest. Finally, a TSPTW problem is solved on the reduced graph by using a mixed integer linear programming (MILP) mathematical formulation, and the solution is projected to the initial environment. The solution development is accompanied by illustrative numerical simulations.

关键词： travelling salesman time windows visibility graph mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：