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

10th IFAC Triennial Conference on Manufacturing Modelling, Management and Control (MIM)

作者： Delorme, Xavier Gianessi, Paolo Univ Clermont Auvergne Mines St Etienne INP Clermont Auvergne CNRSUMR 6158 LIMOS F-42023 St Etienne France

Industry is more and more urged towards energy efficiency by the increasing societal and environmental concern about energy. This is also true for more recent production system types, like Reconfigurable Manufacturing Systems (RMS), which are gaining momentum due to the advent of Industry 4.0 and the growing uncertainty of markets. In this work, we consider energy efficiency in the design stage of an RMS. The tasks of a production process must be assigned to the machines of a Parallel-Serial manufacturing line, and scheduled, so that the related power consumption peak is minimized. An integer linear programming formulation is proposed and tested on a set of benchmark instances. Numerical results are discussed. Copyright (C) 2022 The Authors.

关键词： Reconfigurable Manufacturing System Assembly Line Balancing Operations Scheduling Power Peak integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Speeding Up Optimal Modulo Scheduling with Rational Initiation Intervals 32

Speeding Up Optimal Modulo Scheduling with Rational Initiati...

引用

32nd International Conference on Field-Programmable Logic and Applications (FPL)

作者： Fiege, Nicolai Sittel, Patrick Zipf, Peter Univ Kassel Digital Technol Grp Kassel Germany

ISBN: (纸本)9781665473903

Compared to integer initiation intervals (II), rational IIs improve throughput achieved by loop pipelining in many cases. This comes at the expense of a higher need for data path elements (i.e., multiplexers and registers) and the need for solving more complex scheduling problems. To optimally solve these problems, we improved an existing ILP formulation for latency-optimal modulo scheduling with rational IIs that now finds 6.08x more solutions and 6.10x as many optimal ones within the same time budget. Compared to the best alternative from previous work, our improved algorithm finds 1.15x more solutions and 2.97x as many optimal ones.

关键词： High-level synthesis integer linear programming optimal scheduling

来源：评论

学校读者我要写书评

暂无评论

Exploring fairness in food delivery routing and scheduling problems

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 240卷

作者： Martinez-Sykora, Antonio McLeod, Fraser Cherrett, Tom Friday, Adrian Univ Southampton Ctr Operat Res Management Sci & Informat Syst CORM Southampton England Univ Southampton Transportat Res Grp Southampton England Univ Lancaster Dept Comp & Commun Lancaster England

Demand for delivery of take -away meals to customers has been growing worldwide, with deliveries often performed by non -specialised gig economy couriers working for online platform operators such as Deliveroo or Just Eat. This has led to the introduction of the 'meal delivery problem', characterised by a series of individual pickup and delivery tasks to be assigned to available couriers. While there is a vast set of algorithms proposed in the literature that aim to minimise total workload, very little attention has been given to equitably distributing work between couriers. We propose a new multi -objective problem that is aiming at distributing orders equitably between couriers as well as minimising total workload, where all information is known upfront. We propose an integer linear programming (ILP) model with a weighted objective function that is used to derive the Pareto front in small-scale problems by exploiting the epsilon-constraint approach. This formulation has been proven to solve in a reasonable time for problems with up to 60 orders, however, the optimal Pareto front can only be computed within a reasonable time for problems up to 30 orders. For problems with more orders, we propose a Variable Neighbourhood Search (VNS) algorithm, for which the fitness evaluation evolves in order to explore a wider set of the solution space. The VNS is compared against the ILP and also tested on more realistic size instances with up to 3123 orders, improving the performance over the business as usual and shows that equitable distribution of work can be achieved alongside reducing the total travelled distance.

关键词： Food delivery Vehicle routing Fairness Variable neighbourhood search integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Resource Optimal Squarers for FPGAs 32

Resource Optimal Squarers for FPGAs

引用

32nd International Conference on Field-Programmable Logic and Applications (FPL)

作者： Boettcher, Andreas Kumm, Martin de Dinechin, Florent Fulda Univ Appl Sci Fulda Germany Univ Lyon INSA Lyon INRIA CITI Lyon France

ISBN: (纸本)9781665473903

