Motivationally unconscious (M-unconscious) states are unconscious states that can directly motivate a subject's behavior and whose unconscious character typically results from a form of repression. The basic argument for M-unconscious states claims that they provide the best explanation for some seemingly non-rational behaviors, like akrasia, impulsivity, or apparent self-deception. This basic ...

Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...

So far various methods for optimization presented and one of most popular of them are optimization algorithms based on swarm intelligence and also one of most successful of them is Particle Swarm Optimization (PSO). Prior some efforts by applying fuzzy logic for improving defects of PSO such as trapping in local optimums and early convergence has been done. Moreover to overcome the problem of i...

This paper presents an efficient meta-heuristic algorithm for optimization of double-layer scallop domes subjected to earthquake loading. The optimization is performed by a combination of harmony search (HS) and firefly algorithm (FA). This new algorithm is called harmony search firefly algorithm (HSFA). The optimization task is achieved by taking into account geometrical and material nonlinear...

in this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. the goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...