See discussions, stats, and author profiles for this publication at: [Link]

net/publication/396923642

Director-Inspired Optimization Algorithm

Preprint · October 2025

DOI: 10.5281/zenodo.17378767

CITATIONS

1 author:

Jincheng Zhang
Rajabhat Maha Sarakham University
477 PUBLICATIONS 1,417 CITATIONS

SEE PROFILE

All content following this page was uploaded by Jincheng Zhang on 27 October 2025.

The user has requested enhancement of the downloaded file.

 Director-Inspired Optimization Algorithm

Jincheng Zhang*1[0009-0005-1860-0009]
1
Faculty of Science and Technology, Rajabhat Maha Sarakham University, Maha Sarakham
44000, Thailand
zjc1639834588@[Link]

Abstract. As a core figure in the creation of stage arts, the work of a stage
director involves not only script interpretation, actor guidance, stage layout, and
lighting control, but also complex decision-making processes such as emotion
management, character collaboration, and artistic innovation. This paper
proposes a Director-Inspired Optimization Algorithm (DIOA) for stage
directors. This algorithm abstracts the director's decision-making process during
rehearsals and performances into an optimization problem. It proposes a unique
emotion-driven weight update mechanism, a ternary and high-order
collaborative tensor mechanism, and a creative leap and collaborative priority
optimization mechanism. Through a purely mathematical formulation
describing the algorithm's structure and workflow, it demonstrates the
complexity and systematic nature of the director's decision-making in the
optimization process. This algorithm can not only be used for stage layout and
actor performance optimization, but can also be extended to multi-objective,
multi-element collaborative optimization problems, providing a new theoretical
framework for heuristic optimization methods.

Keywords: Stage director, heuristic algorithm, collaborative tensor, emotion-

driven weight, optimization.

I. Introduction

The director of a stage play is a central figure in the art of stage performance, and
their decisions directly impact the artistic effect and audience experience of the play.
During rehearsal, the director faces numerous challenges: multiple factors, such as
actor movements, stage props, lighting and sound effects, and emotional expression,
must be coordinated and unified. Furthermore, the director must adjust the stage
layout and performance strategy based on the plot's climaxes and emotional conflicts.
This decision-making process has the following characteristics:

Multi-factor collaboration: The director must balance the interactions between

multiple actors and stage elements to achieve the best overall performance.

Emotional sensitivity: The director has a keen sense of emotional conflicts and
climaxes and continuously adjusts them during rehearsals.
2 F. Author and S. Author

Creativity and innovation: The director will break the rules and make bold stage
adjustments when necessary.

Iterative optimization: The director continuously fine-tunes the performance and stage
elements through multiple rounds of rehearsals and feedback to achieve the optimal
presentation.

Traditional optimization algorithms (such as genetic algorithms, simulated annealing

algorithms, or particle swarm algorithms) have certain advantages in solving multi-
objective and multi-constraint problems, but lack the ability to simulate the director's
decision-making patterns [1-41]. The algorithm proposed in this paper, inspired by the
thinking and rehearsal methods of stage directors, proposes a novel optimization
mechanism and mathematical model to efficiently simulate complex stage
optimization problems.

II. Problem Modeling

Suppose a stage optimization problem consists of n elements, including actor

movements, stage prop positions, lighting parameters, and so on. Each element can be
represented as a vector x_i. The algorithm's goal is to maximize the overall stage
effect by optimizing X = {x_1, x_2, ..., x_n}.

2.1 Element State Representation

Each element x_i can be a continuous or discrete variable, and its state vector is
defined as:

x_i ∈ ℝ^d_i or x_i ∈ {v_1, v_2, ..., v_m}

Also, each element has an emotion mapping vector e_i, which represents its
emotional characteristics during stage performance:

e_i = (e_i1, e_i2, ..., e_ik)

where k represents an emotional dimension, such as tension, conflict, or

expressiveness.

2.2 Stage Collaboration Tensor

Stage elements not only have pairwise relationships but can also generate higher-
order collaborative effects. To simulate a director's focus on multi-element
collaboration, this paper introduces a ternary and higher-order collaboration tensor C:
 Contribution Title (shortened if too long) 3

