Finding good (or even just feasible) solutions for MixedInteger Nonlinear Programming problems independently of the specific problem structure is a very hard but practically useful task, specially when the objective/constraints are nonconvex. We present a generalpurpose heuristic based on Variable Neighbourhood Search, Local Branching, Sequential Quadratic Programming and Branch-and-Bound. We t...

To keep pace with constantly changing markets, many companies are seeking strategic partnerships. In this paper, we assume that a company can electronically provide a profile of the product or service it has to offer. This profile is described in such a way that potential partners can assess the fitness of the company for eventually teaming up. We concentrate on the fully decentralized optimal ...

In this paper, we are addressing the NP-hard nurse rostering problem utilizing a 2-stage approach. stage one, Monte Carlo Tree Search (MCTS) and Hill Climbing (HC) hybridized in finding feasible solution (satisfying all hard constraints). We propose new constant C value (which balances search diversification intensification of MCTS) tree policy/node selection function procedure MCTS. two...

We present an algorithm that computes a depth-three threshold circuit for the classiication of liver tissue. The circuit is calculated from a sample set S of 348 positive (abnormal ndings) and 348 negative (normal liver tissue) examples by a local search strategy. The local search is based on simulated annealing with the logarithmic cooling schedule c(k) = ?= ln (k + 2). The parameter ? depends...

this paper proposes a novel hybrid algorithm namely apso-bfo which combines merits of bacterial foraging optimization (bfo) algorithm and adaptive particle swarm optimization (apso) algorithm to determine the optimal pid parameters for control of nonlinear systems. to balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

We tackle the classroom assignment problem in a large University with the objective of minimising the total distance between all classrooms assigned to teaching activities in the same course. Additional requirements that should be satisfied include: making an efficient utilisation of the space, satisfying room preferences and complying with other administrative requirements. We present two iter...

The feasible solutions of the traveling salesman problem with pickup and delivery (TSPPD) are represented by vertex lists in existing literature. However, when the TSPPD requires that the loading and unloading operations must be performed in a last-in-first-out (LIFO) manner, we show that its feasible solutions can be represented by trees. Consequently, we develop a variable neighbourhood searc...

In this article, a specific production scheduling problem (PSP), the Parallel Machine Scheduling Problem (PMSP) with Job and Sequence Setup Times, Due Dates Maintenance Times is presented. article after introduction literature review mathematical model of Machines After that Monte Carlo Tree Search Simulated Annealing are detailed. Our representation technique its evaluation also introduced. th...

Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours). In recent work, the MLST problem has been shown to be NP-hard and some effective heuristics have been proposed and analyzed. In a currently ongoing project, we investigate an int...

Developing a reasonable and efficient emergency material scheduling plan is of great significance to decreasing casualties property losses. Real-world (EMS) problems are typically large-scale possess complex constraints. An evolutionary algorithm (EA) one the effective methods for solving EMS problems. However, existing EAs still face challenges when dealing with or equality To handle above cha...