• Three different versions of chaotic simulated annealing (XSA) were applied to combinatorial optimization problems in multiprocessor task allocation. (igi-global.com)
  • To solve this problem, a triplex algorithm called GASANT which is based on Ant Colony Optimization (ACO), Genetic Algorithm (GA), and Simulated Annealing (SA) has been proposed in this paper. (univagora.ro)
  • We encourage readers to explore the application of Simulated Annealing in their work for the task of optimization. (cgucrest.org)
  • This article reports a computationally efficient optimization for wavy surface roughness in cooling channels based on simulated annealing. (elsevierpure.com)
  • Our approach rapidly calculates the performance metrics of cooling channels using closed-form models and approximates an optimum design via a random optimization technique, simulated annealing. (elsevierpure.com)
  • Kang, M, Hwang, LK & Kwon, B 2020, ' Computationally efficient optimization of wavy surface roughness in cooling channels using simulated annealing ', International Journal of Heat and Mass Transfer , vol. 150, 119300. (elsevierpure.com)
  • Optimization based models for identification of these characteristics of unknown ground-water pollution sources rely on comparing the simulated effects of candidate solutions to the observed effects in terms of pollutant concentration at specified sparse spatiotemporal locations. (scirp.org)
  • The optimization model minimizes the difference between the observed pollutant concentration measurements and simulated pollutant concentration measurements. (scirp.org)
  • Simulated Annealing (SA) is used as the solution algorithm for the optimization model. (scirp.org)
  • Open Journal of Optimization , 3 , 26-41. (scirp.org)
  • The algorithm for optimization in this paper is Simulated Annealing. (academicjournals.org)
  • Journal of Optimization Theory and Applications, 45:41-51. (sbc.org.br)
  • Computational grid scheduling Optimization simulated annealing. (i-cses.com)
  • In this paper, a hybrid gradient simulated annealing algorithm is guided to solve the constrained optimization problem. (aucegypt.edu)
  • In previous literature, the hybrid gradient simulated annealing algorithm (GLMSA) has demonstrated efficiency and effectiveness to solve unconstrained optimization problems. (aucegypt.edu)
  • The proposed approach penalty function is used to guide the hybrid gradient simulated annealing algorithm (GLMSA) to obtain a new algorithm (GHMSA) that finds the constrained optimization problem. (aucegypt.edu)
  • Due to its NP-hardness, efficient algorithms for solving this problem are very crucial for practical purposes, and simulated annealing is proved to be effective in state-of-the-art CPP algorithms. (jair.org)
  • Extensive experiments on benchmark instances of the CPP were carried out, and the results suggest that the proposed simulated annealing algorithm outperforms all the existing heuristic algorithms, including five state-of-the-art algorithms. (jair.org)
  • H.F. Salama, D.S. Reeves, Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications 15(3) (1997) 332-345. (univagora.ro)
  • The implementation of the local search and simulated annealing algorithms searches the space of hyperplanes intersections combinations formulated by the regression's observations. (ssrn.com)
  • Although it is a fundamental form of the problem, the single machine scheduling problem with two or more objectives is known to be NP-hard or NP-complete [2], and so meta-heuristic algorithms such as Genetic Algorithms (GAs), Tabu search and Simulated Annealing (SA) are the accepted solution technique since no optimal polynomial time algorithm exists (unless P = NP) [3]. (scielo.org.za)
  • A Novel Job Scheduler for Computational Grid Using Simulated Annealing Heuristic," International Transactions on Evolutionary and Metaheuristic Algorithms , vol. 1, no. 1, pp. 6-13, Nov. 2015. (i-cses.com)
  • To further accelerate the convergence speed, we introduce a shrinking factor to decline initial temperature and then propose an iterated local search algorithm based on simulated annealing. (jair.org)
  • In this paper, a novel scheduling algorithm based on simulated annealing heuristic which considers both the completion time and execution cost is introduced. (i-cses.com)
  • Article: A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows Journal: International Journal of Shipping and Transport Logistics (IJSTL) 2021 Vol.13 No.1/2 pp.185 - 204 Abstract: We propose a meta-heuristic algorithm for addressing a real case of vehicle routing problem with a heterogeneous fleet and time windows. (inderscience.com)
  • The simulated-annealing algorithm (SA) is one of the most successful meta-heuristic strategies. (aucegypt.edu)
  • K. Vijayalakshmi, and S. Radhakrishnan, Dynamic Routing to Multiple Destinations in IP Networks Using Hybrid Genetic Algorithm (DRHGA), International Journal of Information Technology. (univagora.ro)
  • In this work, we propose a memetic algorithm-based approach inside the rough set theory which is a hybridisation of genetic algorithm and simulated annealing. (inderscience.com)
  • As a prerequisite of the discrete space simulated annealing algorithm, also, a multi-start hyperplanes intersection local search algorithm (HILS) is devised. (ssrn.com)
  • Florios, Kostas, A Hyperplanes Intersection Simulated Annealing Algorithm for Maximum Score Estimation (March 9, 2017). (ssrn.com)
  • Article: Investigating memetic algorithm in solving rough set attribute reduction Journal: International Journal of Computer Applications in Technology (IJCAT) 2013 Vol.48 No.3 pp.195 - 202 Abstract: Attribute reduction is the problem of selecting a minimal subset from the original set of attributes. (inderscience.com)
  • This study contributes to the literature by using a mixed integer programming (MIP) formulation and a simulated annealing (SA) based solution methodology for CumMTVRP-LD, which considers the minimization of fuel consumption as the objective function. (springer.com)
  • JAIR, established in 1993, was one of the first open-access scientific journals on the Web, and has been a leading publication venue since its inception. (jair.org)
  • Afterwards, to enhance the local search ability of simulated annealing and speed up convergence, we combine our simulated annealing with a descent search method to solve the CPP. (jair.org)
  • Journal of Bioinformatics and Computational Biology, 18(3):2050016:1-2050016:32. (sbc.org.br)
  • Because The "International Journal on Recent and Innovation Trends in Computing and Communication" has been accepted for Scopus . (ijritcc.org)
  • International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 7 (3), 58-79. (igi-global.com)
  • Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 7, no.3: 58-79. (igi-global.com)
  • International Journal of Mathematical Modelling and Numerical Optimisation. (wikipedia.org)
  • International Journal of Heat and Mass Transfer , 150 , Article 119300. (elsevierpure.com)
  • Our proposal consists of generating an initial feasible solution using the solution of a travelling salesman problem and, subsequently, refining it through simulated annealing. (inderscience.com)
  • Improving the neighborhood selection strategy in simulated annealing using the optimal stopping problem. (springer.com)
  • Improvement heuristics for the vehicle routing problem based on simulated annealing. (springer.com)
  • In order to use Simulated Annealing algorithm, at first, placement problem is written as an. (academicjournals.org)
  • The main contribution of this work is to investigate the hypothesis that the performance of the Simulated Annealing (SA) algorithm can be improved by combining it with other sampling methods in solving the single machine weighted earliness and tardiness scheduling problem. (scielo.org.za)
  • In this work we investigate if the performance of Simulated Annealing in solving the single machine weighted earliness-tardiness scheduling problem can be improved by combining the SA algorithm with other sampling methods in a two-step process, the first step being a pre-sampling step to reduce the search space, and the second being to run SA on the reduced search space. (scielo.org.za)
  • We describe an approach for simulating human game-play in strategy games using a variety of AI techniques, including simulated annealing, decision tree learning, and case-based reasoning. (hindawi.com)
  • In addition, we have implemented more sophisticated control over low-level actions that enable the AI-bot to synchronize bombing runs, and used a simulated annealing approach for assigning bombing targets to planes and opponent cities to missiles. (hindawi.com)
  • Based on a lumped-parameter model, the design process uses a simulated annealing algorithm, which is essential to a random-search technique. (aes.org)
  • The Journal of Chemical Physics, 127(18):184105, 2007. (dagstuhl.de)
  • The Journal of chemical physics. (lu.se)
  • This method further improves solutions found by simulated annealing, and thus compensates for the local search effect. (jair.org)
  • In this paper, we propose an improved formula obtained by using simulated annealing (SA) algorithm to calculate the maximum value of the SINR. (kayseri.edu.tr)
  • There is an increasingly interest in statistical methods for models that are easy to simulate from, but for which it is impossible to calculate transition densities or likelihoods. (lu.se)
  • However, to make simulated annealing more efficient to solve large-scale CPPs, in this paper, we propose a new iterated simulated annealing algorithm. (jair.org)
  • First, a new configuration checking strategy based on timestamp is presented and incorporated into simulated annealing to avoid search cycles. (jair.org)
  • An unconventional adaptive simulated annealing technique, called funnel diffusion, determines expansion coefficients for Chebyshev polynomials in the exponential function. (researchgate.net)
  • A new hyperplanes intersection simulated annealing (HISA) algorithm, based on a discrete representation of the search space as a combinatorial set of hyperplanes intersections, is developed for maximum score estimation of the binary choice model. (ssrn.com)
  • The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal. (mdpi.com)
  • This book provides the readers with the knowledge of Simulated Annealing and its vast applications in the various branches of engineering. (cgucrest.org)
  • Several methods are proposed in our algorithm to improve simulated annealing. (jair.org)
  • Moreover, when simulating the best HW pipe network configuration with the Colebrook correlation, some constraints of the design are violated, indicating that the Colebrook formulation is more adequate to be used in conjunction with the GA due to the randomness of the GA with respect to the Reynolds numbers. (sld.cu)
  • Different mathematical formulations of the objective function for minimizing the difference between the observed and simulated pollutant concentration measurements show different levels of accuracy in source identification results. (scirp.org)
  • Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. (mdpi.com)
  • Journal of the Operational Research Society , 59 (7), 963-976. (springer.com)
  • Journal of the Operational Research Society , 49 (8), 799-805. (springer.com)
  • The Journal of the Operational Research Society , 47 (8), 1065-1070. (springer.com)
  • He is also serving as an associate editor of other IEEE prestigious journals including IEEE Transactions on Intelligent Transportation Systems, IEEE Transactions on Automation Science and Engineering and IEEE Transactions on AgriFood Electronics. (essex.ac.uk)
  • Easy to simulate from model conditional on parameters. (lu.se)
  • Q. Sun, H. Langendorfer, An efficient delay-constrained multicast routing algorithm, Journal of High-Speed Networks 7(1) 1998 43-55. (univagora.ro)
  • Purchase individual online access for 1 year to this journal. (iospress.com)
  • You can make submissions to other journals here . (mdpi.com)
  • Editor's Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. (mdpi.com)