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

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Zhang, Yuntian Chen, Chen Ding, Shuxin Deng, Fang Beijing Institute of Technology National Key Lab of Autonomous Intelligent Unmanned Systems Beijing100081 China Signal and Communication Research Institute China Academy of Railway Sciences Corporation Limited Beijing100081 China Traffic Management Laboratory for High-Speed Railway Natl. Engineering Research Center of System Technology for High-Speed Railway and Urban Rail Transit Beijing100081 China Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China

ISBN: (纸本)9798350316339

This paper investigates angular coverage under uncertainty (ACU). A compact integer programming (IP) formulation is developed to model the angular field-of-view (FoV) of sensors and probabilistic coverage under uncertainty. The IP formulation minimizes the weighted non-coverage probability over the target set as well as considering the practical colocation and budget constraints. Recognizing the non-linearity, non-convexity, and non-separability of ACU, we first introduce the reformulation-linearisation technique (RLT) to obtain a tractable mixed-integer linear programming model which provides a tight lower bound for the original problem. Further, we exploit the structure of the mathematical model and customize a branch-and-cut (B&C) algorithm to solve the derived problem exactly. We show that the solution for the derived problem can also solve the original problem based on the bounding scheme. Computational experiments on a series of problem instances ranging from moderate to large size scaling up to 4,000 dimensional decision variables reveal the effectiveness and efficiency of the proposed exact approach. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Cargo Forecasting and Staff Scheduling Model Based on BP Neural Network Model and integer programming 4

Cargo Forecasting and Staff Scheduling Model Based on BP Neu...

引用

4th International Signal Processing, Communications and Engineering Management Conference, ISPCEM 2024

作者： Haonan, Zhang Capital University of Economics and Business Beijing China

ISBN: (纸本)9798331528676

In this paper, the first prediction is made through BP neural network model. And according to the graph and related data, it is found that the prediction results can be well in line with the trend, and the prediction results are more accurate. Finally, according to the discrete nature of scheduling personnel and constraints, a scheduling model based on integer planning is established, and reasonable scheduling of employees is realized under the conditions of the given data. In further validation, by changing the parameter definitions, decision variables, objective functions and constraints, it is possible to verify whether the attendance rate of employees and the number of employees attending every day meet the requirements according to the actual data, which reflects the better applicability of the model in this paper. ©2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

integer programming for the Maximum Cut Problem: A Refined Model and Implications for Branching 2

Integer Programming for the Maximum Cut Problem: A Refined M...

引用

2nd SIAM Conference on Applied and Computational Discrete Algorithms (ACDA)

作者： Charfreitag, Jonas Mallach, Sven Mutzel, Petra Univ Bonn Dept Comp Sci Bonn Germany Univ Bonn Lamarr Inst Machine Learning & Artificial Intelli Bonn Germany Univ Bonn High Performance Comp & Analyt Lab Bonn Germany

ISBN: (纸本)9781611977714

We present a refined integer programming model for the Maximum Cut problem along with new and extended structural results. Through the relationship between odd-cycle inequalities and parity constraints we uncover a fast separation routine, and a further analysis of the impact of partitioning decisions leads to a new branching rule. In our computational comparison of branching strategies, we demonstrate a significant impact of our model and techniques on state-of-the-art branch-and-cut algorithms and show that our branching rule improves over previous problem-specific ones.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Bounding the final rank during a round robin tournament with integer programming

引用

OPERATIONAL RESEARCH 2022年第1期22卷 123-131页

作者： Gotzes, Uwe Hoppmann, Kai Univ Duisburg Essen Fac Math D-47048 Duisburg Germany Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany

This article is mainly motivated by the urge to answer two kinds of questions regarding the Bundesliga, which is Germany's primary football (soccer) division having the highest average stadium attendance worldwide: "At any point in the season, what is the lowest final rank a certain team can achieve?" and "At any point in the season, what is the highest final rank a certain team can achieve?". Although we focus on the Bundesliga in particular, the integer programming formulations we introduce to answer these questions can easily be adapted to a variety of other league systems and tournaments.

关键词： Round robin tournaments Standings estimations integer linear programming Football

来源：评论

学校读者我要写书评

暂无评论

Hierarchical goal programming approaches to solve a discrete-time formulation for the aircraft recovery problem of a Brazilian oil and gas company

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2025年第3期32卷 1343-1374页

作者： Fantazzini, Tarley Mansur Vieira, Thiago Morabito, Reinaldo Munari, Pedro Univ Fed Sao Carlos Dept Prod Engn BR-13565905 Sao Carlos SP Brazil

