In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte. In this work an experimental study was performed to evaluate the intensification and diversification balance between these phases. The results show that the heuristic construction phase has a major impact on the tabu search algor...

this paper defines how a meta heuristic search engine called p.s.o can be used to maximize the objective function of a logistic regression model, describing the relationship between the response variable (product designs' score) and a set of explanatory variables (product design factors). at the first phase the processed data, classified and categorized, by kansie engineering is used as input t...

We present results for neutrino emissivities and bulk viscosities of a two-flavor color superconducting quark matter phase with isotropic color-spin-locked (iso-CSL) single-flavor pairing which fulfill the constraints on quark matter derived from cooling and rotational evolution of compact stars. We compare with results for the phenomenologically successful, but yet heuristic 2SC+X phase.

This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows that a heuristic algorithm can also have better overall performance than its time-consuming, Integer Linear Programming (ILP) based counterparts in the online case, which is non-intuitive. The proposed heuristic algorithm ...

Several combinatorial optimization problems can be formulated as large size SetCovering Problems. In this work, we use the Set-Covering formulation to obtain a general heuristic algorithm for this type of problems, and describe our implementation of the algorithm for solving two variants of the well-known (One-Dimensional) Bin Packing Problem: the Two-Constraint Bin Packing Problem and the basi...

We consider the dynamic task allocation problem in multicomputer system with multiprogramming. Programs are given as task interaction graphs that have to be mapped onto the processors at run-time. We propose a fast two-phase heuristic algorithm where phase 1 performs a hierarchic clustering of the tasks which is used by the second phase to map clusters of suitable size onto free partitions of t...

Software pipelining is becoming widely used as a loop execution model for microprocessors supporting a high instruction level parallelism. In this paper we describe a heuristic method for software pipelining, named Graph Traverse Software Pipelining (GTSP), that divides the scheduling problem in two phases: scheduling on a graph and code generation. The first phase encapsulates the NP-complete ...

In this paper, we describe the development of a Greedy Random Adaptive Search Procedure (GRASP) where two low-level graph heuristics, Saturation Degree (SD) and Largest Weighted Degree (LWD) are dynamically hybridised in the construction phase to construct solutions for exam timetabling problems. The problem is initially solved using an intelligent adaptive LWD and SD graph hyper-heuristic whic...

The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...

This paper introduces a three-phase heuristic approach for a large-scale energy management and maintenance scheduling problem. The problem is concerned with scheduling maintenance and refueling for nuclear power plants up to five years into the future, while handling a number of scenarios for future demand and prices. The goal is to minimize the expected total production costs. The first phase ...