An improved quadratic approximation-based Jaya algorithm for two-echelon fixed-cost transportation problem under uncertain environment.

The objective of a fixed-cost transportation problem (FCTP) is to minimize the total transportation cost (or to maximize the total profit). FCTPs become more complex due to the presence of uncertain factors like suppliers' capacity, customers' demand, fixed cost and amount of goods transported. In order to deal with its complexity, three mathematical models, namely the expected value, chance-constrained and measure chance models, are basically available in the literature. This paper aims to solve the crisp equivalent models of an uncertain two-echelon FCTP by employing a robust hybrid evolutionary algorithm. The framework of the designed algorithm comprises of parameter-free Jaya algorithm and the efficient quadratic approximation operator. Initially, its efficiency is validated on the 24 constrained benchmark functions from CEC 2006 (Liang et al. in Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, 2006) and 30 unconstrained benchmark functions (Rao in Int J Ind Eng Comput 7:19–34, 2016). Friedman rank test and Iman–Davenport test are conducted for both constrained and unconstrained test instances. Additionally, five real-life engineering design problems are solved to further analyze the flexibility of the proposed algorithm. The computational results and convergence graphs justify the robustness of the designed algorithm over state-of-the-art algorithms. Finally, its application is demonstrated on chance-constrained and measure chance two-echelon FCTP models. Near-optimal results are contradicted by genetic algorithm and particle swarm optimization in solving both these models. Further, a few large-scale instances of FCTP are solved by the proposed algorithm. [ABSTRACT FROM AUTHOR]