Keywords: Extended/enhanced central force optimization (ECFO) Global optimization Convergence analysis Simple central force optimization (SCFO) Gravitational force a b s t r a c t Simple central force optimization (SCFO) algorithm is a novel physically-inspired optimization algorithm as simulating annealing (SA). To enhance the global search ability of SCFO and accelerate its convergence, a nov...

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

Inspired by the biological evolution, local cooperation behaviors have been modeled in function optimizations for providing effective search methods. This paper proposes a new meta-heuristic algorithm named Neighborhood Field Optimization algorithm (NFO), which totally utilizes the local cooperation of individuals. This paper also analyzes how the local cooperation helps optimization, which is ...

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

Objective: The objective of this research is to verify if the use diagnostic or interactive budgets, moderated by heuristic behaviors, influences controllers' professional competencies.
 Methodology: This a descriptive study carried out means survey with 109 individuals who work as controllers. In order meet objective, in addition diagnosing data counting answers, logistic regression model...

In this paper we develop and test a distributed algorithm providing Energy Consumption Schedules (ECS) in smart grids for a residential district. The goal is to achieve a given aggregate load profile. The NP-hard constrained optimization problem reduces to a distributed unconstrained formulation by means of Lagrangian Relaxation technique, and a meta-heuristic algorithm based on a Quantum inspi...

This paper presents a dynamic Service Level Agreement (SLA) negotiation scheme between peer autonomous systems (ASes) that implement DiffServ per domain behaviors. For concreteness, we tailor our scheme to account for the needs of VoIP transport across multiple ASes. We present a heuristic but computationally simple and distributed scheme that uses traffic statistics to forecast the near-future...

This paper describes a Bayesian approach to the abstraction of sensor dynamics using a new clustering algorithm for time series to learn prototypical behaviors of a robot's sensory inputs. Each sensor stream reading is modeled as a Markov chain (mc). The abstraction process is performed by an unsupervised clustering algorithm returning the most probable set of clusters capturing the robot's sen...