Heuristic algorithm

This paper offers a comprehensive explanation of the optimization principle of the standard KA algorithm. It presents an IKA that tackles the deficiencies of the standard algorithm, improving population diversity and convergence speed.

16p viyamanaka 06-02-2025 1 1   Download

This paper proposed a fuzzy distance and constructed a heuristic algorithm to find one reduction set of numerical decision tables which is called the reduct. The proposed method preserves information measurement of the conditional attribute set.

11p tuetuebinhan000 23-01-2025 2 2   Download

Goals of the dissertation: This thesis focuses on studying and developing meta-heuristic optimization methods and combines them with the Artificial Neural Network, which has advantages in approximating data, to build up a new algorithm for solving composite material structural optimization problems.

136p monsterhunterer 20-06-2021 11 3   Download

In this paper, we present a novel global protein-protein interaction network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art algorithms. Furthermore, the complexity of ours is polynomial, thus being scalable to large biological networks in practice.

11p tamynhan4 06-09-2020 15 4   Download

In this paper we present a new heuristic algorithm to minimize the total completion time (Makespan) in permutation flow shop scheduling of ‘n’ jobs and ‘m’ machines by using harmonic triangle.

6p lucastanguyen 01-06-2020 17 2   Download

This paper presents a model to solve the multi-objective location-routing problem with capacitated vehicles. The main purposes of the model are to find the optimal number and location of depots, the optimal number of vehicles, and the best allocation of customers to distribution centers and to the vehicles.

16p tocectocec 24-05-2020 7 2   Download

This paper proposes a two-phase heuristic algorithm to solve the crew scheduling problem of the Megabus Bus Rapid Transit System.

12p tohitohi 22-05-2020 16 1   Download

This paper is motivated by the fuel delivery problem where the main objective of this research is to minimize the total driving distance using a minimum number of vehicles.

14p tohitohi 22-05-2020 38 4   Download

In this research, we put the development of a no-wait flow-shop scheduling model alongside with the effect of learning into consideration to minimize the cost of consumption of resources.

20p tohitohi 22-05-2020 43 1   Download

Luận án trình bày các phương pháp giải bài toán tái cấu hình lưới điện phân phối (LĐPP) dựa trên các giải thuật heuristic tổng quát. Trong đó, bài toán tái cấu hình giảm tổn thất công suất tác dụng được thực hiện dựa trên thuật toán cuckoo search (Cuckoo Search Algorithm - CSA).

196p cotithanh999 05-05-2020 39 7   Download

The thesis aims to propose the Heuristic method algorithm applied to the problem of power grid restructuring with the objective of reducing power loss in case of having / without distributed power source connecting to the distribution grid. Study the effect of distributed power source when connecting to the distribution grid, affecting the power grid restructuring problem.

27p xacxuoc4321 11-07-2019 27 2   Download

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in DMT Systems

7p dauphong19 07-03-2012 52 4   Download

A routing algorithm constructs routing tables to forward communication packets based on network status information. Rapid inflation of the Internet increases demand for scalable and adaptive network routing algorithms. Conventional protocols such as the Routing Information Protocol (RIP) (Hedrick, 1988) and the Open Shortest-Path First protocol (OSPF) (Comer, 1995) are not adaptive algorithms; they because they only rely on hop count metrics to calculate shortest paths. In large networks, it is difficult to realize an adaptive algorithm based on conventional approaches. ...

16p tienvovan 11-09-2010 81 7   Download

This chapter describes the joint application of two soft computing methods – evolutionary algorithms and fuzzy reasoning – to the problem of adaptive distributed routing control in packet-switched communication networks. In this problem, a collection of geographically distributed routing nodes are required to adaptively route data packets so as to minimise mean network packet delay. Nodes reach routing decisions locally using state measurements which are delayed and necessarily only available at discrete sampling intervals. ...

14p tienvovan 11-09-2010 69 5   Download