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

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

作者： Roetzer, Paul Swoboda, Paul Cremers, Daniel Bernard, Florian Tech Univ Munich Munich Germany Univ Bonn Bonn Germany MPI Informat Saarbrucken Germany

ISBN: (数字)9781665469463

ISBN: (纸本)9781665469463

We present a scalable combinatorial algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We use the mathematically elegant formalism proposed by Windheuser et al. [66] where 3D shape matching was formulated as an integer linear program over the space of orientation-preserving diffeomorphisms. Until now, the resulting formulation had limited practical applicability due to its complicated constraint structure and its large size. We propose a novel primal heuristic coupled with a Lagrange dual problem that is several orders of magnitudes faster compared to previous solvers. This allows us to handle shapes with substantially more triangles than previously solvable. We demonstrate compelling results on diverse datasets, and, even showcase that we can address the challenging setting of matching two partial shapes without availability of complete shapes.

关键词： Computer vision Three-dimensional displays Codes Shape integer linear programming Pattern recognition Optimization

来源：评论

学校读者我要写书评

暂无评论

High Density Automated Valet Parking via Multi-agent Path Finding 25

High Density Automated Valet Parking via Multi-agent Path Fi...

引用

IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)

作者： Okoso, Ayano Otaki, Keisuke Koide, Satoshi Nishi, Tomoki Toyota Cent Res & Dev Labs Inc Bunkyo Ku Koraku Mori Bldg 10171-4-14 Koraku Tokyo 1120004 Japan

ISBN: (数字)9781665468800

ISBN: (纸本)9781665468800

Improving the land use of parking lots is an essential component of good urban planning. To this end, many planners have introduced cooperative automated valet parking (Co-AVP) systems that realize high-density parking (HDP). Effective HDP requires the relocation of vehicles that blocks other vehicles from entering and leaving the Co-AVP. This paper proposes and solves a destination-assignment and path-planning problem for multiple vehicles with three roles: entering, leaving, and relocating. We minimize the total travel time of leaving vehicles and the total travel distance of entering and relocating vehicles from a service-policy viewpoint. We then propose two methods, integer linear programming (ILP)-based and conflictbased search (CBS)-based, for solving the problem. Numerical experiments demonstrated that the ILP-based approach scales better than the CBS-based approach. We also confirmed the applicability of our approaches to realistic parking situations.

关键词： Urban planning Kinematics integer linear programming Search problems Path planning Optimization Intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

A Minmax Utilization Algorithm for Network Traffic Scheduling of Industrial Robots

A Minmax Utilization Algorithm for Network Traffic Schedulin...

引用

IEEE International Conference on Communications (ICC)

作者： Wang, Yantong Friderikos, Vasilis Andraos, Sebastian Shandong Normal Univ Sch Informat Sci & Engn Jinan Peoples R China Kings Coll London Dept Engn London WC2R 2LS England HAL Robot Ltd 115 Coventry Rd London E2 6GG England

ISBN: (数字)9781538683477

ISBN: (纸本)9781538683477

Emerging 5G and beyond wireless industrial virtualized networks are expected to support a significant number of robotic manipulators. Depending on the processes involved, these industrial robots might result in significant volume of multi-modal traffic that will need to traverse the network all the way to the (public/private) edge cloud, where advanced processing, control and service orchestration will be taking place. In this paper, we perform the traffic engineering by capitalizing on the underlying pseudo-deterministic nature of the repetitive processes of robotic manipulators in an industrial environment and propose an integer linear programming (ILP) model to minimize the maximum aggregate traffic in the network. The task sequence and time gap requirements are also considered in the proposed model. To tackle the curse of dimensionality in ILP, we provide a random search algorithm with quadratic time complexity. Numerical investigations reveal that the proposed scheme can reduce the peak data rate up to 53.4% compared with the nominal case where robotic manipulators operate in an uncoordinated fashion, resulting in significant improvement in the utilization of the underlying network resources.

关键词： integer linear programming Industrial Robots Network Traffic Scheduling Network Optimization Industry 4.0

来源：评论

学校读者我要写书评

暂无评论

Minimal voting paradoxes

引用

JOURNAL OF THEORETICAL POLITICS 2022年第4期34卷 527-551页

作者： Brandt, Felix Matthaeus, Marie Saile, Christian Tech Univ Munich Munich Germany

