𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic for the compact location of process components

✍ Scribed by Luciano Amorese; Vincenzo Cena; Carlo Mustacchi

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
584 KB
Volume
32
Category
Article
ISSN
0009-2509

No coin nor oath required. For personal study only.

✦ Synopsis

The layout of a chemical process umt which muumtzes the costs of the plpmg IS sought by means of a learnmg procedure Numerical expenmentation yields general cntena for the appropnate pohcy to structure the learnmg process

πŸ“œ SIMILAR VOLUMES

A hybrid heuristic for the uncapacitated
A hybrid heuristic for the uncapacitated hub location problem
✍ Sue Abdinnour-Helm πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 991 KB

Given n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single h

Heuristics for the location of inspectio
Heuristics for the location of inspection stations on a network
✍ Michel Gendreau; Gilbert Laporte; Isabelle Parent πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 385 KB πŸ‘ 1 views

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 tota

A heuristic algorithm for determining op
A heuristic algorithm for determining optimal gate and vent locations for RTM process design
πŸ“‚ Article πŸ“… 2004 πŸ› Society of Manufacturing Engineers 🌐 English βš– 238 KB

A detailed discrete-event simulation model is extensively utilized by a major chemical process facility to evaluate new plant designs. This model is further exploited using known statistical techniques to provide valuable sensitivity analysis feedback to engineers for process analysis and improvemen

Analysis of a Local Search Heuristic for
Analysis of a Local Search Heuristic for Facility Location Problems
✍ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati