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

21st International Conference on Enterprise Information Systems (ICEIS)

作者： Nofal, Samer Atkinson, Katie Dunne, Paul E. Hababeh, Ismail German Jordanian Univ Dept Comp Sci Madaba Jordan Univ Liverpool Dept Comp Sci Liverpool Merseyside England

ISBN: (纸本)9789897583728

The field of computational models of argument aims to provide support for automated reasoning through algorithms that operate on arguments and attack relations between them. In this paper we present a new labelling algorithm that lists all preferred extensions of an abstract argumentation framework. The new algorithm is enhanced by a new pruning strategy. We verified our new labelling algorithm and showed that it enumerates preferred extensions faster than the old labelling algorithm.

关键词： Abstract Argumentation Argumentation Semantics labelling Semantics Argumentation algorithm labelling algorithm Preferred Semantics

来源：评论

学校读者我要写书评

暂无评论

A simplex-based labelling algorithm for the linear fractional assignment problem

引用

OPTIMIZATION 2015年第4期64卷 929-939页

作者： Lin, Chi-Jen Ta Hwa Univ Sci & Technol Dept Ind Engn & Management Qionglin Hsin Chu County Taiwan

This paper constructs an algorithm to solve the fractional assignment problem. algorithms that are currently used are mostly based on parametric approaches and must solve a sequence of optimization procedures. They also neglect the difficulties caused by degeneracy. The proposed algorithm performs optimization once and overcomes degeneracy. The main features of the algorithm are an effective initial heuristic approach, a simple labelling procedure and an implicit primal-dual schema. A numerical example is presented and demonstrates that the proposed algorithm is easy to apply. Computational results are compared with those from other developed methods. The results show that the proposed algorithm is efficient.

关键词： 90B80 90C32 fractional assignment problem labelling algorithm

来源：评论

学校读者我要写书评

暂无评论

A tutorial on Branch-Price-and-Cut algorithms

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2025年第1期23卷 1-52页

作者： Petris, Matteo Archetti, Claudia Cattaruzza, Diego Ogier, Maxime Semet, Frederic Univ Lille Cent Lille UMR 9189CRIStAL InriaCNRS F-59000 Lille France Univ Brescia Dept Econ & Management I-25122 Brescia Italy Univ Udine Dept Math Comp Sci & Phys Via Sci 206 Udine 33100 Italy Univ Lille CNRS UMR 9189 INRIACent LilleCRIStAL F-59000 Lille France Inst Polytech Paris CERMICS ENPC Marne La Vallee France

This paper provides a tutorial on Branch-Price-and-Cut (BPC) algorithms for a generic class of problems whose objective is to find a set of feasible paths in a graph while optimising a given objective function. The tutorial is split into two main parts. First, we describe the building blocks of a BPC algorithm: the Branch-and-Bound algorithm, the column generation procedure and the Branch-and-Cut algorithm. Then, we focus on the description of a BPC algorithm for the class of problems we consider. Precisely, we present the classical and advanced techniques that should be embedded in an efficient algorithm. Particular attention is devoted to the solution of the pricing problem in the case where it is formulated as an Elementary Shortest Path Problem with Resource Constraints. The aim of the tutorial is pedagogical. Hence, its intended reader is someone facing the first implementation of a BPC algorithm. Implementation tips and examples accompany the techniques and concepts to ease their comprehension. Precisely, the examples are based on the Capacitated Vehicle Routing Problem, which is a well-known problem belonging to the class we consider.

关键词： Branch-Price-and-Cut Column generation labelling algorithm Shortest path with resource

来源：评论

学校读者我要写书评

暂无评论

Column generation for the collaborative multi-stop truckload shipping problem in daily regional distribution

引用

TRANSPORTMETRICA A-TRANSPORT SCIENCE 2024年

作者： Lai, Minghui Hu, Qian Xue, Weili Liu, Huajing Southeast Univ Sch Econ & Management Nanjing Peoples R China Nanjing Univ Sch Management & Engn Nanjing 210093 Peoples R China

