24 articles for “Metaheuristic”

Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless NetworksMatthieu Andr, Gilles Pesant, Samuel PierreThe problem of assigning cells to switches in wireless networks consists of minimizing the total operating cost, that is, the cost of linking cells to switches and the cost of handover from one cell to another, by taking into account factors such as network topology, switch capacity and traffic load in the entire network. Such a problem is well known … …Journal of Computer Science, Vol. 1, Issue 2 · 30 Jun 2005 · 6,748 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Randomized Population Constructive Heuristic for the Team Orienteering ProblemManal ZettamThe NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, solving optimally the team orienteering problem would play … …Journal of Computer Science, Vol. 13, Issue 9 · 17 Jun 2017 · 8,285 accessesView PDF Cite

Research ArticleOpen accessIn the abstractLOW COMPLEXITY CONSTRAINTS FOR ENERGY AND PERFORMANCE MANAGEMENT OF HETEROGENEOUS MULTICORE PROCESSORS USING DYNAMIC OPTIMIZATIONA. S. Radhamani, E. BaburajOptimization in multicore processor environment is significant in real world dynamic applications, as it is crucial to find and track the change effectively over time, which requires an optimization algorithm. In massively parallel processing multicore processor architectures, like other population based metaheuristics Constraint based Bacterial Foraging Particle Swarm Optimization (CBFPSO) scheduling can be effectively implemented. In this study we discuss … …Journal of Computer Science, Vol. 10, Issue 8 · 3 Apr 2014 · 6,645 accessesView PDF Cite