Model and Analysis of Economic- and Risk-Based Objective Optimization Problem for Plant Location within Industrial Estates Using Epsilon-Constraint Algorithms

In many countries, a number of industrial estates have been established to support the growth of the industrial sector, which is an essential strategy to drive economic growth. Planning for the location of industrial factories within an industrial estate, however, becomes complex, given the various...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computation Jg. 9; H. 4; S. 46
Hauptverfasser: Wattanasaeng, Niroot, Ransikarbum, Kasin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.04.2021
Schlagworte:
ISSN:2079-3197, 2079-3197
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In many countries, a number of industrial estates have been established to support the growth of the industrial sector, which is an essential strategy to drive economic growth. Planning for the location of industrial factories within an industrial estate, however, becomes complex, given the various types of industrial plants and the requirements of utilities to support operations within an industrial park. In this research, we model and analyze bi-objective optimization for locating plants within an industrial estate by considering economic- and risk-based cost objectives. Whereas economic objectives are associated with utility distances between plant locations, risk-based cost is a surrogate criterion derived from safety considerations. Next, risk-based data are further generated from Areal Locations of Hazardous Atmospheres (ALOHA), the hazard modeling program, and solutions to the bi-objective model are obtained from the Epsilon-constraint algorithm. Finally, the model is applied to a regional case study in a Thailand industrial estate, and the Pareto frontier is evaluated to demonstrate the trade-off between objectives.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2079-3197
2079-3197
DOI:10.3390/computation9040046