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

IEEE International Conference on Management of Innovation and Technology (ICMIT 2006)

作者： Sugiyono, Andre Sultan Agung Islam Univ Dept Ind Engn Fac Ind Technol Semarang Indonesia

ISBN: (纸本)142440147X

Factory Layout can be defined as how to arrange the factory facilities on production floor to keep the production flow run smoothly. This case study was on production floor of ***, that have layout type was process layout. Process Layout as the one of layout type that arrange any kind of machine or other production facilities that has same type on one place. With this type of layout, company has many advantages like flexibility on production process that has high variation. On the other hand, it also has disadvantage effect, especially on high cost of material handling. To reduce cost of material handling, company should redesign their production floor layout. Cellular Manufacturing System as application of Group Technology can arrange the production facilities that requires high variation process on part family product on the manufacture cell layout. With aplicating Cellular Manufacturing System, it will be more flexible to arrenge the facilities. Beside that, the company also can figure out the reducing cost of material handling and the length itself. Based on the data processing, using heuristics algorithm approach which is Bond Energy algorithm (BEA), Rank Order Clustering (ROC), dan Rank Order Clustering 2 (ROC 2) we can conclude that BEA is the most suitable method to use, by classifying 6 machines and 6 components in to 2 manufacturing cell, which are the first cell (M4, M6, M1, M2, P2, P5, P6, P1) and second cell (M4, M6, Ml, M3, M5, P3, P4). With this redesign, we can reduce the length of material handling almost 428,06 in and the cost of material handling almost Rp. 2.111.316,058/month.

关键词： Cellular manufacturing system Group technology heuristics algorithm

来源：评论

学校读者我要写书评

暂无评论

heuristics Scheduling algorithm on the Links Scheduling of Satellite-Ground Clock Synchronization and Ephemeris Uploading in COMPASS System

引用

Journal of Donghua University(English Edition) 2016年第3期33卷 462-466页

作者：张忠山闫俊刚谭跃进王沛 College of Information System and Management National University of Defense Technology

The execution process of satellite-ground clock synchronization and ephemeris uploading in the system is analyzed,as well as their characterized operation and their *** on the analysis of the scheduling goal and constraint character,a heuristics rule-based multi-stage link scheduling algorithm was put *** algorithm distinguishes the on-off-frontier satellites from the others and schedules them by *** paper presented the main flow as well as the detailed design of the *** based on the current COMPASS global system,some typical resources and constraints are selected to generate an *** the comparison analysis between the heuristics scheduling algorithm and three other traditional scheduling strategies are carried *** result shows the validity and reasonability of the multi-stage strategy.

关键词： heuristics algorithm COMPASS system crosslinks satelliteground clock synchronization and ephemeris uploading scheduling

来源：评论

学校读者我要写书评

暂无评论

Research on heuristics algorithm based dynamic routing and wavelength assignment in ASON

引用

Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument 2008年第SUPPL.期29卷 511-514页

作者： Wu, Jianhua Li, Xia Zhang, Kai Information Science and Engineering Institute Northeastern University Shenyang 110004 China

A heuristic algorithm based on D* principle is used for solving dynamic Routing and Wavelength Assignment (RWA) problem in ASON networks. In order to adapt the requirement of the optical control plan, D* algorithm with a novel evaluation function is proposed, which is composed by the basic cost of link and the use of wavelength. The simulation results show that this algorithm is better than the Dijkstra + First Fit algorithm in the area of assignment efficiency. It can effectively reduce the blocking probabilities, and promote the rational assignment of the wavelength resource.

关键词： A* algorithm ASON D* algorithm heuristics algorithm RWA

来源：评论

学校读者我要写书评

暂无评论

Wolf Pack algorithm: An Overview 17th

Wolf Pack Algorithm: An Overview

引用

17th International Conference on Intelligent Robotics and Applications

作者： Xu, Wei Wang, Yueming Xu, Peng Qiu, Tianqi Yan, Tong Wang, Zhirui China North Vehicle Res Inst Beijing 100072 Peoples R China China North Artificial Intelligence & Innovat Res Beijing 100072 Peoples R China Collect Intelligence & Collaborat Lab Beijing 100072 Peoples R China

ISBN: (纸本)9789819607945;9789819607952

