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

Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations

JOURNAL OF GLOBAL OPTIMIZATION 2019年第2期75卷 273-339页

作者： Mehmanchi, Erfan Gomez, Andres Prokopyev, Oleg A. Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15261 USA Univ Southern Calif Dept Ind & Syst Engn Los Angeles CA 90089 USA

This paper focuses on methods that improve the performance of solution approaches for multiple-ratio fractional 0-1 programs (FPs) in their general structure. In particular, we explore the links between equivalent mixed-integer linear programming and conic quadratic programming reformulations of FPs. Thereby, we show that integrating the ideas behind these two types of reformulations of FPs allows us to push further the limits of the current state-of-the-art results and tackle larger-size problems. We perform extensive computational experiments to compare the proposed approaches against the current reformulations from the literature.

关键词： Fractional 0-1 programming Conic quadratic programming mixed-integer linear programming Polymatroid cuts Binary-expansion Assortment optimization

来源：评论

学校读者我要写书评

暂无评论

A new inventory routing problem with route and schedule unpredictability

引用

Applied Mathematical Modelling 2025年 147卷

作者： Marlize H. Visser Jan H. van Vuuren Stellenbosch Unit for Operations Research in Engineering Department of Industrial Engineering Stellenbosch University Private Bag XI Matieland 7602 South Africa

The inventory routing problem (IRP) in a retail supply chain setting allows for the simultaneous optimisation of delivery schedules, vehicle routes, and delivery quantities. The IRP relies on the adoption of a vendor-managed inventory strategy which has the potential to reduce transportation, inventory, and stock-out costs in a supply chain. In this paper, we introduce a mathematical model for a new IRP variant, the heterogeneous fixed fleet IRP with time-windows (HeFIRPTW) with route and schedule unpredictability, in the form of a bi-objective mixed-integer linear programming problem. This model simultaneously incorporates route and schedule unpredictability aimed at mitigating inherent safety and security threats experienced during the transportation of valuable goods. Delivery routes and schedules are generated that minimise the operational costs incurred whilst also ensuring that route segments are not traversed too regularly and that customers are not visited during overlapping daily time intervals. The feasibility of adopting an exact ϵ -constrained model solution method is investigated empirically by solving small, adapted benchmark instances of the problem. An investigation into the model solution complexity for varying problem sizes reveals that unpredictability, particularly with tightened constraints, increases the computational time. The complexity implications of multiple vehicles and the imposition of time-windows are also examined. The results highlight the computational demands of the proposed model, demonstrating a clear need for a faster, perhaps approximate, solution approach capable of generating high-quality solutions for realistic problem instances within reasonable time-frames.

关键词： Inventory routing problem mixed-integer linear programming Multi-objective optimisation Route unpredictability Schedule unpredictability

来源：评论

学校读者我要写书评

暂无评论

Siting and Sizing of Charging Infrastructure for Shared Autonomous Electric Fleets 21

Siting and Sizing of Charging Infrastructure for Shared Auto...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Ramin Ahadi Wolfgang Ketter John Collins Nicolo Daina Faculty of Management Economics and Social Sciences University of Cologne Department of Computer Science and Engineering University of Minnesota Department of Civil and Environmental Engineering Imperial College London

ISBN: (纸本)9781713832621

Business models rooted in shared economy, electrification, and automation are transforming urban mobility. Accounting for how these transformations interact is crucial if synergies are to be exploited. In this paper, we focus on how a cost-effective charging infrastructure for e-mobility can support the emergence of shared, autonomous mobility. This study addresses the problem of siting and sizing of charging stations for a fleet of shared autonomous electric vehicles (SAEVs). We develop a hybrid simulation-optimization model to find locations and numbers of chargers needed to serve charging demands. Our agent-based model provides an enhanced representation of SAEV operations allowing for smart charging and vehicle cruising when parking/charging is not available. Also, we model charging station placement as full covering optimization and solve the location-allocation problem simultaneously. Finally, we employ real-world trip data from ShareNow in Berlin to evaluate our approach for realistic demand patterns under different charging strategies and fleet sizes. The results show that charging station locations depend mostly on the spatial distribution of installation costs and charging demands. Moreover, charging strategies and fleet size affect the charging patterns and the required number of chargers as well as fleet performance.

