Showing 161 - 180 results of 1,855 for search '"simulated annealing"', query time: 0.12s Refine Results
  1. 161

    Double-simulated annealing model for mapping of graphs to single-row networks by Loh, Ser Lee, Salleh, Shaharudin, Sarmin, Nor Haniza

    Published 2008
    “…Thus, the effort to optim ize the ordering of vertices in connected graph for transf orm ation into a planar graph in the form of single-row network is carried out through the new interval form ation and Double Simulated Annealing (DSA).…”
    Get full text
    Book Section
  2. 162
  3. 163

    Simulated annealing approach in solving the minimax problem with fixed line barrier by Tuan Mahmud, Tuan Mariam

    Published 2013
    “…The single-facility problem is solved exactly by solving the MINLP problem using LINGO. Simulated Annealing approach is used in order to solve the multi-facility problem, coded using C++ programming. …”
    Get full text
    Thesis
  4. 164
  5. 165

    Redesigning rain gauges network in Johor using geostatistics and simulated annealing by Mohd. Aziz, Mohd Khairul Bazli, Yusof, Fadhilah, Mohd. Daud, Zalina, Yusop, Zulkifli, Kasno, Mohammad Afif

    Published 2015
    “…This study used the combination of geostatistics method (variance-reduction method) and simulated annealing as the algorithm of optimization during the redesigned proses. …”
    Conference or Workshop Item
  6. 166

    Traveling salesman approach for solving petrol distribution using simulated annealing by Ismail, Zuhaimy, Wan Ibrahim, Wan Rohaizad

    Published 2008
    “…This research presents the development of solution engine based on local search method knownas Greedy Method and with the result generated as the initial solution, Simulated Annealing (SA) andTabu Search (TS) further used to improve the search and provide the best solution. …”
    Article
  7. 167

    Travelling salesman approach for solving visiting route using simulated annealing by Norazmi, Nurul Ain, Wan Ibrahim, Wan Rohaizad

    Published 2016
    “…This research presents the development of solution engine based on local search method known as Simulated Annealing as the initial solution and further use to improve the search and provide the best solution. …”
    Conference or Workshop Item
  8. 168
  9. 169

    Traveling salesman approach for solving goods delivery by using simulated annealing by Wan Ibrahim, Wan Rohaizad, Mazlan, Siti Hajar

    Published 2018
    “…This study is conducted by using a method of Simulated Annealing to find the best route. The optimization problem for this study is generated through a software of Microsoft Visual C++ programming to solve the TSP.…”
    Conference or Workshop Item
  10. 170

    A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

    Published 2004
    “…This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. …”
    Get full text
    Article
  11. 171

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
    Get full text
    Conference or Workshop Item
  12. 172

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Conference or Workshop Item
  13. 173
  14. 174
  15. 175
  16. 176
  17. 177
  18. 178
  19. 179

    Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence by Tanti Octavia, Septiananda Angelica

    Published 2017-12-01
    Subjects: “…picking order; harmony search; simulated annealing…”
    Get full text
    Article
  20. 180