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

International Conference on Computational Science and Its Applications (ICCSA 2006)

作者： Gavrilova, Marina L. Univ Calgary Dept Comp Sci Calgary AB Canada

ISBN: (纸本)354034070X

Driven by the industrial challenge of labeling maps for GIS applications, we investigate the problem of computing the largest convex partitioning of the map P such that the rectangular axis-parallel label L can be placed in it. The map region to be labeled is in general non-convex and may contain holes. Our main result is the new polygonal area removal (PAR) algorithm to identify the area within P where the center of the label L can be placed. We then derive a new and faster algorithm based on the sweep technique that determines the complete set of maximum inscribed rectangles (MIR) in P in the most common case when rectangle sides have an axis-parallel orientation. The set of all maximum inscribed rectangles is then post-processed to produce the best size/orientation combination of the final label placement depending on the specific requirements from the end users.

关键词： map labeling for polygons with holes polygonal area removal. sweep algorithm set of maximum inscribed rectangles GIS

来源：评论

学校读者我要写书评

暂无评论

Nested Parallelism with algorithmic Skeletons 1

引用

31st International Workshop on Languages and Compilers for Parallel Computing (LCPC)

作者： Majidi, Alireza Thomas, Nathan Smith, Timmie Amato, Nancy Rauchwerger, Lawrence Texas A&M Univ College Stn TX 77840 USA

ISBN: (数字)9783030346270

ISBN: (纸本)9783030346270;9783030346263

Nested parallelism is a natural way to express programs for hierarchical systems. It enables a compositional programming approach that can then be mapped onto the system hierarchy. In this paper, we present nested algorithm composition in the STAPL Skeleton Library (SSL) which uses a nested dataflow model as its internal representation. We show how a high level program specification using SSL allows for asynchronous computation and improved locality. We study both the specification and performance of the stapl implementation of Kripke, a mini-app developed by Lawrence Livermore National Laboratory. Kripke has multiple levels of parallelism and a number of data layouts, making it an excellent test bed to exercise the effectiveness of a nested parallel programming approach. Performance results are provided for six different nesting orders of the benchmark demonstrating the flexibility and performance of nested algorithmic skeleton composition in stapl.

关键词： algorithmic skeletons Nested parallelism Dataflow Kripke mini-app sweep algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

引用

Journal of Industrial Engineering International 2012年第1期8卷 1-9页

作者： Yousefikhoshbakht, Majid Khorram, Esmaile Young Researchers Club Hamedan Branch Islamic Azad University Hamedan Iran Faculty of Mathematics and Computer Science Amirkabir University of Technology Hafez Avenue Tehran Iran

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach. © 2012, Yousefikhoshbakht and Khorram;licensee Springer.

关键词： Ant colony system NP-hard problems sweep algorithm Vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

VESSEL ROUTE OPTIMIZATION FOR OFFSHORE MARINE TRANSPORT 33

VESSEL ROUTE OPTIMIZATION FOR OFFSHORE MARINE TRANSPORT

引用

33rd International European Council for Modelling and Simulation Conference on Modelling and Simulation, ECMS 2019

作者： Wongmayura, Montra Wasusri, Thananya King Mongkuts Univ Technol Thonburi Logist & Supply Chain Management Grad Sch Management & Innovat 126 Pracha Uthit Rd Bangkok 10140 Thailand

ISBN: (纸本)9783937436654

In offshore upstream oil and gas industry, daily logistics and transportation are being served by Offshore Support Vessels (OSV) such as Platform Supply Vessel (PSV), Anchor Handling Tug Supply (AHTS) and Crew Utility Vessel. Marine transportation is then a substantive operating costs. To stay competitive, the cost should be reduced and vessel route optimization can be a tool. The case study company is an exploration and production (E&P) company operating in the Gulf of Thailand. At present, the planning and scheduling tasks of marine vessel in this area are mostly conducted by manual with none use of optimizing tools. Hence, cost and time saving can be expected by the use of enhanced and well developed vessel route planning. This paper applies the two-phase sweep algorithm to conduct route planning, it is assumed that there are five vessels with varied capacities obtainable to serve offshore daily demands at thirty remote platforms. All demand locations are first to be clustered into groups using polar-angles sweeping method and then refine the routes of vessel for each cluster. All processing phases are implemented using functions and add-in programs of Microsoft Excel. It was noted that the primary stage of clustering plays a very important role to the solution results. However, overall outcomes of process experiments present that the answers are stable and acceptable.

关键词： Daily route planning Excel solver Offshore marine transportation Offshore Support Vessel sweep algorithm

来源：评论

学校读者我要写书评

暂无评论

Improvement of a Genetic algorithm Approach for the Solution of Vehicle Routing Problem with Time Windows

Improvement of a Genetic Algorithm Approach for the Solution...

引用

2017 International Artificial Intelligence and Data Processing Symposium (IDAP)

作者： Gocken, Tolunay Yaktubay, Meltem Kilic, Fatih Adana Sci & Technol Univ Engn & Nat Sci Fac Ind Engn Dept TR-01180 Adana Turkey Adana Sci & Technol Univ Engn & Nat Sci Fac Comp Engn Dept TR-01180 Adana Turkey

ISBN: (纸本)9781538618806