We address the aircraft recovery problem faced by a Brazilian oil and gas company during its offshore operations. This problem involves hiring helicopters from an outsourced company to transport personnel from an airport to maritime units. The performed flights are subject to disruptions and might require rescheduling. To assist with decision-making in such situations, we introduce a discrete-time integer linear programming (ILP) model that considers company-specific attributes, including a lexicographic objective function that prioritizes (i) the reduction of flight transfers to the next day;(ii) the reduction of helicopter utilization;and (iii) the reduction of flight delays of the day. We develop four different solution approaches using hierarchical goal programming based on the proposed model, aided by enhancements and valid inequalities. Computational experiments using both real-world and simulated instances demonstrate that our approaches can provide effective solutions for most instances using a general-purpose ILP solver within acceptable computation times.

关键词： aircraft recovery problem helicopter flights integer linear programming goal programming offshore platforms oil and gas companies

来源：评论

学校读者我要写书评

暂无评论

integer linear programming for Speaker Diarization and Cross-Modal Identification in TV Broadcast

Integer Linear Programming for Speaker Diarization and Cross...

引用

14th Annual Conference of the International-Speech-Communication-Association (INTERSPEECH 2013)

作者： Bredin, Herve Poignant, Johann Univ Paris Sud CNRS LIMSI UPR 3251 Orsay France UJF Grenoble 1 UPMF Grenoble 2 Grenoble INP CNRSLIG UMR 5217 Grenoble France

ISBN: (纸本)9781629934433

Most state-of-the-art approaches address speaker diarization as a hierarchical agglomerative clustering problem in the audio domain. In this paper, we propose to revisit one of them: speech turns clustering based on the Bayesian Information Criterion (a.k.a. BIC clustering). First, we show how to model it as an integer linear programming (ILP) problem. Its resolution leads to the same overall diarization error rate as standard BIC clustering but generates significantly purer speaker clusters. Then, we describe how this approach can easily be extended to the audiovisual domain and TV broadcast in particular. The straightforward integration of detected overlaid names (used to introduce guests or journalists, and obtained via video OCR) into a multimodal ILP problem yields significantly better speaker diarization results. Finally, we explain how this novel paradigm can incidentally be used for unsupervised speaker identification (i.e. not relying on any prior acoustic speaker models). Experiments on the REPERE TV broadcast corpus show that it achieves performance close to that of an oracle capable of identifying any speaker as long as their name appears on screen at least once in the video.

关键词： speaker diarization integer linear programming speaker identification multimodal fusion optical character recognition

来源：评论

学校读者我要写书评

暂无评论

Modeling a Location and Routing Problem for Mobile Lockers in Last-Mile Delivery With Horizontal Collaboration

引用

NETWORKS 2025年第0期

作者： Korkmaz, Simay Goksu Soysal, Mehmet Sel, Cagri Dundar, Hasan Univ Turkish Aeronaut Assoc Dept Logist Management Ankara Turkiye Hacettepe Univ Dept Business Adm Operat Management Ankara Turkiye Karabuk Univ Dept Ind Engn Karabuk Turkiye Cankiri Karatekin Univ Dept Business Adm Cankiri Turkiye

Due to the growth of e-commerce, promising last-mile delivery options have emerged to manage the rise in delivery frequency and small-volume deliveries. These delivery methods include mobile parcel lockers that are placed by electric vehicles, which enables customers to receive their packages at any time. This study presents a decision support model for enterprises that utilize mobile parcel lockers in last-mile delivery with pick-up and delivery under horizontal collaboration. The model aims to allocate parcel lockers and route the vehicles with the minimum cost, which encompasses the expenses associated with transportation and placement of the lockers, transportation of customer cargo, vehicle utilization, and payment of drivers. We propose an integer linear programming model for the location routing problem. We present an ILP-based decomposition heuristic and an iterative approach to larger-sized practical instances. A numerical analysis is conducted to see the cost and benefit of bilateral and trilateral collaborations in an illustrative case. According to the results, the total cost is reduced by up to 4.52% for companies in the trilateral collaboration scenario with single warehouses, and by up to 7.32% in the trilateral collaboration scenario with multiple warehouses. We examine the large problem sizes of up to 100 nodes to see the performance of the heuristic approaches compared to the model solutions. The two-stage heuristic achieves the optimal solutions for all instances with a node size 50 in a shorter solution time. The iterative approach allows us to deal with the problem complexity of instances with 75 and 100 nodes and yields 0.88% close solutions to the model on average.