关键词： Charging stations Shared autonomous electric vehicles Agent-based simulation mixed-integer linear programming CHARGING(ACCOUNTTNG) SITING Charger Device Component distribution substation SIZING mixed integer linear programming Fleet Event driven simulation

来源：评论

学校读者我要写书评

暂无评论

A hybrid metaheuristic to solve the multi-trip team orienteering problem with integrated tours and increasing profits for blood transportation

Operations Research, Data Analytics and Logistics

引用

Operations Research, Data Analytics and Logistics 2025年 45卷

作者： Andrea Pirabán-Ramírez William Javier Guerrero-Rueda Nacima Labadie Doctorado en Logística y Gestión de Cadenas de Suministros Universidad de La Sabana Campus Puente del Común Km. 7 Autopista Norte de Bogotá. Chía Cundinamarca Colombia Computer Science and Digital Society Laboratory (LIST3N) University of Technology of Troyes 12 Rue Marie Curie CS 42060 10004 Troyes CEDEX France School of Engineering Universidad de La Sabana Campus Puente del Común Km. 7 Autopista Norte de Bogotá. Chía Cundinamarca Colombia

The efficient management of the blood supply chain is paramount, given its critical impact on human lives if improperly handled. This research focuses on the location of mobile collection sites over a multiperiod horizon and transferring blood units from these sites to blood centers using a multi-trip shuttle fleet. The goal is to minimize the total cost comprising the transportation, delay, wastage, and shortage costs. The model considers constraints such as the tight time limit between the collection and processing of platelets and cryoprecipitates. Additionally, collection levels at donation sites are modeled assuming linear increasing rates. First, the problem is modeled as a mixed-integer linear program; then, a hybrid iterative local search is designed as a solution approach. The effectiveness and applicability of the proposed method are evaluated through a set of 39 new instances based on the blood collection system of Bogota, Colombia, which demonstrates promising solutions by systematically computing the best-known solutions.

关键词： BBS Bogota blood system BC blood center BCP blood collection problem BKS best-known solution BSC blood supply chain cryo cryoprecipitate CS collection site ILS iterative local search MILP mixed-integer linear programming MT-TOPIT-IP multi-trip team orienteering problem with integrated tours and increasing profits MT-VRPIP multi-trip vehicle routing problem with increasing profits NP-hard non-deterministic polynomial-time hard PLT platelet VND variable neighborhood descent WB whole blood Healthcare logistics Optimization OR in health services Perishable products Variable profits

来源：评论

学校读者我要写书评

暂无评论

A Process Systems Engineering approach towards responsive and sustainable (bio-)pharmaceutical supply chains

引用

Computers & Chemical Engineering 2025年 201卷

作者： Miriam Sarkis Steven Sachio Maria M. Papathanasiou The Sargent Centre for Process Systems Engineering Imperial College London London SW72BB Greater London United Kingdom Department of Chemical Engineering Imperial College London London SW72BB Greater London United Kingdom

The growth of advanced pharmaceutical products paves the way to a step change in manufacturing network design and planning, with an increasing pressure to meet uncertain demands. In this space, the ability to ramp up manufacturing capacity becomes a crucial metric to consider during planning. This work presents an optimization-based approach for network design and scalability assessment. Firstly, techno-economic and life cycle analyses are used to quantify input optimization parameters for candidate technologies. Secondly, a multi-product design and planning problem is solved to obtain optimized network designs. Thirdly, the scalability of given designs is quantified through a solution space assessment methodology, whereby uncertain demand and adjustable production yield parameters are sampled simultaneously and the size of the feasible solution region is quantified through α -shape methods. This becomes an indicator of the capacity of the network design to withstand demand variations through process manipulation, intensification, and scale-out, thus quantifying a space of operation versus a single optimal point. Comparative results are presented for multi-use (MU) equipment-based manufacturing and a single-use (SU) counterpart, which enables a modular manufacturing approach. Costs and footprints of the SU-based network are lower compared to MU, whilst scalability significantly increases. This highlights the potential of modular and flexible manufacturing in improving resource use and overall supply chain responsiveness.

