The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper, we present two tabu search implementations, one involving...

Blowouts are nancially damaging for drilling companies and are ecological hazards. Hence blowout prevention equipment is critical infrastructure for drilling companies. Blowout preventer valves are important components of blowout prevention equipments and need to be checked regularly. However,...

Blowout Preventers (BOPs) and choke manifolds are key pieces of drilling rig equipment to prevent the uncontrolled release of potentially hazardous formation fluids to surface. The blowout prevention testing problem is that of testing BOP valves to check if they are functional or not. Several...

In this work we present a local search algorithm for the single row facility location problem. In contrast to other local search algorithms for the problem, our algorithm uses an exponential neighborhood structure. Our computations indicate that our local search algorithm generates solutions to...

Reliable networks are those in which network elements have a positive probability of failing. Conventional performance measures for such networks concern themselves either with expected network performance or with the performance of the network when it is performing well. In reliable networks...

The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as well as on randomly generated instances....

In this paper we propose a local search based improvement heuristic called diversified local search for the traveling salesman problem. We show through computational experiements that this algorithm outperforms tabu search with similar neighborhood structures on large sized traveling salesman...

The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network connecting several individual networks. In...

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 problem, the problem of maximizing submodular functions, and the simple...