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

Vehicle Routing Problem Model with Practicality

PROCESSES 2023年第3期11卷 654页

作者： Park, SeJoon Ha, Chunghun Seok, Hyesung Kangwon Natl Univ Div Energy Resources Engn & Ind Engn KNU Chuncheon Campus1 Gangwondaehakgil Chunchon 24341 Gangwon Do South Korea Hongik Univ Dept Ind & Data Engn 94 Wausan Ro Seoul 04066 South Korea

Truck platooning has recently become an essential issue in automatic driving. Though truck platooning can increase safety and reduce fuel consumption and carbon emissions, the practical vehicle routing problem involved in truck platooning has not been sufficiently addressed. Therefore, we design a mixed-integer linear programming model for the routing problem in truck platooning considering the deadline of vehicles, continuous-time units, different fuel reduction rates, traffic congestion avoidance, and heterogeneous vehicles. In addition, a forward-backward heuristic called the "greedy heuristic" is presented for reasonable computation time. To validate the model's performance, several parameters, such as the percentage of fuel reduction, percentage of detour vehicles, and percentage of platooned links (road segments), are considered. Additionally, various cases are considered with varying fuel reduction rates, traffic flow rates, and time windows.

关键词： automatic driving cost minimization forward-backward heuristics greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Marine Survey Lines Design Optimization for Measurements in Real Sea Areas 24

Marine Survey Lines Design Optimization for Measurements in ...

引用

Proceedings of the 2024 4th International Conference on Computational Modeling, Simulation and Data Analysis

作者： Dongling Yao Yanglin Chen Wanzhen Hui School of Mathematical Sciences Sichuan Normal University Chengdu Sichuan China

ISBN: (纸本)9798400711831

When conducting full coverage depth measurements in real sea areas, addressing the distribution of survey lines for the survey vessel is crucial. This paper establishes a marine survey line model by examining the working principle of the multibeam sounding system. It calculates an iterative equation for measuring the seabed depth along the survey lines based on the overlap rate, the depth at the center of the sea area, and the opening angle of the transducer, as well as determining the maximum and minimum depths in the area. Subsequently, this paper defines the total length of the survey lines as the objective function, the number of survey lines as the decision variable, and the coverage of the entire sea area—while maintaining the overlap rate within a specified range—as the constraint conditions to establish an optimization model for the marine survey lines. Finally, leveraging a greedy approach, the model is solved using an iterative method. The marine survey line model presented in this paper offers a measurement plan that balances measurement convenience and data integrity, providing practical application value for marine survey line studies.

关键词： greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Quasi-uniform designs with optimal and near-optimal uniformity constant

引用

JOURNAL OF APPROXIMATION THEORY 2023年第1期294卷

作者： Pronzato, L. Zhigljavsky, A. Univ Cote dAzur CNRS Lab I3S 2000 Route Lucioles F-06900 Sophia Antipolis France Cardiff Univ Sch Math Sennghennydd Rd Cardiff CF24 4YH Wales

A design is a collection of distinct points in a given set X, which is assumed to be a compact subset of Rd, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a sequence of nested designs is the smallest upper bound for the mesh-ratios of the designs. We derive a lower bound on this uniformity constant and show that a simple greedy construction achieves this lower bound. We then extend this scheme to allow more flexibility in the design construction. & COPY;2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Separation radius Packing radius Fill distance Mesh norm Covering radius Mesh-ratio Quasi-uniform design greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

On sparse recovery algorithms in unions of orthonormal basest

引用

JOURNAL OF APPROXIMATION THEORY 2023年第1期289卷

作者： Shen, Yi Yu, Chenyun Shen, Yuan Li, Song Zhejiang Sci Tech Univ Dept Math Hangzhou 310018 Peoples R China Zhejiang Univ Sch Math Sci Hangzhou 310027 Peoples R China

We are concerned with the problem of recovering sparse vectors exactly by two commonly used methods, orthogonal matching pursuit (OMP) and basis pursuit (BP). Suppose that overcomplete dictionaries are unions of several orthonormal bases. Gribonval and Nielsen have provided a sufficient mutual coherence condition for BP to recover every sparse vector exactly. Then Tropp proved that it is a sharp sufficient condition for OMP by existence proofs. We establish here the sharpness of Gribonval and Nielsen's sufficient condition for both OMP and BP by constructing several families of counterexamples. Our main tools are Hadamard matrices and mutually unbiased bases from quantum information theory. (c) 2023 Elsevier Inc. All rights reserved.

关键词： Sparse recovery Mutually unbiased bases Mutual coherence Convex minimization greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily 1

引用

24th International Conference on Theory and Applications of Satisfiability Testing (SAT)

