Resource constrained project scheduling problem (RCPSP) is one of the most intractable combinatorial optimization problems. RCPSP belongs to class NP hard Integer Programming (IP) exact solving methods that can be used for RCPSP. IP formulation uses binary decision variables generating a feasible solution and with different boundaries eliminates some solutions reduce space size. All methods, including IP, search through entire so they are impractical very large instances. Due fact not...

The container relocation problem is a combinatorial optimisation aimed at finding sequence of relocations to retrieve all containers in predetermined order by minimising given objective. Relocation rules (RRs), which consist priority function and scheme, are heuristics commonly used for solving the mentioned due their flexibility efficiency. Recently, many real-world problems it becoming increasingly important consider energy consumption. However, this variant no RRs exist would need be...

In Group Steiner Tree Problem (GST) we are given a weighted undirected graph and family of subsets vertices which called groups. Our objective is to find minimum-weight subgraph contains at least one vertex from each group (groups do not have be disjoint). GST NP-hard combinatorial optimization problem that arises many complex real-life problems such as finding substrate-reaction pathways in protein networks, progressive keyword search relational databases, team formation social etc....

In this paper we consider a novel Integer programming approach for the cluster-based model used time-series forecasting. There are several approaches in literature that aim to find set of patterns which represent similar situations time series. order predict target variable, different types fitting methods can be applied data belongs same pattern. We propose method uses clustering and prediction value as mean values cluster, minimize total squared deviation between predicted real variable....

The container relocation problem is a challenging combinatorial optimisation tasked with finding sequence of relocations required to retrieve all containers by given order. Due the complexity this problem, heuristic methods are often applied obtain acceptable solutions in small amount time. These include rules (RRs) that determine moves need be performed efficiently next based on certain yard properties. Such designed manually domain experts, which time-consuming and task. This paper...

The paper deals with modelling a specific problem called the Optimal Seating Arrangement (OSA) as an Integer Linear Program and demonstrated that can be efficiently solved by combining branch-and-bound cutting plane methods.OSA refers to scenario could possibly happen in corporative environment, i.e. when company endeavors minimize travel costs employees organized event.Each employee is free choose time from event it depends on personal reasons.The differentiates between using different...

The container relocation problem is a combinatorial optimisation aimed at finding sequence of relocations to retrieve all containers in predetermined order by minimising given objective. Relocation rules (RRs), which consist priority function and scheme, are heuristics commonly used for solving the mentioned due their flexibility efficiency. Recently, many real-world problems it becoming increasingly important consider energy consumption. However, this variant no RRs exist would need be...

Designing heuristics is an arduous task, usually approached with hyper-heuristic methods such as genetic programming (GP). In this setting, the goal of GP to evolve new that generalise well, i.e., work well on a large number problems. To achieve this, must use good training model and also evaluate their generalisation ability. For reason, dozens models have been used in literature. However, there lack comparison between different determine effectiveness, which makes it difficult choose right...