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

Environment-Friendly School Bus Routing Problem With Heterogeneous Fleet: A Large-Scale Real Case

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2022年第4期23卷 3461-3471页

作者： Hulagu, Selin Celikoglu, Hilmi Berk Istanbul Tech Univ ITU ITS Res Lab TR-34469 Istanbul Turkey Istanbul Tech Univ ITU Dept Civil Engn TR-34469 Istanbul Turkey

In the present study, we concentrate on the formulation and the exact solution of a specific vehicle routing problem with environmental concerns, which is a complex actual problem of staff service bus route planning for a university in a metropolitan city. Taking into account the air pollution related measures for representing the cost of environmental concerns in addition to the vehicle rental and fuel consumption related operational costs, we formulate a flow-based mixed integer linear program for the environment-friendly school bus routing problem specific to both homogeneous and heterogeneous vehicle fleets. We provide exact solutions to the instance sets we have designed specific to variants of the problem considering the fleet type, vehicle capacity, and maximum route length. Results from model based exact solutions for our formulations show up to 30% of reduction in the overall cost for the heterogeneous fleet case when compared to the homogeneous ones, and suggest a routing plan that enables the utilization of almost the entire capacity of all the buses assigned. We discuss in details the trade-offs between the cost items, travel times, and travel distances in composing a vehicle fleet considering the demand sprawled over the metropolitan area.

关键词： Road transportation sustainable development vehicle routing network theory (graphs) integer linear programming optimization

来源：评论

学校读者我要写书评

暂无评论

Estimating Response of Fractional Order Systems and Control: An Orthogonal HF-Based Approach

Estimating Response of Fractional Order Systems and Control:...

引用

2024 IEEE International Conference on Signal Processing, Information, Communication and Systems, SPICSCON 2024

作者： Roychoudhury, Srimanti Rahman, Ubaidur Rabbi, Md Shakawat Hossain Department of EEE Daffodil International University Dhaka Bangladesh

ISBN: (纸本)9798331510213

In an attempt to simplify the mathematical solution of real-world systems, further presumptions such as an integer order system and zero initial condition lead to imprecise and incorrect system modeling. By modeling real-world systems with fractional orders these problems can be solved with more accuracy. However, analyzing those systems and determining time-based responses are quite difficult challenges. Several techniques for fractional order system approximation were developed earlier and are accessible in the literature to reduce the mathematical complexity. However, the proposed method for solving the issue is more efficient and provides far more accurate results with a simpler algorithm than existing methods. Based on the orthogonal hybrid functions (HF), the suggested method is found. When working with function samples, the orthogonal HF set can efficiently provide piecewise linear solutions for a variety of control systems. A few examples are included with pertinent figures and tables, and the findings are compared using current methodologies to verify the accuracy of the solution and the efficacy of the method being discussed. ©2024 E E E.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings 32

Revisiting ILP Models for Exact Crossing Minimization in Sto...

引用

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Dobler, Alexander Jünger, Michael Jünger, Paul J. Meffert, Julian Mutzel, Petra Nöllenburg, Martin TU Wien Austria University of Cologne Germany University of Bonn Germany

ISBN: (纸本)9783959773430

Storyline drawings are a popular visualization of interactions of a set of characters over time, e.g., to show participants of scenes in a book or movie. Characters are represented as x-monotone curves that converge vertically for interactions and diverge otherwise. Combinatorially, the task of computing storyline drawings reduces to finding a sequence of permutations of the character curves for the different time points, with the primary objective being crossing minimization of the induced character trajectories. In this paper, we revisit exact integer linear programming (ILP) approaches for this NP-hard problem. By enriching previous formulations with additional problem-specific insights and new heuristics, we obtain exact solutions for an extended new benchmark set of larger and more complex instances than had been used before. Our experiments show that our enriched formulations lead to better performing algorithms when compared to state-of-the-art modelling techniques. In particular, our best algorithms are on average 2.6-3.2 times faster than the state-of-the-art and succeed in solving complex instances that could not be solved before within the given time limit. Further, we show in an ablation study that our enrichment components contribute considerably to the performance of the new ILP formulation. © Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, and Martin Nöllenburg.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Collective Certified Robustness against Graph Injection Attacks 41

Collective Certified Robustness against Graph Injection Atta...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Lai, Yuni Pan, Bailin Chen, Kaihuang Yuan, Yancheng Zhou, Kai Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong

