Titlebook: Computational Science and Its Applications - ICCSA 2014; 14th International C Beniamino Murgante,Sanjay Misra,Osvaldo Gervasi Conference pr

假裝是我

On Modelling Approaches for Planning and Scheduling in Food Processing Industrynce-dependent setups, non-triangular setups and product decay. We show that a trend exists towards so-called big bucket models. However, the advantage of these approaches may become a major obstacle in addressing the identified characteristics in FPI.

META

A Multiobjective Approach for a Dynamic Simple Plant Location Problem under Uncertaintyssible future realizations of uncertainty. In this paper we consider a dynamic simple plant location problem, where uncertainty is explicitly considered through the use of scenarios. We advocate the use of a multiobjective approach as a valuable tool in guiding the decision-making process, iteratively or as an . generation procedure.

多嘴

Automatic Clustering Using a Genetic Algorithm with New Solution Encoding and Operatorstion as fitness function. Experimental validation shows that this new approach outperforms the classical clustering methods K-means and FCM. The method provides good results, and requires a small number of iterations to converge.

DEVIL

Branch and Bound Based Coordinate Search Filter Algorithm for Nonsmooth Nonconvex Mixed-Integer Nonled subproblems at each node of the branch and bound tree search, an algorithm based on a multistart strategy with a coordinate search filter methodology is implemented. The produced numerical results show the robustness of the proposed methodology.

foppish

Robust

國家明智

On Simplicial Longest Edge Bisection in Lipschitz Global Optimization development of a branch-and-bound algorithm to solve multidimensional Lipschitz Global Optimization instances. Experiments show a significant reduction in the number of evaluated simplices for most of the test problems.

招惹

Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular ,-Simt edge to be bisected such that the number of sub-simplices in the generated binary tree is minimal. The difficulty of this Combinatorial Optimization problem increases with .. Therefore, heuristics are studied that aim to minimize the number of generated simplices.

歌曲

Multiple Roots of Systems of Equations by Repulsion Merit Functionse the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.

愛了嗎

A Global Optimization Approach Applied to Structural Dynamic Updating solver previously used, in the updating of a structural dynamic model. The results show also that the . solver is more efficient than the ., since requires less computational effort to obtain the global solution.