关键词： horizontal collaboration integer linear programming last-mile delivery location and routing problem mobile parcel locker

来源：评论

学校读者我要写书评

暂无评论

An ILP-based exact approach for solving the variable cost and size bin packing problem with time-dependent cost modeling the shared satellite-based last-mile delivery

引用

COMPUTERS & OPERATIONS RESEARCH 2025年 180卷

作者： Bargetto, Roberto Bruni, Maria Elena Perboli, Guido Politecn Torino Corso Duca Abruzzi 24 I-10129 Turin Italy Univ Calabria Via Pietro Bucci I-87036 Arcavacata Di Rende Italy CIRRELT Montreal PQ Canada

In the nowadays common two-tier logistic systems for delivering products in urban areas, the last leg of the distribution chain, the so-called last mile, is by far the most problematic. The modeling of the last-mile delivery problem as a variable cost and size bin packing problem with time-dependent costs emerged recently as the best solution for planning the delivery operations. No exact solution has been yet proposed for efficiently solving this variant of the bin packing problem. In this paper, we present a new problem formulation and devise an exact branch-and-bound method for effective and efficient problem resolution. Upon the resulting tailored solution approach, we devise a procedure to speed up the problem resolution further. Numerical results collected on large-sized instances reveal the dramatic reduction of the computation time obtained with our solution approach, which turns out to be up to ten times faster than the commercial solver. The improvement in solving large-sized instances with a relatively easy-to-implement approach is remarkably relevant for real-world applications.

关键词： Last-mile delivery Variable cost and size bin packing Bin packing integer linear programming Exact algorithm

来源：评论

学校读者我要写书评

暂无评论

A Bigram Based ILP Formulation for Break Minimization in Sports Scheduling Problems

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2025年第3期E108D卷 192-200页

作者： Fujii, Koichi Matsui, Tomomi Tokyo Inst Technol Univ Dept Ind Engn & Econ Tokyo 1528550 Japan

Constructing a suitable schedule for sports competitions is a crucial issue in sports scheduling. The round-robin tournament is a competition adopted in many professional sports. For most round-robin tournaments, it is considered undesirable that a team plays consecutive away or home matches;such an occurrence is called a break. Accordingly, it is preferable to reduce the number of breaks in a tournament. A common approach is to first construct a schedule and then determine a home-away assignment based on the given schedule to minimize the number of breaks (first-schedule-then-break). In this study, we concentrate on the problem that arises at the second stage of the first-schedule-then-break approach, namely, the break minimization problem (BMP). We propose a novel integer linear programming formulation called the "bigram based formulation." The computational experiments show its effectiveness over the well-known integer linear programming formulation. We also investigate its valid inequalities, which further enhances the computational performance.

关键词： key sports scheduling tournament scheduling round robin graph theory integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Revisit Optimal PMU Placement With Full Zero-Injection Cluster and Redundancy Sharing

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2025年第3期40卷 2700-2710页

作者： Ye, Hongxing Tian, Chuyue Ge, Yinyin Wu, Lei Dept Automat Sci & Engn Xian 710049 Peoples R China Xi An Jiao Tong Univ Dept Cyber Sci & Engn Xian 710049 Peoples R China Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA

Due to the expensive deployment cost, finding the minimum Phasor Measurement Unit (PMU) to meet the observability requirement has been attractive since the invention of PMU. Many research efforts have been put to zero-injection nodes (ZINs) in optimal PMU placement (OPP). We revisit OPP and define a full Zero-injection cluster (ZIC) as a set of nodes adjacent to ZINs together with at least one ZIN, establishing a novel ZIC-based OPP model. Compared with the existing literature, the full ZIC can cover more nodes, resulting in a better solution. To find all full ZIC, we propose a dynamic adjacency matrix based full-ZIC search algorithm, which has quadratic-time complexity. It could have wide applications, and can be applied in many OPP works. Besides, redundant PMUs within the full ZIC can be shared within large areas post contingency. A concept of redundancy sharing is proposed for post-contingency ZIC model, whose observability can be guaranteed with proposed redundancy-sharing conditions. Comprehensive case studies are conducted using the proposed approaches. The simulation results for both IEEE cases and a real-world system show the proposed method can further reduce PMU deployment number.

关键词： Phasor measurement units Observability integer linear programming Genetic algorithms Current measurement Termination of employment Mathematical models Optimal PMU placement zero-injection cluster cluster search redundancy sharing integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：