scholarly journals On integer network synthesis problem with tree-metric cost

JSIAM Letters ◽  
2017 ◽  
Vol 9 (0) ◽  
pp. 73-76
Author(s):  
Hiroshi Hirai ◽  
Masashi Nitta
Keyword(s):  
Synthesis Problem ◽  
Network Synthesis ◽  
Tree Metric

Heat Exchanger Network Synthesis

1995 ◽  
Author(s):  
Christodoulos A. Floudas
Keyword(s):  
Heat Exchanger ◽  
Energy Recovery ◽  
Combinatorial Problem ◽  
Synthesis Problem ◽  
Network Synthesis ◽  
Heat Exchanger Network ◽  
Different Types ◽  
The 1960S ◽  
Heat Exchanger Network Synthesis ◽  
Liquid Vapor

This chapter focuses on heat exchanger network synthesis approaches based on optimization methods. Sections 8.1 and 8.2 provide the motivation and problem definition of the HEN synthesis problem. Section 8.3 discusses the targets of minimum utility cost and minimum number of matches. Section 8.4 presents synthesis approaches based on decomposition, while section 8.5 discusses simultaneous approaches. Heat exchanger network HEN synthesis is one of the most studied synthesis/design problems in chemical engineering. This is attributed to the importance of determining energy costs and improving the energy recovery in chemical processes. The comprehensive review of Gundersen and Naess (1988) cited over 200 publications while a substantial annual volume of studies has been performed in the last few years. The HEN synthesis problem, in addition to its great economic importance features a number of key difficulties that are associated with handling: (i) The potentially explosive combinatorial problem for identifying the best pairs of hot and cold streams (i.e., matches) so as to enhance energy recovery; (ii) Forbidden, required, and restricted matches; (iii) The optimal selection of the HEN structure; (iv) Fixed and variable target temperatures; (v) Temperature dependent physical and transport properties; (vi) Different types of streams (e.g., liquid, vapor, and liquid-vapor); and (vii) Different types of heat exchangers (e.g., counter-current, noncounter-current, multistream), mixed materials of construction, and different pressure ratings. It is interesting to note that the extensive research efforts during the last three decades toward addressing these aforementioned difficulties/issues exhibit variations in their objectives and types of approaches which are apparently cyclical. The first approaches during the 1960s and early 1970s treated the HEN synthesis problem as a single task (i.e., no decomposition into sub-tasks). The work of Hwa (1965) who proposed a simplified superstructure which he denoted as composite configuration that was subsequently optimized via separable programming was a key contribution in the early studies, as well as the tree searching algorithms of Pho and Lapidus (1973). Limitations on the theoretical and algorithmic aspects of optimization techniques were, however, the bottleneck in expanding the applicability of the mathematical approaches at that time.

scholarly journals Heuristics for Synthesizing Robust Networks with a Diameter Constraint

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Harsha Nagarajan ◽  
Peng Wei ◽  
Sivakumar Rathinam ◽  
Dengfeng Sun
Keyword(s):  
Tabu Search ◽  
Shortest Path ◽  
Synthesis Problem ◽  
Network Synthesis ◽  
Algebraic Connectivity ◽  
Computational Results ◽  
Link Failures ◽  
Search Heuristics ◽  
Key Factor ◽  
Feasible Solutions

Robustness of a network in the presence of node or link failures plays an important role in the design of the network. A key factor that quantifies this robustness is the algebraic connectivity of the network. In this paper, the authors address the problem of finding a network that maximizes the algebraic connectivity of the network while ensuring that the length of the shortest path joining any two nodes in the network is within a given bound. This paper presentsk-opt and tabu search heuristics for finding feasible solutions for this network synthesis problem. Computational results are also presented to corroborate the performance of the proposed algorithms.

Heuristics for the Process Network Synthesis Problem

2001 ◽  
pp. 1-17
Author(s):  
Z. Blázsik ◽  
Cs. Holló ◽  
Cs. Imreh ◽  
Z. Kovács
Keyword(s):  
Synthesis Problem ◽  
Network Synthesis

scholarly journals ON HALF-INTEGRALITY OF NETWORK SYNTHESIS PROBLEM

2014 ◽  
Vol 57 (2) ◽  
pp. 63-73 ◽  
Author(s):  
Than Nguyen Hau ◽  
Hiroshi Hirai ◽  
Nobuyuki Tsuchimura
Keyword(s):  
Synthesis Problem ◽  
Network Synthesis

Process network synthesis: Problem definition

Networks ◽  
1998 ◽  
Vol 31 (2) ◽  
pp. 119-124 ◽  
Author(s):  
F. Friedler ◽  
L. T. Fan ◽  
B. Imreh
Keyword(s):  
Problem Definition ◽  
Synthesis Problem ◽  
Network Synthesis

scholarly journals Integer version of the multipath flow network synthesis problem

2008 ◽  
Vol 156 (18) ◽  
pp. 3376-3399 ◽  
Author(s):  
S.N. Kabadi ◽  
R. Chandrasekaran ◽  
K.P.K. Nair ◽  
Y.P. Aneja
Keyword(s):  
Synthesis Problem ◽  
Network Synthesis ◽  
Flow Network

Synthesizing Robust Communication Networks for Unmanned Aerial Vehicles With Resource Constraints

2015 ◽  
Vol 137 (6) ◽  
Author(s):  
Harsha Nagarajan ◽  
Sivakumar Rathinam ◽  
Swaroop Darbha
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Communication Networks ◽  
Resource Constraints ◽  
Synthesis Problem ◽  
Mixed Integer ◽  
Semidefinite Program ◽  
Total Power ◽  
Network Synthesis ◽  
Aerial Vehicles ◽  
The Cost

In this article, we address the problem of synthesizing communication networks for unmanned aerial vehicles (UAVs) in the presence of resource constraints. UAVs can be deployed as backbone nodes in ad hoc networks that can be central to civilian and military applications. The cost of operation of the network depends on the resources that are used such as the total power consumption associated with the network and the number of communication links in the network. The objective of the problem is to synthesize a communication network that maximizes connectivity subject to the cost of operation being within the specified budget for the resources. It is known that algebraic connectivity is a measure of robust connectivity and hence, it is chosen as an objective for optimization. We pose the network synthesis problem as a mixed-integer semidefinite program (MISDP): (1) provide an algorithm for computing optimal solutions using cutting plane methods; (2) develop lower bounds by posing the problem as a binary semidefinite program; and (3) construct feasible solutions using heuristics and estimate their quality. The network synthesis problem is a nondeterministic polynomial--time (NP)-hard problem. We provide some computational results to corroborate the performance of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document