In this work we present a multi-neighborhood, parallel local search approach for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (MMRCMPSP). The search in multiple neighborhoods is conducted in parallel with dynamic load balancing among processors. Our solver works with an indirect solution representation and navigates through space of the feasible solutions by combining he...

In this work we present a multi-neighborhood, parallel local search approach for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (MMRCMPSP). The search in multiple neighborhoods is conducted in parallel with dynamic load balancing among processors. Our solver works with an indirect solution representation and navigates through space of the feasible solutions by combining he...

A piano fingering indicates which finger should play each note in a piece. Such a guideline is very helpful for both amateur and experienced players in order to play a piece fluently. In this paper, we propose a variable neighborhood search algorithm to generate piano fingerings for complex polyphonic music, a frequently encountered case that was ignored in previous research. The algorithm take...

The order batching problem is a part of the picking process of items in a warehouse. A set of items conform an order and a set of orders conform a batch. The problem consist of grouping the orders received in the warehouse in different batches. Each batch have to be collected by a single picker without exceed a capacity limit. The objective is to minimize the total time needed to collect all th...

In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...

In this paper, an effective approach based on the variable neighborhood search (VNS) algorithm is presented to solve the uncapacitated multilevel lot-sizing (MLLS) problems with component commonality and multiple end-items. A neighborhood structure for the MLLS problem is defined, and two kinds of solution move policies, i.e., move at first improvement (MAFI) and move at best improvement (MABI)...

in this paper, a hybrid method for limited resource allocation and leveling in complex multi-stage, multi-product and multi-period production planning problems with aim of lot-size determination and total cost minimization has been proposed. this problem consists of multiple products with sequential production processes that are produced in different periods to meet the customers demand. by det...

Given an undirected weighted graph G = (V,E) with vertex set V, edge set E and weights wi ∈ R associated to V or to E. Minimum weighted k-Cardinality tree problem (k-CARD for short) consists of finding a subtree of G with exactly k edges whose sum of weights is minimum [4]. There are two versions of this problem: vertex-weighted and edge-weighted, if weights to V or to E are associated, respect...

Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the...

We consider a multi-neighborhood local search algorithm with a large number of possible neighborhoods. Each neighborhood is accompanied by a weight value which represents the probability of being chosen at each iteration. These weights are fixed before the algorithm runs, and are considered as parameters of the algorithm. Given a set of instances, off-line tuning of the algorithm’s parameters c...