C ∈ ℝ^{n × n × n}

Where C_{i,j,k} = g(x_i, x_j, x_k) represents the ternary collaborative contribution
between elements x_i, x_j, and x_k, such as the visual aesthetic or emotional impact
generated by the interaction between two actors and props.

2.3 Overall Objective Function

Stage directors consider three factors during the optimization process: single-element
effects, two-element collaboration, and ternary and higher-order collaboration. The
overall objective function is defined as:

F(X) = Σ_{i=1}^{n} w_i * f_i(x_i) + Σ_{1 ≤ i < j ≤ n} v_{i,j} * g(x_i, x_j) + Σ_{1 ≤
i < j < k ≤ n} u_{i,j,k} * C_{i,j,k}

Where:

f_i(x_i): Single-element artistic effect score

g(x_i, x_j): Two-element collaborative score

C_{i,j,k}: Triple collaborative tensor contribution

w_i, v_{i,j}, u_{i,j,k}: Weight coefficients, dynamically updated by the emotion-

driven weighting mechanism

III. Emotion-Driven Weighting Mechanism

During rehearsal, stage directors adjust their focus based on the actors' performance,
the interactive effects of stage elements, and the emotional state of the plot. To
simulate this, a dynamic emotion-driven weighting adjustment mechanism is
introduced.

3.1 Element Weight Update

Define the weight ω_i(t) of element x_i at iteration t. Its update formula is:

ω_i(t+1) = ω_i(t) * (1 + α * E_i(t) / Σ_{j=1}^{n} E_j(t))

Where α is the emotion sensitivity coefficient, and E_i(t) is the element's emotion
deviation:

E_i(t) = Σ_{d=1}^{k} | e_i(d) - e_i_desired(d) |

4 F. Author and S. Author

This mechanism ensures that elements whose emotional performance deviates from
the target during rehearsal receive more attention, improving algorithm optimization
efficiency.

3.2 Ternary Collaboration Weights

The weights u_{i,j,k} of the ternary collaboration tensor are dynamically adjusted
based on the element's sentiment weight:

u_{i,j,k} = β * (ω_i + ω_j + ω_k) / 3

Where β is the global collaboration adjustment coefficient, used to balance the

contributions of individual elements and collaborations.

IV. Director's Heuristic Search Mechanism

A stage director's rehearsal decisions can be abstracted into three parts: local fine-
tuning, creative leaps, and collaboration-prioritized optimization.

4.1 Local Fine-tuning (Rehearsal Adjustment)

Apply a small perturbation δ_i to each element x_i:

x_i(t+1) = x_i(t) + δ_i

The perturbation amount δ _i can be prioritized based on the element's sentiment

weight or the importance of collaboration. The incremental objective function for
local updates is defined as:

ΔF_i = w_i * Δf_i + Σ_{j=1, j≠i}^{n} v_{i,j} * Δg_{i,j} + Σ_{j<k, j,k≠i} u_{i,j,k} *
ΔC_{i,j,k}

Update Condition:

If ΔF_i > 0, accept the new state.

If Δ F_i ≤ 0, accept with probability p_i = exp( Δ F_i / T), simulating a director
experimenting with creative adjustments during rehearsal.

4.2 Director Creativity Jump

Directors often make bold innovations in key scenes. The algorithm simulates this
through global random perturbations or heuristic selection:

For a set of high-emotion or high-conflict elements H ⊆ X, generate a new state:

 Contribution Title (shortened if too long) 5

x_h_new = argmax_{x ∈ CandidateSet_h} [ f_h(x) + Σ_{j} v_{h,j} * g(x, x_j) + Σ

_{j<k} u_{h,j,k} * C(x, x_j, x_k)

This mechanism can escape local optima and improve global exploration capabilities.

4.3 Collaboration Priority

Higher-order collaborative elements are prioritized to ensure overall performance:

Define the collaboration gradient:

∇i F_collab = ∂/∂x_i Σ{j<k} u_{i,j,k} * C_{i,j,k}

Local search adjusts element x_i along ∇ _i F_collab to maximize collaborative

contribution.

V. Algorithm Flow

The overall algorithm flow is as follows:

Input: Maximum number of iterations MaxIter, number of elements n, initial weights

w_i, vi_ij, u_ijk
Output: Optimal solution X*

X = Initialize solution()
Calculate the sentiment vector e_i and the collaboration tensor C
for t = 1 to MaxIter:
Update the sentiment-driven weight ω_i(t)
Update the collaboration weight u_{i,j,k}
# Local fine-tuning
for i in X:
x_i_new = x_i + δ_i
ΔF_i = w_i*Δf_i + Σ_j v_{i,j}*Δg_{i,j} + Σ_{j<k} u_{i,j,k}*ΔC_{i,j,k}
if ΔF_i > 0 or rand() < exp(ΔF_i/T):
x_i = x_i_new
# Creative jump
Perform creative jump on high-sentiment elements H
# Collaboration-first optimization
Adjust elements along the collaboration gradient ∇_i F_collab
Update the overall objective F(X)
Save the optimal solution X*
T = Cooling Function (T) # Temperature Drop
return X*
6 F. Author and S. Author

VI. Algorithm Features and Innovations

Emotion-Driven Weighting Mechanism: Dynamically focuses on the most critical

stage elements, simulating the director's emotional perception during rehearsal.

High-Order Collaboration Tensor: Considers ternary and higher-order collaborations,

capturing complex stage interactions and surpassing the traditional two-element
collaboration model.

Creative Leap Mechanism: Introduces bold innovations based on local search to

enhance the algorithm's global exploration capabilities.

Collaboration-Prioritized Optimization Mechanism: Prioritizes optimization of

higher-order collaborative elements to maximize the overall stage effect.

Pure Mathematical Formulation: From single-element scoring to collaboration tensors

and then to emotion-driven weight updates, a complete and operational mathematical
optimization framework is formed.

VII. Application Prospects

The heuristic optimization algorithm for stage play directors proposed in this paper
has broad application value:

Stage Art Optimization: It can be used for the automatic optimization of stage layout,
actor movements, and lighting design.

Multi-Objective Collaborative Optimization: It is applicable to multi-element

collaboration problems, such as robot collaboration and resource scheduling.

Combining Art and Science: It systematizes directorial artistic decision-making,

providing new insights for heuristic optimization algorithms.

Future research could build on this foundation by introducing multi-objective

optimization, dynamic environmental adaptation mechanisms, or real-time adjustment
mechanisms based on emotional feedback to further enhance the algorithm's
practicality and intelligence.

VIII. Conclusion

This paper proposes a novel heuristic optimization algorithm for stage play directors
that fully simulates the director's decision-making process during rehearsals and
performances. By leveraging emotion-driven weights, ternary and high-order
collaboration tensors, creative leaps, and collaborative priority optimization, the
 Contribution Title (shortened if too long) 7

algorithm effectively captures the complex multi-element interactions and emotional

expressions of stage plays, achieving a global optimal solution search. The
mathematical formulation presented in this paper provides a theoretical foundation for
the algorithm, offering an innovative approach to stage art optimization and broader
collaborative optimization problems.

References
1. Hu, H., Xia, X., Luo, Y., Zhang, C., Nazir, M. S., & Peng, T. (2022). Development and
application of an evolutionary deep learning framework of LSTM based on improved
grasshopper optimization algorithm for short-term load forecasting. Journal of Building
Engineering, 57, 104975.
2. Priyadarshi, N., Bhaskar, M. S., & Almakhles, D. (2023). A novel hybrid whale
optimization algorithm differential evolution algorithm-based maximum power point
tracking employed wind energy conversion systems for water pumping applications:
Practical realization. IEEE Transactions on Industrial Electronics, 71(2), 1641-1652.
3. Pouchet, L. N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P.,
& Vasilache, N. (2011). Loop transformations: convexity, pruning and optimization. ACM
SIGPLAN Notices, 46(1), 549-562.
4. Hou, S., Han, X., Sun, G., Long, S., Li, W., Yang, X., & Li, Q. (2011). Multiobjective
optimization for tapered circular tubes. Thin-Walled Structures, 49(7), 855-863.
5. Chaos, M., Khan, M. M., Krishnamoorthy, N., De Ris, J. L., & Dorofeev, S. B. (2011).
Evaluation of optimization schemes and determination of solid fuel properties for CFD fire
models using bench-scale pyrolysis tests. Proceedings of the Combustion Institute, 33(2),
2599-2606.
6. Fuchs, B. (2012). Synthesis of sparse arrays with focused or shaped beampattern via
sequential convex optimizations. IEEE Transactions on Antennas and Propagation, 60(7),
3499-3503.
7. Zheng, G., Chatzinotas, S., & Ottersten, B. (2012). Generic optimization of linear
precoding in multibeam satellite systems. IEEE Transactions on Wireless
Communications, 11(6), 2308-2320.
8. Akinola, O. A., Ezugwu, A. E., Oyelade, O. N., & Agushaka, J. O. (2022). A hybrid binary
dwarf mongoose optimization algorithm with simulated annealing for feature selection on
high dimensional multi-class datasets. Scientific Reports, 12(1), 14945.
9. Vijay, M. M., Sunil, J., Vincy, V. A. G., IjazKhan, M., Abdullaev, S. S., Eldin, S. M., ... &
Askar, S. (2023). Underwater wireless sensor network-based multihop data transmission
using hybrid cat cheetah optimization algorithm. Scientific Reports, 13(1), 10810.
10. Połap, D., & Woźniak, M. (2021). Red fox optimization algorithm. Expert Systems with
Applications, 166, 114107.
11. Pandya, S. B., Kalita, K., Čep, R., Jangir, P., Chohan, J. S., & Abualigah, L. (2024). Multi-
objective snow ablation optimization algorithm: An elementary vision for security-
constrained optimal power flow problem incorporating wind energy source with FACTS
devices. International Journal of Computational Intelligence Systems, 17(1), 33.
12. Thirumoorthy, K. (2022). A feature selection model for software defect prediction using
binary Rao optimization algorithm. Applied Soft Computing, 131, 109737.
13. Zhang, W., Gu, X., Tang, L., Yin, Y., Liu, D., & Zhang, Y. (2022). Application of
machine learning, deep learning and optimization algorithms in geoengineering and
geoscience: Comprehensive review and future challenge. Gondwana Research, 109, 1-17.
8 F. Author and S. Author

14. Dubey, A. K. (2021). Optimized hybrid learning for multi disease prediction enabled by
lion with butterfly optimization algorithm. Sādhanā, 46(2), 63.
15. Al-Rahlawee, A. T. H., & Rahebi, J. (2021). Multilevel thresholding of images with
improved Otsu thresholding by black widow optimization algorithm. Multimedia Tools
and Applications, 80(18), 28217-28243.
16. Zhang, J. Physical Education Teacher Inspired Optimization.
[Link]
17. Hassan, I. H., Abdullahi, M., Aliyu, M. M., Yusuf, S. A., & Abdulrahim, A. (2022). An
improved binary manta ray foraging optimization algorithm based feature selection and
random forest classifier for network intrusion detection. Intelligent Systems with
Applications, 16, 200114.
18. Ye, X., Liu, W., Li, H., Wang, M., Chi, C., Liang, G., ... & Huang, H. (2021). Modified
whale optimization algorithm for solar cell and PV module parameter identification.
Complexity, 2021(1), 8878686.
19. Zhang, J. Spotted Deer Optimization Algorithm.
[Link]
20. Araoye, T. O., Ashigwuike, E. C., Mbunwe, M. J., Bakinson, O. I., & Ozue, T. I. (2024).
Techno-economic modeling and optimal sizing of autonomous hybrid microgrid renewable
energy system for rural electrification sustainability using HOMER and grasshopper
optimization algorithm. Renewable Energy, 229, 120712.
21. Abd-El-Wahed, W. F., Mousa, A. A., & El-Shorbagy, M. A. (2011). Integrating particle
swarm optimization with genetic algorithms for solving nonlinear optimization problems.
Journal of Computational and Applied Mathematics, 235(5), 1446-1453.
22. Shi, Y., Liu, H., Gao, L., & Zhang, G. (2011). Cellular particle swarm optimization.
Information Sciences, 181(20), 4460-4493.
23. Pehlivanoglu, Y. V. (2012). A new vibrational genetic algorithm enhanced with a Voronoi
diagram for path planning of autonomous UAV. Aerospace Science and Technology,
16(1), 47-55.
24. Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2012). Teaching – learning-based
optimization: an optimization method for continuous non-linear large scale problems.
Information sciences, 183(1), 1-15.
25. Niknam, T., Golestaneh, F., & Sadeghi, M. S. (2012). $\theta $-multiobjective teaching–
learning-based optimization for dynamic economic emission dispatch. IEEE Systems
Journal, 6(2), 341-352.
26. Liu, Y. H., Huang, S. C., Huang, J. W., & Liang, W. C. (2012). A particle swarm
optimization-based maximum power point tracking algorithm for PV systems operating
under partially shaded conditions. IEEE transactions on energy conversion, 27(4), 1027-
1035.
27. Immorlica, N., Kalai, A. T., Lucier, B., Moitra, A., Postlewaite, A., & Tennenholtz, M.
(2011, June). Dueling algorithms. In Proceedings of the forty-third annual ACM
symposium on Theory of computing (pp. 215-224).
28. Moghaddam, A. A., Seifi, A., & Niknam, T. (2012). Multi-operation management of a
typical micro-grids using Particle Swarm Optimization: A comparative study. Renewable
and Sustainable Energy Reviews, 16(2), 1268-1281.
29. Ayala, H. V. H., & dos Santos Coelho, L. (2012). Tuning of PID controller based on a
multiobjective genetic algorithm applied to a robotic manipulator. Expert Systems with
Applications, 39(10), 8968-8974.
30. Zhang, J. Geography Teacher Heuristic Optimization Algorithm.
[Link]
 Contribution Title (shortened if too long) 9

31. Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., & Rudolph, G. (2011,
July). Exploratory landscape analysis. In Proceedings of the 13th annual conference on
Genetic and evolutionary computation (pp. 829-836).
32. Abedi, S., Ghobaei-Arani, M., Khorami, E., & Mojarad, M. (2022). Dynamic resource
allocation using improved firefly optimization algorithm in cloud environment. Applied
Artificial Intelligence, 36(1), 2055394.
33. Hou, G., Wang, J., & Fan, Y. (2024). Multistep short-term wind power forecasting model
based on secondary decomposition, the kernel principal component analysis, an enhanced
arithmetic optimization algorithm, and error correction. Energy, 286, 129640.
34. Sack, S. H., & Serbyn, M. (2021). Quantum annealing initialization of the quantum
approximate optimization algorithm. quantum, 5, 491.
35. Zheng, C., Sun, K., Gu, Y., Shen, J., & Du, M. (2022). Multimodal transport path selection
of cold chain logistics based on improved particle swarm optimization algorithm. Journal
of advanced transportation, 2022(1), 5458760.
36. Kllapi, H., Sitaridi, E., Tsangaris, M. M., & Ioannidis, Y. (2011, June). Schedule
optimization for data processing flows on the cloud. In Proceedings of the 2011 ACM
SIGMOD International Conference on Management of data (pp. 289-300).
37. Aydin, I., Karakose, M., & Akin, E. (2011). A multi-objective artificial immune algorithm
for parameter optimization in support vector machine. Applied soft computing, 11(1), 120-
129.
38. Zhang, J. Physics Teacher Inspired Optimization.
[Link]
39. Akbari, R., Hedayatzadeh, R., Ziarati, K., & Hassanizadeh, B. (2012). A multi-objective
artificial bee colony algorithm. Swarm and Evolutionary Computation, 2, 39-52.
40. Yildiz, A. R., & Solanki, K. N. (2012). Multi-objective optimization of vehicle
crashworthiness using a new particle swarm based approach. The International Journal of
Advanced Manufacturing Technology, 59(1), 367-376.
41. Tsianos, K. I., & Rabbat, M. G. (2012, October). Distributed strongly convex optimization.
In 2012 50th Annual Allerton Conference on Communication, Control, and Computing
(Allerton) (pp. 593-600). IEEE.

View publication stats