Heuristic algorithms have evolved rapidly, leading to numerous theoretical breakthroughs and wide applications in various fields. Swarm intelligence algorithms, as an important branch of heuristic algorithms, have attracted significant attention from researchers. With the expansion of application scenarios and increasing problem complexity, swarm intelligence algorithms have faced considerable challenges in dealing with high-dimensional, multimodal complex function optimization. As a novel swarm intelligence algorithm, the Wolf Pack algorithm (WPA) has emerged as an efficient tool for addressing such issues due to its unique swarm characteristics and the mechanism that simulates wolf pack hunting behavior. A systematic review and summary of WPA from the perspectives of biological characteristics and algorithm principles are of paramount significance. Subsequently, a comparison between WPA and commonly used swarm intelligence algorithms is conducted. Then, the research progress of WPA is discussed in terms of both theory and application. Finally, inadequacies of WPA are explored, and the future prospects are presented.

关键词： heuristics algorithm Swarm intelligence algorithm Wolf Pack algorithm (WPA) Application field

来源：评论

学校读者我要写书评

暂无评论

XGBoost-Based Heuristic Path Planning algorithm for Large Scale Air-Rail Intermodal Networks

引用

INVENTIONS 2025年第2期10卷 27-27页

作者： Weng, Shengyuan Shan, Xinghua Bai, Guangdong Wu, Jinfei Zhao, Nan China Acad Railway Sci Postgrad Dept Beijing 100081 Peoples R China China Acad Railway Sci Corp Ltd Inst Comp Technol Beijing 100081 Peoples R China

It is particularly important to develop efficient air-rail intermodal path planning methods for making full use of the advantages of air-rail intermodal networks and providing passengers with richer and more reasonable travel options. A Time-Expanded Graph (TEG) is used to model the timetable information of public transportation providing a theoretical basis for public transportation path planning. However, if the TEG includes a large amount of data such as train stations, airports, train and air schedules, the network scale will become very large, making path planning extremely time-consuming. This study proposes an XGBoost-based heuristic path planning algorithm (XGB-HPPA) for large scale air-rail intermodal networks, which use the XGBoost model to predict transfer stations before path planning, and quickly eliminate unreasonable transfer edges by adding a heuristic factor, reducing the network scale, thus accelerating the computation speed. Comparative results indicate that XGB-HPPA can markedly enhance computational speed within large-scale networks, while obtaining as many valid solutions as possible and approximating the optimal solution.

关键词： path planning algorithm XGBoost intermodal transportation air-rail transportation network heuristics algorithm

来源：评论

学校读者我要写书评

暂无评论

A heuristic-based benders decomposition for the hybrid relief distribution network minimizing deprivation cost of vulnerable areas

引用

KYBERNETES 2024年

作者： Rahimi, Sanaz Khalaj Rahmani, Donya KN Toosi Univ Technol Fac Ind Engn Dept Ind Engn Tehran Iran

PurposeThe study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution ***/methodology/approachResearch has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution;deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating *** deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence ***/valueCurrent research introduces an

关键词： Hybrid truck-drone routing problem Benders decomposition algorithm heuristics algorithm Post-disaster condition Valid inequality Deprivation cost

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithm to reduce contention in emergency situations by deploying cognitive radio ad-hoc controllers

引用

IET COMMUNICATIONS 2019年第17期13卷 2814-2819页

作者： Sudhakaran, Chitra M, Suganthi Thiagarajar Coll Engn Dept Elect & Commun Engn Madurai Tamil Nadu India

Nowadays, the main focus of emergency communication research is directed to the use of cognitive radio ad-hoc networks for disaster scenarios. This study addresses an efficient cooperative game-theoretic channel access scheme for data offloading and cooperation of emergency user using cooperative cognitive ad-hoc controllers in order to reduce the blocking probability of the newly incoming emergency user. The main objective is to connect all the users who are in need of urgent spectrum and it is considered that their data size is too large. Also, a hybrid overlay-underlay approach was undertaken which provides higher spectrum flexibility. A distributed algorithm is proposed which comprises a criterion assignment, merge and split algorithm and an auction mechanism to provide incentives to those controllers who participate in cooperation. An aggregate throughput of 18% is obtained as an improvement when compared with other conventional heuristics algorithm.

关键词： probability cognitive radio game theory ad hoc networks telecommunication control distributed algorithms cooperative communication wireless channels distributed algorithm emergency communication research disaster scenarios data offloading hybrid overlay-underlay approach blocking probability reduction spectrum flexibility heuristics algorithm cooperative game-theoretic channel access scheme merge and split algorithm auction mechanism cooperative cognitive radio ad-hoc network controllers

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Scheduling in Edge Computing Based on Energy Internet

引用

IEEE ACCESS 2020年 8卷 229052-229065页