In this study, Vehicle Routing Problem with Time Windows (VRPTW) with known customer demands, a single depot and identical vehicles, is considered. Minimizing the total distance and the total waiting time of the vehicles are determined as objective functions for VRPTW which is capable to serve the customers in a prespecified time interval. A hybridized version of genetic algorithm which is a metaheuristic solution technique with constructive heuristic methods is proposed to produce effective solutions for VRPTW. By using sweep algorithm in initial population generation phase of genetic algorithm, it is planned to begin the search with high quality solution sets and in this way, get more feasible solutions faster. A benchmark problem in the literature is solved and obtained results are compared with the results of genetic algorithm with the nearest neighbor algorithm based algorithm. It is observed that the proposed genetic algorithm beginning with sweep based initial population generation algorithm reaches more effective solutions.

关键词： Genetic algorithm Multi-objective optimization NSGA-II sweep algorithm Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

Parallel algorithms for 2-D Cylindrical Transport Equations of Eigenvalue Problem

Parallel Algorithms for 2-D Cylindrical Transport Equations ...

引用

International Conference on Computational Science and Computational Intelligence (CSCI)

作者： Wei Junxia Yang Shulin Inst Appl Phys & Computat Math Beijing Peoples R China

ISBN: (纸本)9781479930098

In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that the designed parallel algorithm can reach perfect speedup, it has good practicality and scalability.

关键词： transport equations domain decomposition sweep algorithm speedup

来源：评论

学校读者我要写书评

暂无评论

Resolving Single Depot Vehicle Routing Problem with Artificial Fish Swarm algorithm

Resolving Single Depot Vehicle Routing Problem with Artifici...

引用

3rd International Conference on Swarm Intelligence (ICSI)

作者： Li, Zhi Guo, Haixiang Liu, Longhui Yang, Juan Yuan, Peng China Univ Geosci Sch Econ & Management Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9783642310201

The paper establishes the mathematical model about the vehicles routing problem (VRP) of transporting dangerous goods in Zhengzhou Coal Material Supply and Marketing Company. Then, use artificial fish swarm algorithm to explore the optimal solution of the VRP. The algorithm first initializes a group of artificial fishes, and a repair operator guarantee the current state of each artificial fish represents a feasible distribution scheme and then these artificial fishes find the globally optimal solution through implementation of the designed random behavior, and behaviors of prey, swarm and follow. At last, it compares with sweep algorithm and genetic algorithm and the results show the validity of artificial fish swarm algorithm.

关键词： vehicle routing problem artificial fish swarm algorithm sweep algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

An employee transporting problem

引用

Journal of Industrial Engineering International 2013年第1期9卷 1-9页

作者： Yüceer, Ümit Department of Industrial Engineering Toros University Mersin 33140 Turkey

An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It requires testing and matching too many alternatives to obtain a partition. The sweep algorithm is implemented in obtaining a partition (subset-vehicle combination) in an efficient manner. Illustrations are provided to show how the algorithms obtain solutions. © 2013, Yuceer;licensee Springer.

关键词： Employee transportation Knapsack problem Set partitioning sweep algorithm

来源：评论

学校读者我要写书评

暂无评论

Semantics and Analysis of DMN Decision Tables

Semantics and Analysis of DMN Decision Tables

引用

14th International Conference on Business Process Management (BPM)

作者： Calvanese, Diego Dumas, Marlon Laurson, Ulari Maggi, Fabrizio M. Montali, Marco Teinemaa, Irene Free Univ Bozen Bolzano Bolzano Italy Univ Tartu Tartu Estonia

ISBN: (纸本)9783319453484;9783319453477

The Decision Model and Notation (DMN) is a standard notation to capture decision logic in business applications in general and business processes in particular. A central construct in DMN is that of a decision table. The increasing use of DMN decision tables to capture critical business knowledge raises the need to support analysis tasks on these tables such as correctness and completeness checking. This paper provides a formal semantics for DMN tables, a formal definition of key analysis tasks and scalable algorithms to tackle two such tasks, i.e., detection of overlapping rules and of missing rules. The algorithms are based on a geometric interpretation of decision tables that can be used to support other analysis tasks by tapping into geometric algorithms. The algorithms have been implemented in an open-source DMN editor and tested on large decision tables derived from a credit lending dataset.

关键词： Decision model and notation Decision table sweep algorithm

来源：评论

学校读者我要写书评

暂无评论

Determining coordinates for implementing vehicle routing construction heuristics

Determining coordinates for implementing vehicle routing con...

引用

IISE Annual Conference and Expo 2021

作者： Tilashalski, Melissa Ellis, Kimberly Virginia Tech BlacksburgVA United States

ISBN: (纸本)9781713838470

The vehicle routing problem (VRP) is a complex optimization problem that is often addressed with construction heuristics, such as the popular sweep algorithm. In order to implement the sweep algorithm, coordinate locations for the depot and customers are required. The motivating application comes from an industry data set that consists of distances between customers and the depot but without the coordinate locations. These distances follow neither Euclidean nor rectilinear distance metrics. In this paper, a nonlinear optimization program (NLP) is developed to find coordinates for the customers and depot in order to apply the sweep algorithm. This paper describes key features for implementing the NLP, such as initialization and additional constraint considerations. The robustness of solutions from the NLP is discussed and analyzed. Most importantly, based on the coordinates identified, a sweep is applied to develop vehicle routes for the industry data sets. © 2021 IISE Annual Conference and Expo 2021. All rights reserved.

关键词： Construction heuristic Coordinate selection Nonlinear optimization sweep algorithm Vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：