We investigate certified robustness for GNNs under graph injection attacks. Existing research only provides sample-wise certificates by verifying each node independently, leading to very limited certifying performance. In this paper, we present the first collective certificate, which certifies a set of target nodes simultaneously. To achieve it, we formulate the problem as a binary integer quadratic constrained linear programming (BQCLP). We further develop a customized linearization technique that allows us to relax the BQCLP into linear programming (LP) that can be efficiently solved. Through comprehensive experiments, we demonstrate that our collective certification scheme significantly improves certification performance with minimal computational overhead. For instance, by solving the LP within 1 minute on the Citeseer dataset, we achieve a significant increase in the certified ratio from 0.0% to 81.2% when the injected node number is 5% of the graph size. Our paper marks a crucial step towards making provable defense more practical. Our source code is available at https://***/Yuni-Lai/CollectiveLPCert. Copyright 2024 by the author(s)

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Research on Cultivation Strategy Based on Robust Optimization Model and Genetic Algorithm 2

Research on Cultivation Strategy Based on Robust Optimizatio...

引用

2nd IEEE International Conference on Electrical, Automation and Computer Engineering, ICEACE 2024

作者： Lv, Linpu Yang, Haoxiang Yang, Wenjun Li, Ruijie Li, Jiaxu Zhengzhou University Zhengzhou China Huanghe University of Science and Technology Zhengzhou China Central South University Changsha China

ISBN: (纸本)9798350368208

In this paper, an in-depth study is conducted on the problem of cultivation strategy of arable land, and a robust optimization model based on 0-1 integer programming is established. The objective is to optimize cultivation strategies using methods such as controlling variables, categorical discussion, and conceptual model transformation. First, by introducing the demand price elasticity coefficient, the uncertain planting area problem is transformed into a crop and plot selection matching problem. Secondly, for the two strategies of demurrage treatment and selling at reduced price, robust optimization models were established and optimized using a genetic algorithm. The results showed that strategy II was significantly more effective. Finally, based on strategy II, the IGDT robust decision-making model under the risk aversion strategy (RAS) was constructed, considering the uncertainty factor. The results showed that the plot yields fluctuated, but the overall outcome was more stable. The research in this paper provides reference value for actual cropland planting strategies. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Robust shortest path problem based on multi-directional link travel time 9

Robust shortest path problem based on multi-directional link...

引用

9th International Conference on Electromechanical Control Technology and Transportation, ICECTT 2024

作者： Yu, Zhenzhou Cheng, Lin School of Transportation Southeast University Jiangsu Province Nanjing211189 China

ISBN: (纸本)9781510682399

This article introduces directional link cost to shortest path problem and demonstrates extension of its application through robust optimization approach. We show that under budget uncertainty set this problem can be formulated as a min-max formulation, which can then be reformulated as a mixed integer linear program. For this program, we present a benders algorithm as a solution algorithm which is efficient. Based on our experiment, the importance of considering directional link cost is further stated, and the effectiveness of the proposed algorithm is also proved. © 2024 SPIE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of a Virtualized Cloud Data Center through Efficient VM Migrations 2024

Performance Analysis of a Virtualized Cloud Data Center thro...

引用

16th International Conference on Contemporary Computing, IC3 2024

作者： Mukhopadhyay, Nirmalya Tewari, Babul P. Department of Information Technology G H Raisoni College of Engineering and Management Maharashtra Pune402207 India Department of Computer Science & Engineering Ghani Khan Choudhury Institute of Engineering and Technology West Bengal Malda732209 India

ISBN: (纸本)9798400709722

Virtualized cloud data centers play a crucial role in modern computing infrastructure, facilitating dynamic resource allocation and scalability. Efficient management of virtual machines (VMs) within these environments is essential to optimize performance, computational cost, energy consumption, and resource utilization. This paper presents a comprehensive performance analysis of a virtualized cloud data center, focusing on minimizing the number of VM migrations through an innovative approach leveraging integer linear programming (ILP) and a Greedy algorithm. The proposed methodology aims to address the challenge of excessive migrations, which can lead to performance degradation and resource inefficiencies. Through extensive experimentation and performance evaluation, we demonstrate the effectiveness of our approach in reducing migration overhead while maintaining system performance and availability. Our findings indicate significant improvements in migration efficiency and overall data center performance compared to existing strategies. © 2024 Copyright held by the owner/author(s).

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimal Deployment of Millimeter-Wave Base Stations Under Outage Requirement

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第12期21卷 10544-10559页

作者： Dong, Miaomiao Cho, Minsung Lee, Kangeun Yoon, Sungrok Kim, Taejoon City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Univ Kansas Dept Elect Engn & Comp Sci Lawrence KS USA Samsung Elect Suwon South Korea