作者： Friedrich, Tobias Neumann, Frank Rothenberger, Ralf Sutton, Andrew M. Univ Potsdam Hasso Plattner Inst Potsdam Germany Univ Adelaide Adelaide SA Australia Univ Minnesota Duluth MN 55812 USA

ISBN: (数字)9783030802233

ISBN: (纸本)9783030802233;9783030802226

Recently, there has been an interest in studying non-uniform random k-satisfiability (k-SAT) models in order to address the non-uniformity of formulas arising from real-world applications. While uniform random k-SAT has been extensively studied from both a theoretical and experimental perspective, understanding the algorithmic complexity of heterogeneous distributions is still an open challenge. When a sufficiently dense formula is guaranteed to be satisfiable by conditioning or a planted assignment, it is well-known that uniform random k-SAT is easy on average. We generalize this result to the broad class of non-uniform random k-SAT models that are characterized only by an ensemble of distributions over variables with a mild balancing condition. This balancing condition rules out extremely skewed distributions in which nearly half the variables occur less frequently than a small constant fraction of the most frequent variables, but generalizes recently studied non-uniform k-SAT distributions such as power-law and geometric formulas. We show that for all formulas generated from this model of at least logarithmic densities, a simple greedy algorithm can find a solution with high probability. As a side result we show that the total variation distance between planted and filtered (conditioned on satisfiability) models is o(1) once the planted model produces formulas with a unique solution with probability 1 - o(1). This holds for all random k-SAT models where the signs of variables are drawn uniformly and independently at random.

关键词： Random k-SAT Planted k-SAT Non-uniform variable distribution greedy algorithm Local search

来源：评论

学校读者我要写书评

暂无评论

A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph 27th

A Pivot Gray Code Listing for the Spanning Trees of the Fan ...

引用

27th International Computing and Combinatorics Conference (COCOON)

作者： Cameron, Ben Grubb, Aaron Sawada, Joe Univ Guelph Guelph ON Canada

ISBN: (纸本)9783030895433;9783030895426

We use a greedy strategy to list the spanning trees of the fan graph, F-n, such that successive trees differ by pivoting a single edge around a vertex. It is the first greedy algorithm for exhaustively generating spanning trees using such a minimal change operation. The resulting listing is then studied to find a recursive algorithm that produces the same listing in O(1)-amortized time using O(n) space. Additionally, we present O(n)-time algorithms for ranking and unranking the spanning trees for our listing;an improvement over the generic O(n(3))-time algorithm for ranking and unranking spanning trees of an arbitrary graph.

关键词： Spanning tree greedy algorithm Fan graph Combinatorial generation

来源：评论

学校读者我要写书评

暂无评论

Active Manifold and Model Reduction for Multidisciplinary Analysis and Optimization

Active Manifold and Model Reduction for Multidisciplinary An...

引用

AIAA Science and Technology Forum and Exposition (AIAA SciTech Forum)

作者： Boncoraglio, Gabriele Farhat, Charbel Stanford Univ Dept Aeronaut & Astronaut Durand BldgRoom 2242 Stanford CA 94305 USA Stanford Univ Dept Aeronaut & Astronaut Aircraft Struct Durand BldgRoom 257 Stanford CA 94305 USA

ISBN: (数字)9781624106095

ISBN: (纸本)9781624106095

A computational framework is proposed for efficiently solving multidisciplinary analysis and optimization (MDAO) problems in a relatively high-dimensional design space. It relies on the appropriate blend of linear and nonlinear projection-based model order reduction to accelerate analysis and optimization;and on a new concept of nonlinear active manifold (AM) to mitigate the curse of dimensionality during the training of projection-based reduced-order models (PROMs). The method of AM relies on the nonlinear concept of a deep convolutional autoencoder for dimensionality reduction: it is proposed as a superior alternative to the concept of an active subspace whose capabilities are limited by the capabilities of an affine approximation. The proposed computational framework also blends the concept of a global PROM as a surrogate model of a discretized nonlinear partial differential equation (PDE)based behavior function with that of a database of local, linear PROMs for approximating, wherever appropriate, a linear PDE-based behavior function. Adaptive parameter sampling is performed for training the global, nonlinear PROM as well as for populating the database of local, linear PROMs. The proposed computational framework is demonstrated for the solution of an MDAO problem formulated for a flexible instance of NASA's Common Research Model, where the objective function pertains to aerodynamics in the transonic regime, the constraint relates to flutter, and the design space contains 58 structural and aerodynamic shape design variables. The obtained numerical results illustrate the potential of the AM method for addressing the curse of dimensionality. They also demonstrate the feasibility of the computational framework for realistic MDA Oproblems and highlight its potential for reducing solution time.

