Solving Fuzzy Step Fixed Charge Transportation Problems via Metaheuristics

A B S T R A C T A R T I C L E I N F O In the present paper the step fixed charge transpor tation problem under uncertainty, particularly when variable and fixed c ost are given in fuzzy forms, is formulated. In order to solve the p roblem, two metaheuristic, simulated annealing algorithm (SA) a nd variable neighbourhood search (VNS), are developed for this NP-hard problem. Due to the significant role of parameters and operators on the algorithm’s quality, an extensive calibration in bo th SA and VNS is carried out with the aid of a set of experimental d esign. Through extensive computational experiments, appropriate pa rameter values of the proposed algorithms were chosen. For this purpo se, twenty eight problems with different configuration have been gen erated at random and then the effectiveness of the proposed algorith ms was evaluated using the relative percentage deviation (RPD) metho d. Article history : Received :

[1]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[2]  Fanrong Xie,et al.  Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm , 2012, Comput. Ind. Eng..

[3]  Masoud Yaghini,et al.  A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design , 2012, Appl. Soft Comput..

[4]  Mahmoud M. El-Sherbiny.  Alternate mutation based artificial immune algorithm for step fixed charge transportation problem , 2012 .

[5]  Jesús Sáez Aguado,et al.  Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems , 2008 .

[6]  Mahmoud M. El-Sherbiny,et al.  Near Optimal Solution for the Step Fixed Charge Transportation Problem , 2013 .

[7]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[8]  Madan M. Gupta,et al.  Fuzzy mathematical models in engineering and management science , 1988 .

[9]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[10]  Lixing Yang,et al.  Fuzzy fixed charge solid transportation problem and algorithm , 2007, Appl. Soft Comput..

[11]  Benjamin Lev,et al.  More-for-less algorithm for fixed-charge transportation problems , 2007 .

[12]  Reza Tavakkoli-Moghaddam,et al.  Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm , 2010, Comput. Ind. Eng..

[13]  Veena Adlakha,et al.  A SIMPLE HEURISTIC FOR SOLVING SMALL FIXED-CHARGE TRANSPORTATION PROBLEMS , 2003 .

[14]  Anupam Ojha,et al.  A solid transportation problem for an item with fixed charge, vechicle cost and price discounted varying charge using genetic algorithm , 2010, Appl. Soft Comput..

[15]  Reza Tavakkoli-Moghaddam,et al.  Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation , 2011, Expert Syst. Appl..

[16]  Jesús Sáez Aguado.  Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems , 2009, Ann. Oper. Res..

[17]  Didier Dubois,et al.  Ranking fuzzy numbers in the setting of possibility theory , 1983, Inf. Sci..

[18]  Mao-Jiun J. Wang,et al.  Ranking fuzzy numbers with integral value , 1992 .

[19]  W. M. Hirsch,et al.  The fixed charge problem , 1968 .

[20]  Chandrasekharan Rajendran,et al.  A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem , 2012, Comput. Oper. Res..

[21]  E. Lee,et al.  Comparison of fuzzy numbers based on the probability measure of fuzzy events , 1988 .

[22]  N. Jawahar,et al.  A genetic algorithm based heuristic to the multi-period fixed charge distribution problem , 2012, Appl. Soft Comput..

[23]  Reza Tavakkoli-Moghaddam,et al.  A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems , 2013, Appl. Soft Comput..

[24]  Panos M. Pardalos,et al.  Cross-facility management of production and transportation planning problem , 2006, Comput. Oper. Res..

[25]  K. Spielberg.  On the fixed charge transportation problem , 1964, ACM National Conference.

[26]  Mitsuo Gen,et al.  Spanning tree-based genetic algorithm for the bicriteria fixed charge transportation problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[27]  Ronald R. Yager,et al.  A procedure for ordering fuzzy subsets of the unit interval , 1981, Inf. Sci..

[28]  N. Jawahar,et al.  A Simulated Annealing Algorithm for a two-stage fixed charge distribution problem of a Supply Chain , 2010 .

[29]  Shan-Huo Chen.  Ranking fuzzy numbers with maximizing set and minimizing set , 1985 .

[30]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

[31]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[32]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .