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

Optimal Solution Accoutrement for Crew Scheduling Problem: An Innovative Solution Approach Predicating on a Tailor-Made DSS

引用

INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING 2023年第4期22卷 1489-1527页

作者： Kaya, Burcu Yilmaz Dagdeviren, Metin Gazi Univ Ind Engn Dept Fac Engn TR-06570 Ankara Turkey

Reducing costs on resource consumption against volatile economic environment and market structures is the main concern and key to leadership as constant concern of all industries. Crew scheduling has vital importance, especially in service sector, to manage the most unmeasurable and imponderable resource and cardinal element, human. Due to its NP-Hard structure, although mathematically modeling it is possible, it is nearly impossible to optimally solve it solely relying on mathematical modeling solution methodologies. This study proposes a tailor-made decision support system (DSS) to derive the optimal solution to crew scheduling problem as integer linear programming (ILP) models. The proposed DSS-based ILP approach was introduced on the optimal solution of a large-scaled real-world airline crew scheduling problem considering 189 daily flights and 14402 possible weekly routes. Additional computational experiments were performed to prove that the proposed DSS could be used for practical support with agility and efficiency on variant real-life scheduling decisions.

关键词： Crew scheduling human factors engineering integer linear programming decision support systems operational management object oriented efficiency

来源：评论

学校读者我要写书评

暂无评论

A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年第1期307卷 64-81页

作者： Benavent, Enrique Corberan, Angel Lagana, Demetrio Vocaturo, Francesca Univ Valencia Dept Estadist & Invest Operat DEIO Dr Moliner 50 Burjassot 46100 Valencia Spain Univ Calabria Dipartimento Ingn Meccan Energet & Gestionale DIM Via Pietro Bucci Cubo 41-C I-87036 Arcavacata Di Rende CS Italy Univ Calabria Dipartimento Econ Stat & Finanza Giovanni Anania Via Pietro Bucci Cubo 0-C I-87036 Arcavacata Di Rende CS Italy

In this article we address the periodic rural postman problem with irregular services ( P RP P -IS), where some arcs and/or edges of a mixed graph must be traversed (to be serviced) a certain number of times in some subsets of days of a given time horizon. The goal is to define a set of minimum cost tours, one for each day or period of the time horizon, that satisfy the service requirements. For this problem we propose a two-phase algorithm that combines heuristics and mathematical programming. In the first phase, two different procedures are used to construct feasible solutions: a multi-start heuristic based on feasibility pump and a multi-start constructive heuristic. From these solutions, some fragments (parts of tours associated with the different days) are extracted. The second phase determines a solution for the P RP P -IS by combining the fragments by means of a mathematical model. We show the effectiveness of this solution approach through an extensive experimental phase on different sets of instances. (c) 2022 Elsevier B.V. All rights reserved.

关键词： Routing Mixed rural postman problem Multi-Start heuristics Feasibility pump integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Energy efficient routing using adaptive elephant herding optimization for IoT-WSN

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2023年第4期45卷 5467-5479页

作者： Sivakami, K. Vijayalakshmi, P. Nehru Inst Engn & Technol Dept ECE Coimbatore 641105 Tamil Nadu India Hindusthan Coll Engn & Technol Dept ECE Coimbatore Tamil Nadu India

