Local hill-climbing algorithms to solve the satis-ability problem have shown to be more eecient than complete systematic methods in many aspects. Many variants and reenements have been developed in the last few years. We now present a neural network approach to evaluate such local GSAT-like algorithms in a parallel manner, i.e. enlarging the neighbourhood of each possible move in the search spa...

A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and mathematical programming (MP) solver to solve novel model for the districting problem in public bicycle-sharing system is presented. The modelled as an integer problem. While rVNS aims find high-quality set of centres repositioning zones, MP computes optimal allocation network stations zones. We u...

Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem has been solved for 2, 3 and very recently for 4 dimensions. We present two nonlinear (nonconvex) mathematical programming models for the solution of the KNP. We solve the problem by using two stochastic global optimiz...

In this paper we propose a variable neighbourhood search (VNS) meta-heuristic [25] for the university examination timetabling problem. In addition to a basic VNS method, we introduce a variety of variants which further improve the quality of the results produced by the technique. We also aim to demonstrate that the proposed technique is capable of producing high quality solutions across a wide ...

Multiple Knapsack Problem (MKP) is a most popular multiple subset selection problem that belongs to the class of NP-Complete problems. The aim is to assign optimal subsets among all original items to some knapsacks, such that the overall profit of all selected items be maximised, while the total weight of all assigned items to any knapsack does not exceed the allowable capacity of it. Artificia...

In combinatorial problems it is often worthwhile simplifying the problem, using operations such as consistency, before embarking on an exhaustive search for solutions. Neighbourhood substitution is such a simplification operation. Whenever a value x for a variable is such that it can be replaced in all constraints by another value y, then x is eliminated. This paper shows that neighbourhood sub...

Since the establishment of the area of search-based software engineering, a wide range of optimisation techniques have been applied to automate various stages of software design and development. Architecture optimisation is one of the aspects that has been automated with methods like genetic algorithms, local search, and ant colony optimisation. A key challenge with all of these approaches is t...

The vehicle routing problem with time windows and simultaneous pick-ups deliveries (VRPTWSPD) is one of the main distribution planning problems. VRPTWSPD aims to find best plan that minimizes number used total travelled distance. Due NP-Hard nature VRPTWSPD, practical large-scale instances cannot be solved optimality within acceptable computational times. Therefore, it necessary develop approxi...

In this paper a variable’s involved in assessing the quality of a distributed generation system are reviewed, aiming to minimize the electric power losses (unused power consumption) and optimize the voltage profile. To provide this assessment, several experiments have been made to the IEEE 34-bus test case and various actual test cases with the respect of multiple DG units. The possibility and ...