HEURISTICS
2002
13 years 4 months ago
2002
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
HEURISTICS
2000
13 years 4 months ago
2000
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
EOR
2000
13 years 4 months ago
2000
A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu...
ANOR
2002
13 years 4 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
IJAIT
2007
13 years 5 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
EOR
2007
13 years 5 months ago
2007
This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when t...
EOR
2007
13 years 5 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
JSAC
2006
13 years 5 months ago
2006
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
JUCS
2008
13 years 5 months ago
2008
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...
INFORMATICALT
2006
13 years 5 months ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...