WSNs(Wireless Sensor Networks) has been developed with applications in many domains including agriculture, telecommunication, manufacturing industry, healthcare, and surveillance. More specifically, WSN plays a pivotal role in IoT (Internet of Things). The IoT sensors provide information about the physical phenomena in the deployed fields. As the sensors contain only limited resources, the factors like data processing, power consumption, transmission, and storage capabilities adversely affect the efficiency. Thus, the process of routing is necessary for network longevity. The data from IoT-based sensors is routed to the destination through a multi-hop routing system. The Energy aware Routing is motivated by the nature inspired Fuzzy Butterfly Optimization (E2RFBOA). Further a new data aggregation method is introduced in this article customized for IoT based WSN to acquaint higher crop yield in precision farming. Nevertheless, the scalability becomes a primary concern when deployed in larger and denser networks. This is due to the fact that all nodes in IoT and WSN are mostly alive depending on higher usage of bandwidth and power. The primal aim is to build a novel routing protocol developed for IoT-WSN. Apart from this, an Energy aware Clustered Routing that is motivated by Adaptive Elephant Herding Optimization (E2CR-AEHO) is proposed, which sensors collect data and find a group of Cluster Heads (CHs). In the AEHO Algorithm, the formed CH is rotated depending on power consumption. This also prevents frequent re-clustering;at the same time it can effectively adapt to the changes in network topology. According to the AEHOA, the node population comprises of nodes that can choose its CHs among the other nodes. This algorithm takes into account a number of criteria, including power consumption, residual power of Sensor Nodes (SN), network reliability, and data reliability. The suggested approach can efficiently represent the network environment, allowing the routing alg

关键词： Internet of things swarm intelligence information fusion integer linear programming adaptive elephant herding optimization wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

integer programming topology optimization for subsonic compressible flows with geometry trimming

引用

INTERNATIONAL JOURNAL OF HEAT AND MASS TRANSFER 2023年 201卷

作者： Maffei, Felipe Silva Nogueira de Sa, Luis Fernando Moscatelli, Eduardo Picelli, Renato Meneghini, Julio Romano Nelli Silva, Emilio Carlos Univ Sao Paulo Dept Mechatron & Mech Syst Engn BR-05508060 Sao Paulo SP Brazil Univ Sao Paulo Dept Naval Architecture & Ocean Engn BR-05508060 Sao Paulo SP Brazil Univ Sao Paulo Dept Mech Engn BR-05508060 Sao Paulo SP Brazil

The incompressibility hypothesis is successfully applied in a broad range of engineering problems simu-lated via computational fluid dynamics (CFD) codes. However, depending on the Mach number, the ef-fects of compressibility are no longer negligible. Recently, the first papers about topology optimization considering compressible flows were published. All of them use the continuous design variables method which has some known drawbacks. The present work proposes topology optimization considering the compressible Navier-Stokes equations and discrete variables with a step of geometry trimming. This ap-proach constrains the design variables to a binary set and solves the problem by using sequential integer linear programming, being a feasible alternative to classic density-based methods. Additionally, the solid regions are trimmed out from the physics analysis. A material model is inserted in the governing equa-tions in such a way that, it is possible to calculate the sensitivity and, at the same time, guarantee the adiabatic condition. In this work, it is observed that the minimization of entropy generation as the ob-jective function tends to converge to an undesired trivial solution. Alternatively, this work proposes the maximization of mass flow rate as the objective function to, indirectly, minimize the entropy. Further-more, it is proposed the use of a new set of inlet boundary conditions. Three optimization cases are solved: the double-pipe, the pipe-bend, and an entropy maximization problem. The optimized solutions for the pipe-bend and double-pipe problems present geometries where the constraints are satisfied with the minimum entropy generation. Using the double-pipe example, it is conducted a study to understand the impacts of TOBS-GT parameters in the solutions. The results evidenced that, in some conditions, the implementation is prone to fall in a local minimum. In the third example, entropy maximization sub-jected to volume constraint is successfully solv

关键词： Compressible subsonic flows Topology optimization integer linear programming CFD Geometry trimming

来源：评论

学校读者我要写书评

暂无评论

Optimized Allocation of Fault Transmitters for Improving the Recloser-Fuse Coordination

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2023年第6期38卷 5188-5199页

作者： dos Santos, Caio Bartmeyer, Petra M. Trindade, Fernanda C. L. Lyra, Christiano Univ Campinas UNICAMP BR-13083970 Campinas Brazil Mt Sinai Hosp Mt Sinai Heart New York NY 10029 USA