作者： Zhang, Qing Lin, Xiaoyong Hao, Yongsheng Cao, Jie Jimei Univ Comp Engn Coll Xiamen 361021 Peoples R China Xiamen Univ Technol Sch Cultural Ind & Tourism Xiamen 361024 Peoples R China Nanjing Univ Informat Sci & Technol Network Ctr Nanjing 210044 Peoples R China Xuzhou Univ Technol Sch Management Engn Xuzhou 221018 Jiangsu Peoples R China

Edge computing has been widely researched when 5G network and cloud platforms work together for people's life. The limitation of energy provided by the battery of the edge device hinders its application. This paper focuses on task scheduling in edge computing combined with the Energy harvesting technology (EH) and Energy Internet (EI). The edge node collects green energy by EH. And nodes exchange energy by EI. Energy Internet obtains green energy from edge nodes. Compared to green energy, we call energy from the power grid (not from the energy of edge nodes by energy harvesting technology) brown energy. How to reduce brown energy consumption is one of the most important problem in our paper. Previous works have not examined the energy attenuation between nodes, neither have they studied the immigration routes of virtual machines (VMs). This paper analyzes VM scheduling and models the energy consumption of VM immigrations, offloading tasks, and green energy transfer in edge computing. The paper proposes a heuristic assumption that there is only one VM in the system, and then presents three heuristics for the system with multiple VMs. The simulation results show that the proposed - immigrated VMs with the minimum energy transferring attenuation ratio method (METAR) is effective in reducing brown energy and total energy consumption, and improving the utilization rate of green energy. Compared to the Energy-Efficiency problem solution (EE-PRO) and maximize task energy consumption scheduling (MTS), METAR average reduces by 28.23% and 49.50% in brown energy consumption. At the same time, METAR average decreases by 5.67% and 11.52% in execution time.

关键词： Energy consumption Task analysis Edge computing Processor scheduling Scheduling Cloud computing Attenuation Edge computing green computing heuristics algorithm simulation

来源：评论

学校读者我要写书评

暂无评论

Time division inter-satellite link topology generation problem: Modeling and solution

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING 2018年第2期36卷 194-206页

作者： Chu, Xiaogeng Chen, Yuning Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China

In this paper, we study the time-division inter-satellite link topology generation (TDILTG) problem for the well-known Chinese BeiDou Global Navigation Satellite System. The TDILTG problem consists in generating a time-division topology of the inter-satellite link network for the navigation satellite system to spread systematic data to all satellites via a few source satellites with the purpose of minimizing the time required to spread the data. We propose a mathematical model to formulate the TDILTG problem and study its 2 lower bounds through a thorough analysis of the problem characteristics. We also present a deterministic constructive (DC) algorithm to solve this problem approximately but very quickly, with a time complexity of O(n(3)), where n is the number of satellites. Extensive experimental studies on a wide range of randomly generated instances show that the proposed DC algorithm is able to obtain the optimal solutions for most tested instances in less than 1second. Meanwhile, we also validate that the DC algorithm performs well when the problem scale is large. Furthermore, we provide insights of the effects of different instance parameters on the final results.

关键词： combinatorial optimization global navigation satellite system heuristics algorithm topology generation

来源：评论

学校读者我要写书评

暂无评论

A GRASP algorithm for multi container loading problems with practical constraints

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2020年第1期18卷 49-72页

作者： Alonso, M. T. Alvarez-Valdes, R. Parreno, F. Univ Castilla La Mancha Dept Math Albacete Spain Univ Valencia Dept Stat & Operat Res Valencia Spain

We consider the multicontainer loading problem of a company that has to serve its customers by first putting the products on pallets and then loading pallets onto trucks. When a large number of units of a product have to be shipped, the company requires that homogeneous pallets, with only one product, are built first, then weakly heterogeneous pallets, in which each layer corresponds to a single product, and finally strongly heterogeneous pallets with the remaining units of the products. To be useful in practice, the solutions have to satisfy five types of constraints: geometric constraints, so that pallets are completely inside the trucks and do not overlap;weight constraints, limiting the total weight a truck can bear and the maximum weight supported by each axle;constraints limiting the position of the centre of gravity of the cargo;dynamic stability constraints, to avoid cargo displacement when the truck is moving;and constraints ensuring that the delivery dates of products are respected. We have developed a Greedy Randomized Adaptive Search Procedure, including some improvement methods tailored to the problem, among them an adaptation of ejection chains. The approach has been tested on a benchmark of real problems and it has been shown to be capable of finding high-quality, realistic solutions in short computing times. We also provide a comparison with an integer programming formulation that justifies the use of a metaheuristic algorithm.

关键词： Container loading Optimization heuristics algorithm GRASP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：