Himma Firdaus, Tri Widianti · 2022
Smart logistics is a crucial aspect of constructing smart cities, which entails efficiently finding a solution to a problem using a fleet of vehicles to serve geographically dispersed clients. It comprises the capacitated vehicle routing problem (CVRP), a well-known NP-hard complex optimization problem that a genetic algorithm (GA) can solve even with some weaknesses. The weaknesses include time-consuming, difficult-to-achieve convergence, and easy-to-get premature convergence, resulting in infeasible and low-quality solutions in a limited population. Based on these weaknesses, the authors propose three improvements to GA to optimize the solution. The improvement strategies are enhancing the initial population with the nearest neighbor algorithm, improving the new mutated offspring with a 2-opt heuristic, and optimizing the route with a give-and-exchange operator. The test is undergone on 53 CVRP problem sets to evaluate the performance of our proposed algorithm. The result shows that the proposed algorithm successfully improves GA performance quality, reduces the execution time, reaches some optimum values, and obtains a better solution than the best-known value.
Cited by 2Open access
Chiranjeev Singh, Jatin Bansal · International Journal of Advanced Research in Computer Science and Software Engineering · 2017
Cited by 0
Somnath Maiti · 2026
Cited by 0Open access
José E. Gallardo (291863) · Figshare · 2015
Cited by 0Open access
Ding Xiao, Tong Yi, Haitao Yang et al. · 2009
Rete algorithm is the most efficient forward inference algorithm, widely used in rule engine systems. The Rete algorithm can be divided into two parts: rule compilation and runtime execution. Rule compilation describes how the rules in the production memory generate an efficient discrimination network - Rete network, while runtime execution describes how the asserted facts propagate through the network and fire the rule execution. In the rule compilation part, this paper introduces 'or' connective between conditions, then proposes an algorithm that interprets a single production containing multiple 'or' connectives as the equivalent of multiple productions. In runtime execution part, a specific rule engine handles common objects as facts to provide easy integration, and this paper introduces the 'update' primitive to update facts in the working memory of the rule engine and describes how to implement it through a shadow proxy mechanism.
Cited by 5
Lihua Li · 2009
Viterbi algorithm decoding is a kind of maximum likelihood decoding.In this paper,the improvement of Viterbi algorithm is produced.The experiment results show that it can overcome the drawback of the decoding performance greatly degraded,when burst errors occur,and reduce the decoding complexity while the good characteristic of conventional Viterbi algorithm remains uncharged.Simulations over coding channel show that the more correct bits we know the better the performance is.
Cited by 0
Oliveras Figueres, Gerard · QRU Quaderns de Recerca en Urbanisme · 2020
In order to improve Accenture’s TSSCV algorithm this project introduces basic forecasting theory and forecasting heuristics. Additionally, it explains the TSSCV algorithm in detail. Furthermore, it proposes several algorithm modifications, testing them for code performance and forecasting accuracy performance optimization. The results conclude that the Accenture’s TSSCV algorithm design is optimally tuned. Major revamps, new heuristics and methods are proposed to achieve higher accuracy performances.
Cited by 0Open access
Chenglong Song, Haiming Li · Journal of Computer and Communications · 2023
By analyzing the internal features of counting sorting algorithm. Two improvements of counting sorting algorithms are proposed, which have a wide range of applications and better efficiency than the original counting sort while maintaining the original stability. Compared with the original counting sort, it has a wider scope of application and better time and space efficiency. In addition, the accuracy of the above conclusions can be proved by a large amount of experimental data.
Cited by 2Open access
Brayden Dillon, Michigan State U., Steven Gardiner et al. · 2025
Data selection is an extremely important part of data analysis for any experiment. Finding a physics result is often the result of sifting through a massive amount of data, keeping data that we believe to be signal and throwing out data we do not. This process is called data selection. Creating a selection algorithm is an intensive process that must balance keeping enough data to have statistics and maximizing the signal purity of that data. In this study, we used three different reconstruction tools, Pandora, WireCell, and LANTERN, for the MicroBooNE experiment in conjunction to improve the selection algorithm for analysis. For the case of this study, we look into the charged current N proton 0 pions (CCNp0$\pi$) interaction channel. This is the dominant channel for the Short Baseline Neutrino (SBN) program and is expected to be a large contributor to the Deep Underground Neutrino Experiment (DUNE). We first investigated each of the three tools to find out more about their strengths and weaknesses as reconstructions. We then put together a direct comparison of the three methods to find which method or combination of methods would return the best result for us. While the study is ongoing, we have learned a lot about data selection for the experiment and the differences between the reconstruction tools.
Cited by 0Open access
B Pramila, G. Arunkumar, N. Jagadisha · 2012
While Denial-of-Service (DoS) attack technology continues to evolve, the circumstances enabling attacks have not significantly changed in recent years. DoS attacks remain a serious threat to the users, organizations, and infrastructures of the Internet. The research work highlights the usage of probabilistic packet marking (PPM) algorithm which is a promising way to discover the Internet map or an attack path that the attack packets traversed during a distributed denial-of-service attack. But it has been seen that its termination condition is not well defined which results in incorrect attack path constructed by the PPM algorithm. In this research work, a novel approach for a precise termination condition named as rectified PPM (RPPM) algorithm. The most significant merit of the RPPM algorithm is that when the algorithm terminates, the algorithm guarantees that the constructed attack path is correct, with a specified level of confidence. An experimental framework is designed on the RPPM algorithm and show that the RPPM algorithm can guarantee the correctness of the constructed attack path under different probabilities that a router marks the attack packets and different structures.
Cited by 0
Guanghua Chen, Ming Liu, Jingming Zhu et al. · 2009
An improved modular multiplication algorithm based on the interleaved multiplication is presented in this paper. Carry save addition (CSA), redundant representation, a fast lookup table and a counter register are used to improve this algorithm. Carry save addition and redundant representation are used to replace other additions like carry select addition, carry lookahead addition and so on, because carry propagation brought by those additions can be prevented by carry save addition, and redundant representation can make the arithmetic operations fast without carry propagation. The fast lookup table with only 7 pre-calculated values can minimize the number of additions, and can only be addressed once in one iteration, which not only speed up, but also save area compared with other literatures used lookup tables. The iteration number can be reduced by a counter register being added in this improved method to compute the number of 0 from the most significant bit of one operand like X. Analysis and emulation result shows the area and time complexity (AT) of the improved method is equal or even less than 2n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> .
Cited by 0
Wise, David S. · Minds at UW (University of Wisconsin) · 2012
Cited by 0Open access
Jan Zítko, Jan Kuřátko · Czech digital mathematics library · 2010
summary:The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid's algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$-$s$ transformation and $QR$-factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.
Cited by 0Open access
Saleh Al - Karaawy, Ashwaq T. Hashim · Engineering and Technology Journal · 2005
Abstract An improvement to Serpent algorithm will be proposed . Serpent algorithm is a Feistel network , iterating a simple encryption function 32 times . The block size is 256 bits , and the key can be any length up to 256 bytes . The proposed algorithm is designed to take advantage of the powerful facility , which is supported by Serpent algorithm with overcoming its weaknesses , resulting in a much improved security / performance tradeoff over existing ciphers . As a result , the proposed algorithm offers better security than Serpent algorithm . The proposed algorithm is compact , simple and easy to understand . It increases the block size to overcome the matching cipher text and brute force attacks .
Cited by 1Open access
Case Medical Research · Case Medical Research · 2019
Cited by 0
Chao Qin, Diego Klabjan, Daniel Russo · arXiv (Cornell University) · 2017
The expected improvement (EI) algorithm is a popular strategy for information collection in optimization under uncertainty. The algorithm is widely known to be too greedy, but nevertheless enjoys wide use due to its simplicity and ability to handle uncertainty and noise in a coherent decision theoretic framework. To provide rigorous insight into EI, we study its properties in a simple setting of Bayesian optimization where the domain consists of a finite grid of points. This is the so-called best-arm identification problem, where the goal is to allocate measurement effort wisely to confidently identify the best arm using a small number of measurements. In this framework, one can show formally that EI is far from optimal. To overcome this shortcoming, we introduce a simple modification of the expected improvement algorithm. Surprisingly, this simple change results in an algorithm that is asymptotically optimal for Gaussian best-arm identification problems, and provably outperforms standard EI by an order of magnitude.
Cited by 39Open access
Youchan Zhu, Feng Shen · 2012
In order to solve the premature convergence and local optimization and improve the global optimum and fast convergence, a new adaptive genetic algorithm is presented in this paper. It is based on the evaluation of population diversity and calculation of fitness value. The experimental result shows that the algorithm is clearly improved in aspects of convergent speed and stability and gets the desired results.
Cited by 2
Hoffman, E.; Abou-Jaoude, A.; Foss, A. · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2020
Cited by 1Open access
Jan Ondruš · Digital Repository (National Repository of Grey Literature) · 2007
LZP algorithm is one of algorithms designed for text compression. It is based on ideas published in paper "A Universal Algorithm for Sequential Data Compression" by Ziv and Lempel. The author of method LZP itself is Charles Bloom who proposed general scheme and his implementations. The aim of present work is continue progress of existing implementations of LZP algorithm and designing software for file compression. Some original ideas are proposed and included helping achieve e®ecient compression for various kind of data. LZPXj compressor is better for common files containing text, multimedia or executables. Part of this work is apart from description of improved algorithm also tests and comprehensions with some existing compression programs.
Cited by 0
Miloš Chromý · Digital Repository (National Repository of Grey Literature) · 2013
The algorithm BIBOX is one from cooperative pathfinding's algori- thms family. This algorithm is fast and suboptimal. Despite its speed, it has several non-deterministic decisions. One of the non-determinism is analyzed in this work and it's graph handle decomposition. The goal is to get different graph handle decomposition by analysis algorithm, which will have different effects on the running time and size of results of the algorithm, experimentally evaluate the performance of the algorithm on the selected handle decompositions and find handle decomposition, on which will be algorithm most efficient. Powered by TCPDF (www.tcpdf.org)
Cited by 0