New technologies are currently delivering protective devices that can enhance the design of protection coordination in modern distribution systems. This paper proposes an integer linear programming (IP) model to find the optimal location of a Fault Transmitter (FT) in the distribution system. The proposed IP model provides the optimal FT allocation considering the minimization of sustained interruption frequency and momentary interruption duration. A study of the appropriate number of FT reveals the best alternative in the proposed adaptive protection scheme. A Monte Carlo simulation with a richer representation of stochastic fault scenarios is used for further evaluation of the solutions obtained with the proposed IP model. The combined strategies allow full-scale studies of the optimal allocation of FT in distribution systems. The results of studies using two test systems certify the benefits of the proposed strategy in fuse-saving coordination and in reducing the total duration of the momentary interruption, which can cause power quality problems.

关键词： Fuses Transmitters Resource management integer linear programming Fault currents Monte Carlo methods Adaptive protection allocation of fault transmitters integer linear programming Monte Carlo simulation

来源：评论

学校读者我要写书评

暂无评论

Joint Scheduling and Resource Allocation for Packets With Deadlines and Priorities

引用

IEEE COMMUNICATIONS LETTERS 2023年第1期27卷 248-252页

作者： Raviv, Li-On Leshem, Amir Bar Ilan Univ Fac Engn IL-52900 Ramat Gan Israel

Cellular networks provide communication for different applications. Some applications have strict and very short latency requirements, while others require high bandwidth with varying priorities. The challenge of satisfying the requirements grows in congested traffic where some packets might miss their deadlines. Unfortunately, we prove that the problem is NP-Hard. To overcome this, we propose a new scheduling policy for packets with multiple priorities, latency requirements, and strict deadlines. To alleviate the complexity, our solution incorporates a novel time domain relaxation solved by linear programming. Simulation results show that this method outperforms existing scheduling strategies.

关键词： Ultra reliable low latency communication Resource management Quality of service Delays Scheduling Computational complexity Multiuser detection Joint scheduling channel allocation queues deadline priority integer linear programming linear programming URLLC EDF

来源：评论

学校读者我要写书评

暂无评论

Cornell University Uses integer programming to Optimize Final Exam Scheduling

arXiv

引用

arXiv 2024年

作者： Ye, Tinghan Jovine, Adam van Osselaer, Willem Zhu, Qihan Shmoys, David B. H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology United States School of Operations Research and Information Engineering Cornell University United States Tepper School of Business Carnegie Mellon University United States

This paper presents an integer programming-based optimization framework designed to effectively address the complex final exam scheduling challenges encountered at Cornell University. With high flexibility, the framework is specifically tailored to accommodate a variety of different constraints, including the front-loading of large courses and the exclusion of specific time slots during the exam period. By generating multiple scheduling model variants and incorporating heuristic approaches, our framework enables comprehensive comparisons of different schedules. This empowers the University Registrar to make informed decisions, considering trade-offs in terms of schedule comfort measured by different levels of exam conflicts. Our results demonstrate significant advantage over the historical lecture time-based approach, providing time and effort savings for the university administration while enhancing student and faculty satisfaction. Copyright © 2024, The Authors. All rights reserved.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimized Compiler for Distributed Quantum Computing

引用

ACM TRANSACTIONS ON QUANTUM COMPUTING 2023年第2期4卷 1-29页