Voting paradoxes date back to the origin of social choice theory in the 18th century, when the Chevalier de Borda pointed out that plurality-then and now the most common voting rule-may elect a candidate who loses pairwise majority comparisons against every other candidate. Since then, a large number of similar, seemingly paradoxical, phenomena have been observed in the literature. As it turns out, many paradoxes only materialize under some rather contrived circumstances and require a certain number of voters and candidates. In this paper, we leverage computational optimization techniques to identify the minimal numbers of voters and candidates that are required for the most common voting paradoxes to materialize. The resulting compilation of voting paradoxes may serve as a useful reference to social choice theorists as well as an argument for the deployment of certain rules when the numbers of voters or candidates are severely restricted.

关键词： Social choice theory voting paradoxes integer linear programming computational social choice

来源：评论

学校读者我要写书评

暂无评论

A Case Study for Minimal Cost Shopping in a Cluster of Online Stores 24

A Case Study for Minimal Cost Shopping in a Cluster of Onlin...

引用

24th International Conference on Enterprise Information Systems (ICEIS)

作者： Nakao Franca, Thiago Alexandre Campiolo, Rodrigo Xavier Candido, Lilian Caroline Univ Tecnol Fed Parana Dept Comp Sci Campo Mourao Parana Brazil Univ Tecnol Fed Parana Dept Math Campo Mourao Parana Brazil

ISBN: (纸本)9789897585692

This work proposes and evaluates mechanisms to converge to the purchase configuration with minimal cost for a product list in an online stores cluster. We collected and stored product prices in a database, and used caching to reduce client response time. We designed, implemented, and compared two integer linear programming solutions to achieve purchase configuration with minimal cost. A case study was conducted to evaluate these mechanisms. The results demonstrated that developed mechanisms found optimal solutions with response time guarantees. Empirical tests in the case study with 100 different products and 118 providers converged in about 9 seconds.

关键词： Web Crawler integer linear programming Caching e-Commerce

来源：评论

学校读者我要写书评

暂无评论

Arterial Signal Coordination Optimization Model Based on All-Direction Pairs at Intersections

引用

JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS 2024年第8期150卷

作者： Zhang, Peng Wang, Kai Sun, Chao Li, Wenquan Jiangsu Univ Sch Automot & Transportat Engn Dept Transportat Engn 301Xuefu Rd Zhenjiang 212013 Jiangsu Provinc Peoples R China

The current arterial signal coordination models only target through traffic or critical traffic, resulting in fairness issues for traffic in other directions. Moreover, these models fail to achieve system optimality between intersections along the arterial. To address these problems, this paper establishes an arterial signal coordination optimization model based on all-direction pairs of adjacent intersections. The model takes the minimum weighted green wave band center offset of all-direction pairs at the intersections as the objective function. The optimization variables are the cycle length, offset, and phase sequence. The phase sequence structure adopts the ring-and-barrier structure, and the phase sequence optimization includes not only the main road but also the minor road intersecting with it. The model is an integer linear programming model, and it optimizes all-direction pairs of the upstream and downstream intersections. By analyzing the spatiotemporal diagram of the intersections, constraints are established for the phase sequence of the main road and intersecting roads. Through optimization of the offset and phase sequence, the coordination of flow direction pairs between upstream and downstream intersections can be optimized to improve the overall traffic fairness of the arterial.

关键词： Traffic control Arterial progression integer linear programming Phase sequence optimization All-direction pairs

来源：评论

学校读者我要写书评

暂无评论

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

引用

COMPUTERS & OPERATIONS RESEARCH 2024年 163卷

作者： Caselli, Giulia Delorme, Maxence Iori, Manuel Magni, Carlo Alberto Univ Modena & Reggio Emilia Sch Doctorate Engn Econ Econ Engn E4E Largo Marco Biagi 10 I-41121 Modena Italy Tilburg Univ Dept Econometr & Operat Res Warandelaan 2 NL-5037 AB Tilburg Netherlands Univ Modena & Reggio Emilia Dept Sci & Methods Engn Via Amendola 2 I-42122 Reggio Emilia Italy

We address a real-world scheduling problem where the objective is to allocate a set of tasks to a set of machines and to a set of workers in such a way that the total weighted tardiness is minimized. Our case study encompasses four types of constraints: precedence, resource, eligibility, and contiguity. While the first three constraints are common in the scheduling literature, contiguity constraints, which can be defined as a form of precedence constraints that requires both a predecessor and its successor to be processed on the same machine with no intermediate jobs in-between (but idle time is allowed), have never been studied in the literature. We present four exact methods to solve the problem: two methods use integer linear programming, one uses constraint programming, and one uses a combinatorial Benders' decomposition. We introduce method specific strategies to model the contiguity constraints for each of the proposed methods. We empirically evaluate, through an extensive set of computational experiments, the performance of the four methods on a heterogeneous dataset composed of real, realistic, and random instances, and outline that every method offers a competitive advantage on a targeted subset of instances. We also show that our algorithms can be generalized to solve related scheduling problems with contiguity constraints.

