Search

Abstract: We show that over unbounded domain no algorithm can be created for the integer programming, nonlinear equations, continuous global optimization and constraint satisfaction problems. [Copyright &y& Elsevier]

Abstract: In this paper we show that the unconstrained continuous global minimization problem cannot be solved by any algorithm, so we consider the box constrained continuous global minimization problem. We present a definition of filled function for the problem. Moreover, a new class of filled functions are constructed, which contains only one parameter. A randomized algorithm is designed to solve the box constrained continuous global minimization problem based on the filled function. Numerical experiments are presented to show the practicability of the algorithm. [Copyright &y& Elsevier]

Abstract: We propose a derivative-free implementation of Dekkers and Aarts’ continuous simulated annealing (SA). Essential in DFSA is the ’random direction’ local technique that we introduce. We study the convergence properties of the resulting algorithm and test its performance on a set of 50 problems. Numerical results are presented which show the robustness of the algorithm. Numerical comparisons with SA, two derivative-free simulated annealing algorithms and three population-based global optimization algorithms show that the derivative-free SA, DFSA, offers a reasonable alternative to some recent global optimization algorithms, especially for problems requiring a ‘direct search’ type algorithm. [Copyright &y& Elsevier]

Abstract: In this paper, the partner selection problem with a due date constraint in virtual enterprises is proved to be an NP-complete problem. So it cannot have any polynomial time solution algorithm at present. A nonlinear integer programming model for this problem is established. The objective function and a constraint function of the model have monotone properties. Based on the above observations, a Branch & Bound algorithm is constructed to solve the problem. Numerical experiments show that the algorithm is efficient. [Copyright &y& Elsevier]