
Fig. 2: Schematics of the convective/ultrasound testbed for batch-
process drying which can be used for both pure hot air (HA)
and combined hot air and ultrasound (HA/US) processes. The
HA mechanism consists of a blower and a heater, whereas the
US mechanism is a vibrating sheet attached to the ultrasound
transducer. One can switch from HA/US process to pure HA process
by turning off the US transducer
shown in Fig.2, which is used for the batch drying process,
each technology can be used more than once. It includes an
ultrasonic module [5], a drying chamber with a rectangular
cross-section, a blower, and a heater. The food sample
is located on a vibrating sheet attached to the ultrasonic
transducer and exposed to the hot air coming from the heater,
allowing combined hot-air and ultrasound drying. In this
setup, the problem of interest is to reduce energy consump-
tion, if possible, by dividing the process into consecutive pure
hot-air (HA) and combined hot-air and ultrasound (HA/US)
sub-processes, each with different operating conditions.
Previous research in the field of drying has largely focused
on improving the efficiency of existing drying methods or
developing new technologies [9], [5], [7]. Some studies
have used optimization routines such as the response surface
method (RSM), a statistical procedure, to optimize process
control variables using experimental data [10], [11]. How-
ever, there is limited literature that addresses optimization
problems related to integrating different drying technologies
through sequencing and parameter optimization. The primary
contribution of our work is the modular use of multiple
existing technologies to achieve cost efficiency with desired
performance levels, while also allowing for optimal operating
conditions that can vary over time, potentially improving
performance even further. In our simulation results, presented
in Section IV, we show up to a 12% reduction in energy
consumption compared to the most efficient single-stage
hot-air/ultrasound drying process, as well as up to a 63%
improvement in energy efficiency compared to the commonly
used optimal hot air drying method. Similar optimization
problems can arise in various industrial processes that involve
using a sequence of distinct devices with similar functions
to form a unified process, such as the wood pulp industry
with drying drums varying in radius and temperature, route
optimization in multi-channel wireless networks with hetero-
geneous routers, and sensor network placement.
This paper introduces a framework based on the Maximum
Entropy Principle (MEP) to model and optimize the various
sub-processes in an industrial drying unit. These optimization
problems pose significant challenges due to the combinato-
rially large number of valid sequences of sub-processes and
their discrete nature. To address these issues, we assign a
probability distribution to the space of all possible configura-
tions. However, determining the optimal operating conditions
of sub-processes alone is analogous to the NP-hard resource
allocation problem, with a non-convex cost surface contain-
ing multiple poor local minima. Traditional algorithms like
k-means often get trapped in these local minima and are
sensitive to initialization. To overcome this, our algorithm
uses a homotopy approach from an auxiliary function to the
original non-convex cost function. This auxiliary function is
a weighted linear combination of the original non-convex
cost function and an appropriate convex function, chosen as
the negative Shannon entropy of the probability distribution
defined above. We start with weights that favor the negative
Shannon entropy term, making the function convex and
easily solvable. As the iteration progresses, the weight of
the original non-convex cost increases, and the obtained
local minima are used to initialize subsequent iterations.
The auxiliary function converges to the original non-convex
cost function at the end of the procedure. This approach is
independent of initialization and tracks the global minimum
by gradually transforming the convex cost function to the
desired non-convex cost function.
II. PROBLEM FORMULATION
We formulate the problem stated above as a parameterized
path-based optimization problem [12]. Such problems are
described by a tuple
M=hM,γ1,...,γM,η1,...,ηM,Di,(1)
where Mis the number of stages allowed, and γkdenotes the
sub-process chosen to be used in the k−th stage. In particular,
γk∈Γk:={fk1,..., fkLk} ∀1≤k≤M,(2)
where Γkis the set of all sub-processes permissible in the
k−th stage. Moreover,
ηk∈H(γk)⊆Rdγk∀1≤k≤M,(3)
where ηkand H(γk)denote the control parameters associated
with the k−th sub-process and its feasible set, respectively.
D(ω,η1,...,ηM)denotes the cost incurred along a path ω,
where ω∈Ω:={(f1i1,f2i2,..., fMiM):fkik∈Γk}represents
a sequence of sub-processes starting from the first stage to
the terminal stage M. The objective of the underlying param-
eterized path-based optimization problem is to determine (a)
the optimal path ω∗∈Ω, and (b) the parameters η∗
kfor all
1≤k≤Mthat solves the following optimization problem
min
{ηk},ν(ω)∑
ω∈Ω
ν(ω)D(ω,η1,...,ηM),
subject to ∑
ω∈Ω
ν(ω) = 1,ν(ω)∈ {0,1}
ηk∈H(γk)∀1≤k≤M,
(4)