The International Sourcing Problem consists of selecting a subset from an available set of potential suppliers internationally located. The selected suppliers must meet the demand for items of a set of plants, which are also located worldwide. Since the costs are affected by macroeconomic conditions in the countries where the supplier and the plant are located, the formulation considers the unc...

In this paper, a simulated-annealing-based method called Filter Simulated Annealing (FSA) method is proposed to deal with the constrained global optimization problem. The considered problem is reformulated so as to take the form of optimizing two functions, the objective function and the constraint violation function. Then, the FSA method is applied to solve the reformulated problem. The FSA me...

For multi-dimensional function optimization problems, classical differential evolution (DE) algorithm may deteriorate its intensification ability because different dimensions may interfere with each other. To deal with this intrinsic shortage, this paper presents a DE algorithm framework with fine evaluation strategy. In the process of search, solution is updated and evaluated dimension by dime...

The social foraging behavior of Escherichia coli has recently received great attention and it has been employed to solve complex search optimization problems. This paper presents a modified bacterial foraging optimization BFO algorithm, ICDEOA (Improved Chemotaxis Differential Evolution Optimization Algorithm), to cope with premature convergence of reproduction operator. In ICDEOA, reproduction...

We present in this article new strategies for selecting nodes in interval Branch and Bound algorithms for constrained global optimization. For a minimization problem the standard best-first strategy selects a node with the smallest lower bound of the objective function estimate. We first propose new node selection policies where an upper bound of each node/box is also taken into account. The go...

The focal objective of this study is to analyze and explore the Co-movement of Pakistan stock market (KSE-100) with the stock market of developed countries (US, UK, Canada, Australia, Germany, Japan, France and Neither land) which have portfolio investment in Pakistan by applying co-integration approach using Johansen and Juselius multivariate and bi variate co-integration. Secondary data of st...

The bipartite unconstrained 0-1 quadratic programming problem (BQP) is a difficult combinatorial problem defined on a complete graph that consists of selecting a subgraph that maximizes the sum of the weights associated with the chosen vertices and the edges that connect them. The problem has appeared under several different names in the literature, including maximum weight induced subgraph, ma...

This paper presents a new approach for solution of the economic load dispatch (ELD) problem with valve-point effect using a modified particle swarm optimization (MPSO) technique. The practical ELD problems have non-smooth cost function with equality and inequality constraints, which make the problem of finding the global optimum difficult when using any mathematical approaches. In this paper, a...

In this paper, we present a new framework for combining complete and incomplete methods in order to deal with the Max Sat problem. The objective is to find the best assignment for a set of Boolean variables, which gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem has been shown to be NP-hard (non-deterministic polynomial-time hard) if the number of variable...