Squaring is an essential operation in computer arithmetic that can be considered as a special case of multiplication where several simplifications can be applied to reduce the complexity of the resulting circuit. However, the design of a squarer is not straightforward for modern FPGAs that provide embedded DSP blocks and look-up-tables (LUTs). This work proposes a flexible method to design resource optimal squarers, i.e., a squarer that uses a minimum number of LUTs for a user-defined number of DSP blocks. The method uses an integer linear programming (ILP) formulation based on a generalization of multiplier tiling. It is shown that the proposed squarer design method significantly improves the LUT utilization for a given number of DSPs over previous methods, while maintaining a similar critical path delay and latency.

关键词： squarer multiplier tiling compressor tree integer linear programming computer arithmetic

来源：评论

学校读者我要写书评

暂无评论

An ILP Approach for the Maintenance Crew Scheduling Problem Considering Skillsets 1

引用

International Congress and Workshop on Industrial Artificial Intelligence (IAI)

作者： Alves, Tiago Andrade, Antonio R. Univ Lisbon Inst Super Tecn IDMEC Av Rovisco Pais 1 P-1049001 Lisbon Portugal

ISBN: (数字)9783030936396

ISBN: (纸本)9783030936396;9783030936389

Public transportation services are essential to any metropolitan area. To meet the rising passenger demand, emergent and disruptive technologies have been used for the railway sector. This paper assesses the maintenance crew scheduling problem and presents a mathematical programming model which optimizes the daily scheduling of technicians in a railway depot. The aim consists in minimizing the labour costs, while assigning maintenance workers to maintenance tasks, considering the skillset required for each one of them. In fact, this is the key aspect added to the literature by the present maintenance crew scheduling model: the skills of technicians. Using data collected from a Portuguese train operating company, an integer linear programming model is formulated and applied to the case study while monitoring the rolling stock schedule and the maintenance tactical plan. The optimized results indicate that the maintenance team could be reduced, suggesting that maintenance crew scheduling and associated labour conditions may need more flexible approaches. This model is also part a broader framework, as it is connected to two different models: a tactical maintenance planning model, and an operational maintenance scheduling model. All together, these models provide a decision framework that can support maintenance planning and scheduling decisions.

关键词： Railway management Operations research Maintenance Crew scheduling integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An ILP-based Approach to Delivery Drone Routing under Load-dependent Flight Speed

An ILP-based Approach to Delivery Drone Routing under Load-d...

引用

International Conference on Electronics, Information, and Communication (ICEIC)

作者： Nishira, Mao Ito, Satoshi Nishikawa, Hiroki Kong, Xiangbo Tomiyama, Hiroyuki Ritsumeikan Univ Kyoto Japan Japan Soc Promot Sci Tokyo Japan

ISBN: (纸本)9781665409346

This paper proposes an integer linear programming (ILP) -based approach to delivery drone routing under load-dependent flight speed. Drone routing problems are attracting attention due to the increasing importance of drone delivery as a courier service. In general, delivery time is one of the most crucial concerns for both customers and couriers. Experiments demonstrate that the ILP-based approach can efficiently find a flight route in such a way that the overall delivery time is minimized, compared to the state-of-the-art methods.

关键词： Delivery drones Vehicle routing problem Flight speed-aware vehicle routing problem integer linear programming linear Approximation

来源：评论

学校读者我要写书评

暂无评论

Graph-context Attention Networks for Size-varied Deep Graph Matching

Graph-context Attention Networks for Size-varied Deep Graph ...

引用

IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Jiang, Zheheng Rahmani, Hossein Angelov, Plamen Black, Sue Williams, Bryan M. Lancaster Univ Bailrigg Lancaster LA1 4WA England

ISBN: (数字)9781665469463

ISBN: (纸本)9781665469463

Deep learning for graph matching has received growing interest and developed rapidly in the past decade. Although recent deep graph matching methods have shown excellent performance on matching between graphs of equal size in the computer vision area, the size-varied graph matching problem, where the number of keypoints in the images of the same category may vary due to occlusion, is still an open and challenging problem. To tackle this, we firstly propose to formulate the combinatorial problem of graph matching as an integer linear programming (ILP) problem, which is more flexible and efficient to facilitate comparing graphs of varied sizes. A novel Graph-context Attention Network (GCAN), which jointly capture intrinsic graph structure and cross-graph information for improving the discrimination of node features, is then proposed and trained to resolve this ILP problem with node correspondence supervision. We further show that the proposed GCAN model is efficient to resolve the graph-level matching problem and is able to automatically learn node-to-node similarity via graph-level matching. The proposed approach is evaluated on three public keypoint-matching datasets and one graph-matching dataset for blood vessel patterns, with experimental results showing its superior performance over existing state-of-the-art algorithms for keypoint and graph-level matching.