作者： Cuomo, Daniele Caleffi, Marcello Krsulich, Kevin Tramonto, Filippo Agliardi, Gabriele Prati, Enrico Cacciapuoti, Angela Sara Univ Naples Federico II Dept Phys Naples Italy Univ Naples Federico II DIETI Via Claudio 62 I-80126 Naples Italy TJ Watson Res Ctr IBM Quantum Yorktown Hts NY 10598 USA Kyndryl Italia Innovat Serv Via Circonvallaz Idroscalo Snc I-20090 Segrate MI Italy Politecn Milan Dept Phys Piazza Leonardo da Vinci I-20133 Milan Italy IBM Italia Via Circonvallaz Idroscalo I-20090 Segrate MI Italy Univ Milan Dept Phys I-20133 Milan Italy CNR IFN Piazza Leonardo da Vinci 32 I-20133 Milan Italy

Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on distributed architectures. As generally assumed in this scenario, telegates represent the fundamental remote (inter-processor) operations. Each telegate consists of several tasks: (i) entanglement generation and distribution, (ii) local operations, and (iii) classical communications. Entanglement generations and distribution is an expensive resource, as it is time-consuming. To mitigate its impact, we model an optimization problem that combines running-time minimization with the usage of distributed entangled states. Specifically, we formulated the distributed compilation problem as a dynamic network flow. To enhance the solution space, we extend the formulation, by introducing a predicate that manipulates the circuit given in input and parallelizes telegate tasks. To evaluate our framework, we split the problem into three sub-problems, and solve it by means of an approximation routine. Experiments demonstrate that the run-time is resistant to the problem size scaling. Moreover, we apply the proposed algorithm to compile circuits under different topologies, showing that topologies with a higher ratio between edges and nodes give rise to shallower circuits.

关键词： Quantum circuit compilation integer linear programming

来源：评论

学校读者我要写书评

暂无评论

New Construction of q-ary Codes Correcting a Burst of at most t Deletions

New Construction of q-ary Codes Correcting a Burst of at mos...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Song, Wentu Cai, Kui Quek, Tony Q. S. Singapore Univ Technol & Design Sci Math & Technol Cluster Singapore 487372 Singapore Singapore Univ Technol & Design Informat Syst Technol & Design Pillar Singapore 487372 Singapore

ISBN: (纸本)9798350382853;9798350382846

In this paper, for any fixed integer q > 2, we construct q-ary codes correcting a burst of at most t deletions with redundancy log n + 8 log log n + o(log log n) + gamma(q,t) bits and near-linear encoding/decoding complexity, where n is the message length and gamma(q,t) is a constant that only depends on q and t. In previous works there are constructions of such codes with redundancy log n + O(log q log log n) bits or log n + O(t(2) log log n) + O(t log q). The redundancy of our new construction is independent of q and t in the second term.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

FORS: fault-adaptive optimized routing and scheduling for DAQ networks

引用

Computing and Software for Big Science 2025年第1期9卷 1-23页

作者： Stein, Eloise Bramas, Quentin Pisani, Flavio Colombo, Tommaso Pelsser, Cristel University of Strasbourg Strasbourg France European Council for Nuclear Research (CERN) Geneva Switzerland UCLouvain Ottignies-Louvain-la-Neuve Belgium

Data acquisition (DAQ) networks, widely used in scientific research and industrial applications, are composed of numerous interconnected servers, exchanging substantial data volumes produced by large scientific instruments. One traffic matrix generally used in such networks is the all-to-all collective exchange, which demands substantial network resources, making network failures particularly challenging to mitigate. If not mitigated, the effects of network failures severely hamper the performance of the DAQ network, potentially leading to the loss of valuable experimental data. In the context of DAQ networks using a fat-tree topology, we propose FORS: a scheduling and associated routing solution to support the all-to-all collective exchange under network failures. FORS optimizes bandwidth utilization in the face of any failure scenarios, ensuring robust performance compared to the existing approaches. We propose an algorithm to solve the scheduling. For the routing, we design an algorithm for simple failure scenarios, along with a linear programming model to address more complex failure scenarios. We validate our proposed solution using a real-world DAQ network as a case study. Results demonstrate significant performance degradation in existing approaches and FORS’ consistent ability to achieve higher throughput across various failure scenarios. © The Author(s) 2025.

关键词： All-to-all Data acquisition Fat-tree networks Fault-tolerance integer linear programming Optimal routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：