关键词： Supply chain optimization mixed-integer linear programming Modular manufacturing Next-generation pharmaceuticals

来源：评论

学校读者我要写书评

暂无评论

Power capacity enhancement of hydropower plant through the penetration of solar and wind energy

引用

International Journal of Electrical Power & Energy Systems 2025年 169卷

作者： Ahmad Shah Irshad Ahmad Shah Amin Amir Mohammad Ilham M.H. Elkholy Said Elias Tomonobu Senjyu Department of Electrical and Electronics Engineering Faculty of Engineering University of the Ryukyus Okinawa 903-0213 Japan Department of Energy Engineering Engineering Faculty Kandahar University Kandahar 3801 Afghanistan Da Afghanistan Brashna Sharkat Kandahar 3801 Afghanistan Electrical Power and Machines Faculty of Engineering Zagazig University P.O. 44519 Zagazig Egypt Institute for Risk and Reliability Leibniz University Hannover Germany

Integrating renewable energy sources is crucial for enhancing the power capacity and reliability of existing hydropower plants. This study explores the potential of augmenting hydropower capacity by incorporating solar and wind energy. By leveraging the complementary nature of these renewable sources, the study aims to optimize energy production and reduce dependence on hydro resources during low water availability. A comprehensive analysis, including simulation models and field data, demonstrates the effective harnessing and synchronization of solar and wind energy with hydropower generation. A multi-objective genetic algorithm was employed to optimize this integration, addressing objectives such as maximizing power output, improving energy efficiency, and minimizing environmental impact. This algorithm facilitated the identification of effective strategies for enhancing the performance and capacity of the hybrid renewable energy system. Three key objectives were achieved: reducing the Loss of Power Supply Probability (LPSP) to 0.75 %, calculating the net present cost (NPC) at $4.37 million, and determining the cost of energy (COE) at $0.086 per kilowatt-hour (kWh). These results demonstrate the economic viability and reliability of the integrated system. The power generation capacity of the plant was enhanced by 25 % with integration of PV, and wind energy system. The findings reveal significant improvements in power capacity and grid stability, highlighting the feasibility and benefits of a hybrid renewable energy system. This approach enhances energy security, reduces greenhouse gas emissions by 248,922.4 tons per year, and promotes clean energy use. The study offers valuable insights and guidelines for policymakers and energy planners seeking to implement similar strategies.

关键词： Hybrid Renewable Energy System Solar-Wind-Hydro Integration Energy Cost Optimization Net Present Cost Analysis Power Supply Reliability Environmental Sustainability CO 2 Carbon dioxide COE Cost of energy CRF Capital recovery factor DG Diesel generator GA Genetic algorithm GHG Greenhouse gas GHI Global horizontal irradiance GOA Grasshopper optimization algorithm HRES Hybrid renewable energy systems IRENA International Renewable Energy Agency LCOE Levelized cost of energy LPSP Loss of power supply probability MILP mixed-integer linear programming MOGA Multi-objective genetic algorithm MPSO Modified particle swarm optimization NASA National Aeronautics and Space Administration NOCT Nominal operating cell temperature NPC Net present cost O&M Operation and maintenance PHS Pumped hydro storage PV Photovoltaic RE Renewable energy RES Renewable energy sources STC Standard test condition UNFCCC United Nations Framework Convention on Climate Change WT Wind turbine

来源：评论

学校读者我要写书评

暂无评论

Efficient solution approaches for locating electric vehicle fast charging stations under driving range uncertainty

引用

COMPUTERS & OPERATIONS RESEARCH 2019年第0期109卷 288-299页

作者： Boujelben, Mouna Kchaou Gicquel, Celine UAE Univ Al Ain U Arab Emirates Univ Paris Saclay LRI Paris France