关键词： Training Deep learning Computer vision Neural networks integer linear programming Blood vessels Pattern matching

来源：评论

学校读者我要写书评

暂无评论

A Practical Model for Optimal PMU Placement

A Practical Model for Optimal PMU Placement

引用

International Conference on Smart Grid Synchronized Measurements and Analytics (SGSMA)

作者： Farrokhifard, Mohammadreza Maddipour Zheng, Gang Parashar, Manu Sukhavasi, Vijay GE Digital Bothell WA 98011 USA GE Digital Vancouver BC Canada

ISBN: (纸本)9781665498234

In this paper, a practical model for the problem of Optimal PMU Placement (OPP) is proposed. Most of the well-studied OPP models have been developed based on the standard small test systems with minimum focus on the practical points of view and implementation challenges. Therefore, the practical points of view such as phased installation of PMUs based on voltage levels, buses preconditioning, PMUs outage contingencies, etc., are considered in this paper to modify the problem objective function and constraints and improve the model. A practical implementation for this model is also proposed in the paper. The proposed model and implementation are tested in multiple small- and large-scale test systems such as IEEE 14-, 30-, 57-, 118-, and 300-bus test systems as well as WECC 240-bus test system. Five test cases are designed to reflect different practical conditions in the OPP problem. Results of different case studies on different test systems confirm that the proposed model and implementation not only cover the practical scenarios, but also improve the performance in terms of minimizing the number of PMUs in some scenarios for large-scale systems.

关键词： phasor measurement unit (PMU) optimal placement integer linear programming contingency

来源：评论

学校读者我要写书评

暂无评论

A matheuristic for parallel machine scheduling with tool replacements

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021年第2期291卷 640-660页

作者： Dang, Quang-Vinh van Diessen, Thijs Martagan, Tugce Adan, Ivo Eindhoven Univ Technol Dept Ind Engn & Innovat Sci POB 513 NL-5600 MB Eindhoven Netherlands

This paper addresses the problem of scheduling a set of jobs with tool requirements on identical parallel machines in a work center. This problem considers the following characteristics. First, each job may consist of an ordered set of operations due to reentrance to the work center. Moreover, operations have release times and due dates, and the processing of operations requires different tool sets of different sizes. Last, the objective is to minimize both tardiness of operations and tool setup times. Decisions concern the assignment of operations to machines, sequencing of operations, and replacement of tool sets on machines. We propose a mathematical model for the problem and a new matheuristic that combines a genetic algorithm and an integer linear programming formulation to solve industry-size instances. In the matheuristic, we propose two crossover operators which exploit the structure of the problem. We illustrate this approach through real-world case studies. Computational experiments show that our matheuristic outperforms the mathematical model and a practitioner heuristic. We also generate managerial insights by quantifying the potential room for improvement in current practice. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Flexible manufacturing systems Scheduling Tool switching Genetic algorithm integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The multi-terminal vertex separator problem: Branch-and-Cut-and-Price

引用

DISCRETE APPLIED MATHEMATICS 2021年 290卷 86-111页

作者： Magnouche, Y. Mahjoub, A. R. Martin, S. PSL Res Univ Univ Paris Dauphine CNRS UMR 7243LAMSADE F-75016 Paris France Univ Lorraine Lab Concept Optimisat & Modelisat Syst Metz France

We are given a graph G = (V boolean OR T, E), with V boolean OR T the set of vertices where T is a set of terminals and E the set of edges. The multi-terminal vertex separator problem consists in finding a subset of vertices S subset of V of minimum size intersecting all paths between every pair of terminals. In this paper we present three extended linear integer programming formulations for the multi-terminal vertex separator problem and we develop Branch-and-Price and Branch-and-Cut-and-Price algorithms. For each formulation we present the pricing problem, the branching scheme and the computation of the dual bound used during the column generation phase. Computational results are reported comparing the performance of the formulations on a set of instances. (C) 2020 Published by Elsevier B.V.

关键词： Vertex separator problem integer linear programming Combinatorial optimization Column generation Branch-and-Price Branch-and-Cut-and-Price

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：