关键词： Scheduling integer linear programming Constraint programming Combinatorial Benders' decomposition Resource constraints

来源：评论

学校读者我要写书评

暂无评论

A novel healthcare resource allocation decision support tool: A forecasting-simulation-optimization approach

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2021年第3期72卷 485-500页

作者： Ordu, Muhammed Demir, Eren Tofallis, Chris Gunal, Murat M. Osmaniye Korkut Ata Univ Osmaniye Turkey Univ Hertfordshire Hatfield Herts England Natl Def Univ Istanbul Turkey

The increasing pressures on the healthcare system in the UK are well documented. The solution lies in making best use of existing resources (e.g. beds), as additional funding is not available. Increasing demand and capacity shortages are experienced across all specialties and services in hospitals. Modelling at this level of detail is a necessity, as all the services are interconnected, and cannot be assumed to be independent of each other. Our review of the literature revealed two facts;First an entire hospital model is rare, and second, use of multiple OR techniques are applied more frequently in recent years. Hybrid models which combine forecasting, simulation and optimization are becoming more popular. We developed a model that linked each and every service and specialty including A&E, and outpatient and inpatient services, with the aim of, (1) forecasting demand for all the specialties, (2) capturing all the uncertainties of patient pathway within a hospital setting using discrete event simulation, and (3) developing a linear optimization model to estimate the required bed capacity and staff needs of a mid-size hospital in England (using essential outputs from simulation). These results will bring a different perspective to key decision makers with a decision support tool for short and long term strategic planning to make rational and realistic plans, and highlight the benefits of hybrid models.

关键词： Healthcare decision support system forecasting discrete event simulation integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Mixed-Model Assembly Line Design with New Product Variants in Production Generations 10th

Mixed-Model Assembly Line Design with New Product Variants i...

引用

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

作者： Hashemi-Petroodi, S. Ehsan Thevenin, Simon Dolgui, Alexandre IMT Atlantique LS2N CNRS 4 Rue Alfred KastlerBP 20722 F-44307 Nantes 3 France

Among all the challenges which highlight the need of reconfigurability in manufacturing systems, taking into account the introduction of a new product has been rarely considered by the researchers. Indeed, taking into account the new product variants in the future production generation of the line at the initial design stage smooths the reconfiguration process of the line. This paper studies a mixed-model assembly line reconfiguration planning problem where the line consists of several resources (workers and robots). This study aims to design a line which produces a given product family with a set of product variants, and a new product variant will be added after a certain period of time, named production generation. At each generation, the production family can change with the addition/removal of a product variant. Therefore, the line needs to be reconfigured at each generation. We propose a new Mixed-integer linear programming (MILP) which aims to minimize the total reconfiguration effort, the total cost of designing and reconfiguring the line taking into account the buying, selling, re-assigning the equipment and resources in the worst scenario of possible product families which are produced in several production generation. The MILP is validated through solving a simple example, and the results are given. Copyright (C) 2022 The Authors.

关键词： Mixed-model assembly line reconfigurability new product variants production generation integer linear programming robust optimization

来源：评论

学校读者我要写书评

暂无评论

A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons 1

引用

19th International Conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Auricchio, Gennaro Ferrarini, Luca Gualandi, Stefano Lanzarotto, Greta Pernazza, Ludovico Univ Pavia Dept Math Pavia Italy Univ Milano Bicocca Dept Math & Its Applicat Milan Italy INdAM Rome Italy Univ Strasbourg IRMA Strasbourg France

ISBN: (数字)9783031080111

ISBN: (纸本)9783031080111;9783031080104

In Mathematical Music theory, the Aperiodic Tiling Complements Problem consists in finding all the possible aperiodic complements of a given rhythm A. The complexity of this problem depends on the size of the period n of the canon and on the cardinality of the given rhythm A. The current state-of-the-art algorithms can solve instances with n smaller than 180. In this paper we propose an ILP formulation and a SAT Encoding to solve this mathemusical problem, and we use the Maplesat solver to enumerate all the aperiodic complements. We validate our SAT Encoding using several different periods and rhythms and we compute for the first time the complete list of aperiodic tiling complements of standard Vuza rhythms for canons of period n = {180, 420, 900}.

关键词： Mathematical models for music Aperiodic tiling rhythms SAT encoding integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：