Search
Now showing items 11-20 of 29
Scatter search algorithms for the single row facility layout problem
(2013-11-25)
The single row facility layout problem (SRFLP) is the problem of arranging facilities with
given lengths on a line, with the objective of minimizing the weighted sum of the distances
between all pairs of facilities. The ...
Sensitivity Analysis for the Single Row Facility Layout Problem
(2013-11-25)
The single row facility layout problem (SRFLP) is an important combinatorial optimization
problem where a given set of facilities have to be arranged in a single row so as to minimize the
weighted sum of the distances ...
A Review of the Tabu Search Literature on Traveling Salesman Problems
(2009-07-28)
he Traveling Salesman Problem (TSP) is one of the most widely studied problems in
ombinatorial optimization. It has long been known to be NP-hard and hence research on
developing algorithms for the TSP has focused on ...
Implementing Tabu Search to Exploit Sparsity in ATSP Instances
(2009-07-28)
Real life traveling salesman problem (TSP) instances are often large, sparse, and asymmetric.
Conventional tabu search implementations for the TSP that have been reported in the literature,
almost always deals with small, ...
Data correcting algorithms for combinatorial optimization
(2009-12-12)
This paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson ...
Obtaining near-optimal solutions for the binary knapsack problem
(2010-01-16)
In this paper we consider the well-known binary knapsack problem. We propose a method of embedding heuristicsi in a branch and bound framework to optain solutions with profits within a pre-specified quality parameter within ...
Neighborhood search heuristicsfor the uncapacitated facility location problem
(2010-01-16)
The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications ...
Data correcting: a methodology for obtaining near-optimal solutions
(2010-01-16)
In this paper we concern ourselves with the problem of finding near optimal solutions to function that are not amenable to solution by analytic means. This means that given a function and a parameter ? away from the optimal ...
Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram
(2010-01-16)
The Data Correcting Algorithm (DCA) is a recursive branch and bound type algorithm, in which the data of a given instance is heuristically corrected at each branching in such a way that the new instance will be as close ...
Computing the Probability Mass Function of the Maximum Flow through a Reliable Network
(2011-05-26)
This paper proposes a fast state-space enumeration based algorithm called TOP-DOWN capable of computing the probability mass function of the maximum s-t flow through reliable networks. The algorithm computes the probability ...