Search Results - "Nested partitions algorithm"

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach by Khajemahalle, Leila, Emami, Saeed, Keshteli, Ramezan Nemati

    ISSN: 0315-5986, 1916-0615
    Published: Taylor & Francis 01.01.2021
    “…The dynamic facility layout problem (DFLP) deals with the arrangement of facilities/departments in a factory for different periods so that the location of the…”
    Get full text
    Journal Article
  2. 2

    A framework using nested partitions algorithm for convergence analysis of population distribution-based methods by Chauhdry, Majid H.M.

    ISSN: 2192-4406
    Published: Elsevier Ltd 2023
    “…Stochastic optimization algorithms such as genetic algorithm (GA), particle swarm optimization (PSO), estimation of distribution algorithms (EDAs), and nested…”
    Get full text
    Journal Article
  3. 3

    A Hybrid Nested Partitions Algorithm for Banking Facility Location Problems by Li Xia, Wenjun Yin, Jin Dong, Wu, Teresa, Ming Xie, Yanjia Zhao

    ISSN: 1545-5955, 1558-3783
    Published: Piscataway, NJ IEEE 01.07.2010
    “…The facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location…”
    Get full text
    Journal Article
  4. 4

    Discrete Optimization via Simulation by Hong, L. Jeff, Nelson, Barry L., Xu, Jie

    ISBN: 9781493913831, 1493913832
    ISSN: 0884-8289, 2214-7934
    Published: United States Springer New York 2014
    “…This chapter describes tools and techniques that are useful for optimization via simulation—maximizing or minimizing the expected value of a performance…”
    Get full text
    Book Chapter
  5. 5

    Backtracking Ant Colony Algorithm for the 0ߝ1 Knapsack Problem by Song Jianqiang, Ma Liang

    ISBN: 142447616X, 9781424476169
    ISSN: 2160-1283
    Published: IEEE 01.12.2010
    “…The 0ߝ1 Knapsack Problem is of a class of typical combinational optimization problems and is NP-hard. It has important practical significance to study it…”
    Get full text
    Conference Proceeding