关键词： Model Order Reduction Aerodynamic Configurations Computational Fluid Dynamics Fuselages Computational Structural Dynamics greedy algorithm Structural Modeling Damping Ratio Optimization algorithm Sweep Angle

来源：评论

学校读者我要写书评

暂无评论

A Demo System for the Airport Gate Assignment algorithm Study and Evaluation 13

A Demo System for the Airport Gate Assignment Algorithm Stud...

引用

13th IEEE International Conference on Communication Software and Networks (ICCSN)

作者： Du Enyu Wu Wenjun Si Pengbo Zhang Xuanyi Yang Wenhui Beijing Univ Technol Fac Informat Technol Beijing Peoples R China Beijing Capital Int Airport Co Ltd Dept Informat Technol Beijing Peoples R China

ISBN: (纸本)9781665431828

With the rapid development of civil aviation transportation, the airport gate assignment problem (AGAP) has become an important issue for improving the operation efficiency of airport. By now, there has been a lot of algorithm research on the AGAP. However, the dynamic of flight schedule and the huge amount of large hub airport has not been well considered. For the convenient of advanced algorithm study and evaluation, a demo system for the AGAP is designed and built providing the function of data input, animation display of gate assignment result and the AGAP algorithm module. The user interface and the animation are implemented using the HTML and CSS, the AGAP algorithm functions are called through JavaScript, and the PHP is responsible for accessing the MySQL database. The test result show that the system can process data properly and the animation is smooth. The monitoring data of system running environment show that the system works stably.

关键词： intelligent assignment of airport gates assistance system greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Target Set Selection in Social Networks with Influence and Activation Thresholds 10th

Target Set Selection in Social Networks with Influence and A...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Qiang, Zhecheng Pasiliao, Eduardo L. Zheng, Qipeng P. Univ Cent Florida Dept Ind Engn & Management Syst Orlando FL 32816 USA Air Force Res Lab Munit Directorate Shalimar FL USA

ISBN: (纸本)9783030914349;9783030914332

Social media networks have gradually become the major venue for broadcasting and relaying information, thereafter making great influences in many aspects of our daily lives. With the mass adoption of the internet and mobile devices, social media users tend to follow and adopt their friends' or followers' thoughts and behaviors. Thus finding influential users in social media is crucial for many viral marketing, cybersecurity, politics, and safety-related applications. In this study, we address the problem through solving the influence and activation thresholds target set selection problem, which is to find the minimum number of seed nodes that influence all the users at time T. These time-indexed integer program models suffer from computational difficulties with binary variables at each time step. To this respect, this paper leverages computational algorithms, i.e., Graph Partition, Nodes Selection, and greedy algorithm to solve the models for large-scale networks. Computational results show that it is beneficial to apply the BFS greedy algorithm for large scale networks. In addition, the results also indicate nodes selection methods perform better in the long-tailed networks.

关键词： Networks Integer programming Target set selection greedy algorithm Influence maximization

来源：评论

学校读者我要写书评

暂无评论

Research on the method of path planning for slag-removing on the surface of zinc pot 33

Research on the method of path planning for slag-removing on...

引用

33rd Chinese Control and Decision Conference (CCDC)

作者： Li, Kebo Xiong, Ling Zhang, Zhenzhou Chen, Gang Minist Educ Engn Res Ctr Met Automat & Measurement Technol Wuhan 430081 Peoples R China Wuhan Univ Sci & Technol Inst Robot & Intelligent Syst Wuhan 430081 Peoples R China Wuhan Univ Sci & Technol Key Lab Met Equipment & Control Technol Wuhan 430081 Peoples R China

ISBN: (纸本)9781665440899

During the production process of cold-rolled hot-dip galvanizing, the slag on the surface of the zinc pot will affect the quality of the product. The zinc slag is mostly collected manually or by robots at present. The effect of manual salvage is unstable and the operation is unsafe. The robot cannot identify the location of the zinc slag and can only salvage it according to a fixed rule, resulting in low efficiency. In response to the above problems, a zinc pot slag path planning method based on the greedy algorithm is proposed in this paper. The zinc pot area is divided, the image processing method is used to identify and locate the zinc slag to be picked. And the priority of the zinc pot, the obstacle avoidance problem and the restriction of the weight limit of the slag-removing tool are proposed in combination with the process requirements. Then three salvage strategies based on the greedy algorithm, the shortest distance, the maximum weight, and the minimum weight are proposed respectively. Experimental results show that the greedy algorithm strategy based on the shortest distance performs best, consumes the least energy, and the algorithm runs for a shorter time. It can significantly improve the efficiency of zinc pot slag removal, realize intelligent control of slag removal technology, and can be applied to the actual production of zinc pot slag removal.

关键词： Slag from zinc pot Intelligent control greedy algorithm Path planning Shortest distance strategy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：