Programmable Architecture

-Towards Human Interactive, Cybernetic Architecture-

Kensuke Hotta, Architectural Association School of Architecture

プログラマブル アーキテクチャ


堀田憲祐, 英国建築協会建築学校 

2-3-5. Optimization (Excerpt.)

2-3-5. 最適化 (部分)

2-3-5-1. Objective functions (purpose)

Consider the mathematical programming question, where f: A→R. The goal is to find X0 that satisfies the following equation, 

2-3-5-1. 目的関数(計算目標)


     In this example, “f” is called the objective function to be minimized over variable “x” and condition "A". Generally, in optimization design, designed objects are decided by defining constraint conditions. In the design simulation process, objective functions are used to determine constraints and the minimal solution if it is in a linear programming question. 


     In the Traveling Salesman Problem(TSP), for example, the objective function is described as "Dij" with the distance between the number of nodes (N) and whether or not to include its arc (the aisles of nodes). Xij= 1 means the arc is included in the circuit, while Xij= 0 means the arc is not included. The fitness value of the circuit F is described as,

 例えば、巡回セールスマン問題(TSP)では、目的関数はノードの数(N)とそのアーク(ノードの通路)を含めるかどうかの距離で「Dij」と記述される。「Xij=1 」はそのアークが順路に含まれることを意味し、「Xij=0 」はそのアークが含まれないことを意味する。回路Fの適応度値は次のように記述される。 

~Continue on The book~