![](images/graphics/blank.gif)
Two heuristic algorithms
-
This paper proposes an improvement for two heuristic algorithms, PD-Steiner and SPT-Steiner, to solve a SMT problem in large size sparse graphs with edge weights not exceeding 10, and validates this proposal on large-size sparse graphs up to 100000 vertices. These experimental results are useful information for further research on the SMT problem.
10p
visystrom
22-11-2023
3
3
Download
-
In this paper, two meta-heuristic approaches, Differential evolution and Genetic algorithms were proposed to solve this problem. The optimal objectives are both the maximization of the length and the minimization of power peaking factor in a fuel cycle.
9p
vicedric
08-02-2023
3
3
Download
-
In this paper, a new hybrid meta-heuristic algorithm for FCP called BHHS which combines the power of existing meta-heuristic frameworks such as Black Hole and Harmony Search is proposed. These two algorithms cooperate and support each other. The Black Hole part of the algorithm has the goal to find good candidate solution while the Harmony Search part has the goal to generate new candidate solutions for Black Hole when the event horizon of the Black Hole occurs. In addition, new best solutions of these two components are exchanged with each other to improve the quality of the search.
7p
chauchaungayxua11
23-03-2021
15
1
Download
-
High-throughput bio-OMIC technologies are producing high-dimension data from bio-samples at an ever increasing rate, whereas the training sample number in a traditional experiment remains small due to various difficulties.
14p
vioklahoma2711
19-11-2020
7
1
Download
-
This paper investigates multicasting in such context with the objective of minimizing the cost of using wavelengths in network links. Without splitters, a set of light-spiders starting from the multicast source covering all the destinations is known as the traditional solution. This paper argues that the exact solution for the problem is a set of non-elementary spiders called light-spider hierarchies. Two efficient heuristic algorithms are proposed to compute the light-spider hierarchies to illustrate our findings.
9p
cothumenhmong8
05-11-2020
18
1
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
12
0
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
30
2
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
41
0
Download
-
The purpose of this study is to solve a complex multi-product four-layer capacitated locationrouting problem (LRP) in which two specific constraints are taken into account: 1) plants have limited production capacity, and 2) central depots have limited capacity for storing and transshipping products.
14p
toritori
11-05-2020
11
0
Download
-
The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan.
10p
toritori
11-05-2020
11
1
Download
-
The problem is modeled as two-stage stochastic program and a metaheuristic algorithm based on the adaptive large neighborhood search (ALNS) is proposed. Extensive computational experiments based on the CAB and TR data sets are conducted. Results show the high efficiency of the proposed solution method.
12p
toritori
11-05-2020
6
0
Download
-
The proposed approach is based on a modified genetic algorithm, which generates an initial population with heuristic solutions obtained from the well-known (LKH) heuristic algorithm for the TSP together with the solution of a mathematical model for the shortest path problem. In addition, two recombination methods and a mutation operator are considered. Computational experiments on benchmark instances show that the proposed algorithm can obtain high-quality solutions within short computing times.
18p
toritori
11-05-2020
17
0
Download
-
This paper proposes an online real-time matheuristic algorithm that combines: i) a new preparedness index defined as the availability probability of a multi-server queue model which is used as an optimization objective and as a control variable for relocation strategies, ii) two mathematical models to solve the relocation problem, one oriented to the maximization of coverage and other to the minimization of the maximum relocation time, and iii) two heuristic algorithms oriented to the maximization of the preparedness level, one to solve the dispatch problem and other to solve the location p...
26p
toritori
11-05-2020
36
1
Download
-
This paper focuses on optimizing truck-to-door sequencing with consideration of repeat truck holding pattern in inbound trucks in order to minimize makespan. Two methods are considered to solve this problem, including mathematical modeling and a heuristic algorithm. In the first method, a mixed integer-programming model is developed to minimize the makespan. Then, GAMS software is used to solve small-scale problems.
20p
toritori
11-05-2020
12
0
Download
-
This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC). Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. This problem is referred to as Time-Dependent Vehicle Routing Problem (TD-VRP) in previous literature.
25p
meriday
20-04-2019
15
2
Download
-
Combining word alignments trained in two translation directions has mostly relied on heuristics that are not directly motivated by intended applications. We propose a novel method that performs combination as an optimization process. Our algorithm explicitly maximizes the effectiveness function with greedy search for phrase table training or synchronized grammar extraction. Experimental results show that the proposed method leads to significantly better translation quality than existing methods. ...
4p
hongphan_1
15-04-2013
43
1
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
66
4
Download
-
Yagle, A.E. “Fast Matrix Computations” Digital Signal Processing Handbook Ed. Vijay K. Madisetti and Douglas B. Williams Boca Raton: CRC Press LLC, 1999 c 1999 by CRC Press LLC .10 Fast Matrix Computations 10.1 Introduction 10.2 Divide-and-Conquer Fast Matrix Multiplication Strassen Algorithm • Divide-and-Conquer • Arbitrary Precision Approximation (APA) Algorithms • Number Theoretic Transform (NTT) Based Algorithms Overview • The Wavelet Transform • Wavelet Representations of Integral Operators • Heuristic Interpretation of Wavelet Sparsification 10.
10p
longmontran
18-01-2010
95
11
Download