This paper puts forward a constructive heuristic algorithm called the method of inserting minimum neighbor edge from outside to center (IMNEFOTC) that can be applied solve large-scale and ultra-large-scale travelling salesman problems. Through it randomized greedy (RGH) which is modified, general meta-heuristic search framework built. The (GSA) based on set initial solutions, continuous 2-opt o...

This paper deals with the flexible job shop scheduling problem with the preventive maintenance constraints where the objectives are to minimize the overall completion time (makespan), the total workload of machines and the workload of the most loaded machine. A fast heuristic algorithm based on a constructive procedure is developed to solve the problem in very short time. The algorithm is teste...

We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitment to variable assignment of local search. Our method backtracks through a space of complete but possibly inconsistent solutions while supporting the freedom to move arbitrarily under heuristic guidance. The version of the schem...

This paper deals with the allocation of multiple advertisements on a Web banner. The purpose is to find a pattern generating algorithm that maximizes the revenue of the allocated advertisements. We set out an extensive simulation using standard banner sizes, primary and secondary sorting criteria for the set of advertisements, and four heuristic algorithms. The heuristic algorithms presented in...

In this work, we introduce the Flowshop Scheduling Problem with Delivery Dates and Cumulative Payoffs. This problem is a variation of the flowshop scheduling problem with job release dates that maximizes the total payoff with a stepwise job objective function. This paper contributes towards proposing a mathematical formulation for this new problem and an original constructive heuristic. Additio...

The problem of sparse matrix bandwidth reduction is addressed and solved with two approaches suitable for both symmetric and non-symmetric matrices. The former is a constructive method, the latter is an application of a metaheuristic scheme. This heuristic algorithm has been implemented on parallel machines. Both approaches are compared with previous methods in the literature (suited only for s...

A combination of distributed computation, positive feedback and constructive greedy heuristic is proposed as a new approach to stochastic optimization and problem solving. Positive feedback accounts for rapid discovery of very good solutions, distributed computation avoids premature convergence, and greedy heuristic helps the procedure to find acceptable solutions in the early stages of the sea...

We present what we call Constructive Default Logic (CDL) a default logic in which the fixedpoint definition of extensions is replaced by a constructive definition which yield so-called constructive extensions. Selection functions are used to represent explicitly the control of the reasoning process in this default logic. It is well-known that Reiter's original default logic lacks, in general, a...

The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of interest in the optimization community. Despite the fact that well-working constructive heuristics are often the basis for well-working metaheuristics, only two constructive h...

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number ...