𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristics for the location of inspection stations on a network

✍ Scribed by Michel Gendreau; Gilbert Laporte; Isabelle Parent

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
385 KB
Volume
47
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin-destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems.

πŸ“œ SIMILAR VOLUMES

Trade-offs on the location of the core n
Trade-offs on the location of the core node in a network
✍ Jean-FranΓ§ois Macq; Michel X. Goemans πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worst‐case t

On a function for the vulnerability of a
On a function for the vulnerability of a directed flow network
✍ Masakazu Sengoku; Shoji Shinoda; Reigo Yatsuboshi πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 441 KB πŸ‘ 1 views

The concept of vulnerability of a network, by which we mean the susceptibility of the network to attack, is very useful for the design of networks such as computer networks and communication networks. In this paper, a directed flow network, in which a nonnegative real number called edge capacity or