“…The structure of the modified camel algorithm MCTA that mimics camels travelling behavior is easy because there are less setting parameters than in the old one. In order to implement the MCTA, it is suggested that N camels (the Camel Caravan) move through a (D)-dimensional environment of camels, and it is shown that the flow is (π₯ π,ππ‘π ) which represents the location of the camel (i) at time iteration (itr) [28,29].…”