-In this paper, multi-objective optimal placement (MOOP) of multi-type flexible AC transmission systems (FACTS) devices for Thailand power system is proposed. Four types of FACTS devices are used: thyristor-controlled series capacitor (TCSC), thyristor-controlled phase shifter (TCPS), unified power flow controller (UPFC), and static var compensator (SVC). The problem is decomposed into the opti...

In recent years many solution approaches for different school timetabling problems (TTP) have been tried, among them tabu search, simulated annealing, genetic algorithms, and constraint programming [8]. However, most of the solution methods developed so far have been tested by means of only few (mostly only a handful) problem instances [6]. Further, until today there are nearly no reports on te...

Stochastic optimization is an important task in many optimization problems where the tasks are not expressible as convex optimization problems. In the case of non-convex optimization problems, various different stochastic algorithms like simulated annealing, evolutionary algorithms, and tabu search are available. Most of these algorithms require user-defined parameters specific to the problem i...

This paper presents a methodology to solve the Just-in-Time (JIT) sequencing problem for multiple product scenarios when set-ups between products are required. Problems of this type are combinatorial, and complete enumeration of all possible solutions is computationally prohibitive. Therefore, Genetic Algorithms are often employed to ® nd desirable, although not necessarily optimal, solutions. ...

In a previous paper, a simple genetic algorithm (GA) was developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem (PFSP). The performance of the algorithm was comparable to that of a naive neighborhood search technique and a proven simulated annealing algorithm. However, recent results have demonstrated the superiority of a tabu ...

An extension of the Disjunctive Model, eeciently representing Jobshop Scheduling (JS) problem, to more general Resource-Constrained Project Scheduling (RCPS) problem is proposed. The extension considers diierent groups of resources used by activities in diierent amounts limited to a constant value in every moment of the project duration. A solution to the problem is represented by a project res...

Screening of topologies developed by hierarchical heuristic procedures can be carried out by comparing their optimal performance. In this work we will be exploiting mono-objective process optimization using two algorithms, simulated annealing and tabu search, and four different objective functions: two of the net present value type, one of them including environmental costs and two of the globa...

The response time variability problem (RTVP) is a scheduling problem that arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the instants at which they receive the necessary resources is minimised. The RTVP is an NP-hard problem and heuristic and metaheuristic techniques are needed to solve non-small instances. The best results ...

We first present a literature review of heuristics and metaheuristics developed for the problem of coloring graphs. We then present a Greedy Randomized Adaptive Search Procedure (GRASP) for coloring sparse graphs. The procedure is tested on graphs of known chromatic number, as well as random graphs with edge probability 0.1 having from 50 to 500 vertices. Empirical results indicate that the pro...