We seek to determine the best locations for electric vehicle fast charging stations under driving range uncertainty. Two stochastic programming based models have been recently proposed to handle the resulting stochastic flow refueling location problem: a first one maximizing the expected flow coverage of the network, a second one based on joint chance constraints. However, significant computational difficulties were encountered while solving large-size instances. We thus propose two efficient solution approaches for this problem. The first one is based on a new location-allocation type model for this problem and results in a MILP formulation, while the second one is a tabu search heuristic. Our numerical experiments show that when using the proposed MILP formulation, the computation time needed to provide guaranteed optimal solutions is significantly reduced as compared to the one needed when using the previously published MILP formulation. Moreover, our results also show that the tabu search method consistently provides good quality solutions within short computation times. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Flow refueling location model Electric vehicle charging station network design Stochastic driving range Stochastic programming mixed-integer linear programming Tabu search

来源：评论

学校读者我要写书评

暂无评论

Search for K-best solutions in optimal design of energy supply systems by an extended MILP hierarchical branch and bound method

引用

ENERGY 2019年 184卷 45-57页

作者： Yokoyama, Ryohei Shinano, Yuji Taniguchi, Syusuke Wakui, Tetsuya Osaka Prefecture Univ Dept Mech Engn Naka Ku 1-1 Gakuen Cho Sakai Osaka 5998531 Japan Zuse Inst Berlin Dept Optimizat Takustr 7 D-14195 Berlin Germany

For the purpose of making a decision in the optimal design of an energy supply system, it is important to investigate not only the optimal solution but also suboptimal ones which follow the optimal one without any omissions, what are called K-best solutions. In this paper, a mixed-integer linear programming method utilizing the hierarchical relationship between design and operation variables proposed previously is extended to search the K-best solutions very efficiently. In addition, methods for updating the incumbents are incorporated into the extended method for three options for the criterion set newly in deriving the K-best solutions. This extended method is implemented into open and commercial MILP solvers, and is applied to illustrative and practical case studies, respectively, on the optimal design of cogeneration systems. Through the studies, it turns out that the proposed method is much superior in terms of solution optimality and computation efficiency to a conventional method, and that the computation efficiency to derive one of the K-best solutions by the proposed method increases with the number of K-best solutions. In addition, features of the K-best solutions in the value of objective function are clarified. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Energy supply systems Optimal design and operation mixed-integer linear programming K-best solutions Branch and bound method Hierarchical approach

来源：评论

学校读者我要写书评

暂无评论

Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2019年第6期26卷 2432-2449页

作者： Mrad, Mehdi Chalghoumi, Sabrine Ladhari, Talel Gharbi, Anis King Saud Univ Dept Ind Engn Riyadh Saudi Arabia Univ Tunis BADEM Tunis 2059 Tunisia Univ Tunis Ecole Super Sci Econ & Commerciales Tunis 1089 Montfleury Tunis Tunisia Umm Al Qura Univ Coll Business Management Dept Business Adm Mecca Saudi Arabia

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment-based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.

关键词： flowshop total completion time release date lower bounds mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Partially-Decoupled Service Agent - Transport Agent Task Allocation and Scheduling

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2019年第2期94卷 423-437页

作者： Bays, Matthew J. Wettergren, Thomas A. Naval Surface Warfare Ctr Panama City Div Panama City FL 32407 USA Naval Undersea Warfare Ctr Newport Div Newport RI 02840 USA

We present an approach to performing efficient schedule generation of a heterogeneous team of autonomous agents in a service agent - transport agent scenario where the task allocation and scheduling components are partially-decoupled. In the scenario, service agents must perform tasks at a number of locations. The agents are free to move between locations, however the agents may also be transported throughout the region by a limited number of faster-moving transport agents. The goal of the problem is to plan a schedule of service agent and transport agent actions such that all locations are serviced in the shortest amount of time. While in previous work we formulated the problem as a holistic mixed-integer linear program, we present a novel method to solve the problem in a hierarchical and partially-decoupled manner for faster optimization and to require less information to be processed and communicated in a centralized manner to perform the schedule planning. The original solution method required up to 20 minutes to obtain an efficient solution. The new methodology, using hierarchical task allocation and a bidding-based scheduling algorithm, can create an efficient solution in seconds.

关键词： Multi-agent systems Scheduling Optimization Task allocation mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：