Multi-stop truckload shipping offers less-than-truckload shippers a promising way to reduce their freight costs by consolidating freights en route, which is similar to ridesharing in the mobility industry. One significant challenge in practical implementation is designing attractive multi-stop routes that to shippers while conforming to carriers' requirements. It is crucial to develop an efficient optimisation algorithm to automate bundling decisions. However, this routeing problem is complicated by a nonlinear inseparable cost structure and new routeing decisions in the first pickup and last delivery points. We introduce a new variant of pickup and delivery model and propose a column generation algorithm to efficiently solve real-world multi-stop routeing problems. The algorithm utilises a new specialised labelling procedure that exclusively generates labels for pickup sequences and establishes new dominance rules. Theoretical results on the label dominance, algorithm complexity, and optimality gap are also established. We conduct a real-world case study, comparing our methodology against the enumeration method and a heuristic method documented in the literature. The computational results demonstrate the high efficiency of our method and reveal important insights for practitioners.

关键词： Multi-stop truckload less-than-truckload consolidation column generation labelling algorithm digital platform

来源：评论

学校读者我要写书评

暂无评论

A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing

引用

Journal of Management Science and Engineering 2023年第2期8卷 273-286页

作者： Lindong Liu Zhenyu Wu Yugang Yu School of Management University of Science and Technology of ChinaHefei230026China

Additive manufacturing(AM)has attracted significant attention in recent years based on its wide range of applications and growing *** offers the advantages of production flexibility and design *** this study,we considered a practical variant of the batch-processing-machine(BPM)scheduling problem that arises in AM industries,where an AM machine can process multiple parts simultaneously,as long as the twodimensional rectangular packing constraint is not *** on the set-partitioning formulation of our mixed-integer programming(MIP)model,a branch-and-price(B&P)algorithm was developed by embedding a column-generation technique into a branchand-bound ***,a novel labelling algorithm was developed to accelerate the column-generation *** is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM *** tested the performance of our algorithm using a modern MIP solver(Gurobi)and real data from a 3D printing *** results demonstrate that for most instances tested,our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.

关键词： Single-machine scheduling Branch and price labelling algorithm Additive manufacturing

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria shortest path for rough graph

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2018年第6期9卷 1835-1859页

作者： Majumder, Saibal Kar, Samarjit Natl Inst Technol Dept Comp Sci Durgapur 713209 India Natl Inst Technol Dept Math Durgapur 713209 India

Shortest path problem in real life applications has to deal with multiple criteria. This article intends to solve a proposed multi-criteria shortest path problem of a weighted connected directed network whose associated edge weights are represented as rough variables in order to tackle the imprecision. We have exhibited two different approaches to determine the optimum path (s) of the proposed problem. The first approach is the proposed modified rough Dijkstra's labelling algorithm. The second approach considers the rough chance constrained programming technique to formulate the proposed multi-criteria shortest path problem which is eventually solved by two different methods: the goal attainment method and the nondominated sorting genetic algorithm II. These methodologies are numerically illustrated for a multi-criteria weighted connected directed network. Moreover, the simulated results on similar networks of large order and size are analyzed to show the efficiency of the algorithms.

关键词： Rough variable Trust measure OWA operator Shortest path labelling algorithm Goal attainment method NSGA-II

来源：评论

学校读者我要写书评

暂无评论

New Labeling algorithm on Various Classes of Graphs with Applications

New Labeling Algorithm on Various Classes of Graphs with App...

引用

International Conference on Innovative Computing (ICIC)

作者： Shahbaz Ali Muhammad Khalid Mahmood Muhammad Haris Mateen University of the Punjab Lahore Lahore Pakistan

ISBN: (纸本)9781728146836

In order to develop an algorithm, computer theories are essential and often used in a mathematical sequence. Most of them without sufficient mathematics are difficult to understand. A mathematical algorithm is, therefore, a better guide to confirm whether or not a software is correct. This implies that a mathematical knowledge-based algorithm is of great concern. Let S={r1, r2, ...rφ(n)} be a set of all co-prime residues of a positive integer n. An integer is termed as totient if the sum of co-prime residues of n is 2 k n, k ≥ 1. A graph G with V and E be the set of vertices and edges of G respectively, then G is said to be a totient graph if there exists a one-one function h:V→ N, whose induced function h * :E→ N, defined by f * (ab)=f(a)f(b) assigns a totient number for each edge of G. In this piece of work, we propose new labeling algorithms for several classes of graphs.

关键词： Totient number Totient graph Totient wheel graph Totient labelling algorithm solidification piecing algorithms Vanadium Integer

来源：评论

学校读者我要写书评

暂无评论

A HYBRID COLUMN GENERATION algorithm BASED ON METAHEURISTIC OPTIMIZATION

引用

TRANSPORT 2016年第4期31卷 389-407页

作者： Hu, Wenbin Du, Bo Wu, Ye Liang, Huangle Peng, Chao Hu, Qi Wuhan Univ Sch Comp Wuhan Hubei Province Peoples R China

The exact solution and heuristic solution have their own strengths and weaknesses on solving the Vehicle Routing Problems with Time Windows (VRPTW). This paper proposes a hybrid Column Generation algorithm with Metaheuristic Optimization (CGAMO) to overcome their weaknesses. Firstly, a Modified labelling algorithm (MLA) in the sub-problem of path searching is analysed. And a search strategy in CGAMO based on the demand of sub-problem is proposed to improve the searching efficiency. While putting the paths found in the sub-problem into the main problems of CGAMO, the iterations may fall into endless loops. To avoid this problem and keep the main problems in a reasonable size, two conditions on saving the old paths in the main problem are used. These conditions enlarge the number of constraints considered in the iterations to strengthen the limits of dual variables. Through analysing the sub-problem, we can find many useless paths that have no effect on the objective function. Secondly, in order to reduce the number of useless paths and improve the efficiency, this paper proposes a heuristic optimization strategy of CGAMO for dual variables. It is supposed to accelerate the solving speed from the view of on the dual problem. Finally, extensive experiments show that CGAMO achieves a better performance than other state-of-the-art methods on solving VRPTW. The comparative experiments also present the parameters sensitivity analysis, including the different effects of MLA in the different path selection strategies, the characteristics and the applicable scopes of the two path-keeping conditions in the main problem.

关键词： vehicle routing problems with time windows column generation algorithm labelling algorithm sub-problem simplex method dual problem

来源：评论

学校读者我要写书评

暂无评论

A Connected Component Labeling algorithm for Sparse Lidar Data Segmentation 6

A Connected Component Labeling Algorithm for Sparse Lidar Da...

引用

6th International Conference on Automation, Robotics and Applications (ICARA)

作者： Ravankar, Abhijeet Kobayashi, Yukinori Ravankar, Ankit Emaru, Takanori Hokkaido Univ Grad Sch Engn Div Human Mech Syst & Design Sapporo Hokkaido Japan

ISBN: (纸本)9781479964666

This paper proposes an extended connected-components labeling algorithm for sparse Lidar (Light detection and ranging) sensor data. It is difficult to label sparse Lidar data using the general connected-component labeling algorithm. The proposed technique first increases the density of the sparse data by performing mathematical morphological operation of dilation. Next, labeling is performed on the dilated data, and the resultant labels are mapped to the input sparse Lidar data. The proposed technique does not distort the input Lidar data. We show the application of the proposed algorithm in map building using clustering. Results show that the proposed method can label sparse Lidar data to build maps.

关键词： Lidar labelling algorithm Sparse data Data partitioning Sensor Data connected component maps Dilatation, Pathologic Dilation LIght Detection and Ranging

来源：评论

学校读者我要写书评

暂无评论

Line Drawing Interpretation in a Multi-View Context

Line Drawing Interpretation in a Multi-View Context

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Jean-Dominique FAVREAU Florent LAFARGE Adrien BOUSSEAU INRIA Sophia-Antipolis

ISBN: (纸本)9781467369657

Many design tasks involve the creation of new objects in the context of an existing scene. Existing work in computer vision only provides partial support for such tasks. On the one hand, multi-view stereo algorithms allow the reconstruction of real-world scenes, while on the other hand algorithms for line-drawing interpretation do not take context into account. Our work combines the strength of these two domains to interpret line drawings of imaginary objects drawn over photographs of an existing scene. The main challenge we face is to identify the existing 3D structure that correlates with the line drawing while also allowing the creation of new structure that is not present in the real world. We propose a labeling algorithm to tackle this problem, where some of the labels capture dominant orientations of the real scene while a free label allows the discovery of new orientations in the imaginary scene. We illustrate our algorithm by interpreting line drawings for urban planing, home remodeling, furniture design and cultural heritage.

关键词： Line drawings Furniture Design labelling algorithm Religious Missions images computer vision creation Photographs Orientations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：