Today's growth in the volume of wireless devices coupled with the demand for data-intensive use cases has motivated the deployment of millimeter-wave (mmWave) small-cell networks. Although it is true that mmWave networks can carry a large volume of traffic, highly intermittent connectivity and the challenges related to installing many small-cell base stations (BSs) in urban geometry have impeded its progression into practical networks. To cope with these challenges, we present, in this paper, an approach to the mmWave BS deployment (site planning) problem, based on the minimum-deployment-cost criterion that is subject to user equipment (UE) outage constraints. Unlike the prior works, the proposed model captures the randomness of link blockage and signal-to-interference-plus-noise-ratio (SINR) statistics in mmWave networks. We formulate the minimum-cost deployment problem as large-scale integer nonlinear programming (INP). To deal with the coupled and combinatorial of the problem, the large-scale INP has approached to devise a suboptimal but efficient algorithm by decomposing it into two subproblems: (i) cell coverage optimization and (ii) minimum subset selection. We provide the solutions to each subproblem as well as theoretical justifications of them. Simulation results that illustrate UE outage guarantees of the proposed BS deployment method are presented. The results reveal that the proposed method uniquely distributes the macro-diversity orders that are distinct from other benchmarks.

关键词： Interference Signal to noise ratio Geometry Radio frequency Wireless communication Reliability Quality of service Link blockage outage minimum-cost base station deployment integer nonlinear programming integer linear programming site planning

来源：评论

学校读者我要写书评

暂无评论

Synchronized Optimization for Service Scheduling, Train Parking and Routing at High-Speed Rail Maintenance Depot

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2022年第5期23卷 4525-4540页

作者： Wang, Jiaxi Zhao, Yinan Gronalt, Manfred Lin, Boliang Wu, Jianping Zhejiang Prov Inst Commun Planning Design & Res C Hangzhou 310031 Peoples R China Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China Univ Nat Resources & Life Sci Inst Prod & Logist A-1180 Vienna Austria China Railway Design Corp Tianjin 300142 Peoples R China

To meet the operational requirements and to ensure safe operations, train units of a passenger railway operator require inspection and/or cleaning at the maintenance depots after running a specified mileage or time period. Accordingly, these inspection and cleaning activities are called depot services. In this paper, we propose an integer linear programming (ILP) model for the integrated optimization problem of depot service scheduling, train parking, and train routing. Both short trains (8 marshaling) and long trains (16 marshaling) are considered in the ILP model which is a combinational optimization problem in the dead-end tracks scenario. Moreover, a real-world case study of the Shanghai South Depot, China is carried out to further examine the effectiveness and efficiency of the proposed methodology. Computational results indicate that our method is able to generate optimized shunting plans for the linearized INLP within reasonable solution time for real-life applications, outperforming the manual method in terms of the solution quality and the computation speed.

关键词： Routing Computational modeling Rail transportation Tracking Maintenance engineering Cleaning Optimization Maintenance depot train shunting service scheduling integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming approach to maintenance strategies selection

引用

INTERNATIONAL JOURNAL OF QUALITY & RELIABILITY MANAGEMENT 2013年第9期30卷 991-+页

作者： Braglia, Marcello Castellano, Davide Frosolini, Marco Univ Pisa Pisa Italy ANIMP Natl Assoc Ind Plants Milan Italy Univ Pisa Ind Plant Pisa Italy

Purpose - The purpose of this paper is to present a reliability centered maintenance (RCM) embedded integer linear programming approach (suited to the budget monetary resources allocation task) to the maintenance strategies mix selection for an industrial plant equipment. Design/methodology/approach - The developed approach allows to determine the optimal maintenance strategies mix for a set of equipment in a more quantitative way than the classic RCM approach. The proposed model takes into account, for each potential failure determined using the FMECA and for each admissible strategy, the costs and the potential risk priority number (RPN) reduction. Finally, an industrial case concerning an Italian paper-mill plant is reported to demonstrate the effectiveness of the approach presented. Findings - The paper finds that the application of the proposed approach allows to optimally allocate the budget monetary resources, determining which suitable maintenance practice apply to each failure, taking into account the costs of each strategy and the potential reduction of the RPN. Practical implications - The proposed model permits to assign (during the budget monetary resources allocation task) to each failure the optimal strategy, among a set of suitable maintenance practices, considering the costs and the estimated RPN reduction. Originality/value - The paper proposes a completely new RCM embedded approach to the maintenance strategies selection, in order to optimally allocate the budget monetary resources. This model overcomes the limits of the traditional RCM approach, taking into account quantitative aspects, i.e. the compatibility constraint between failures and policies, the maintenance strategies costs, and the RPN estimated reduction.

关键词： FMECA integer linear programming Reliability centered maintenance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：