Skip to main content
Erschienen in: Neural Computing and Applications 1/2019

03.05.2017 | Original Article

New approaches in metaheuristics to solve the fixed charge transportation problem in a fuzzy environment

verfasst von: Samira Sadeghi-Moghaddam, Mostafa Hajiaghaei-Keshteli, Mehdi Mahmoodjanloo

Erschienen in: Neural Computing and Applications | Sonderheft 1/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Fixed charge transportation problem (FCTP) is a primary and important problem which attracts researchers in the last decade. Recently, solution approaches typically metaheuristics are in focus. Therefore, metaheuristics have been developed to solve such a nondeterministic polynomial-time hard (NP-hard) problem. Since the real world is a complicated system and we could not formulate it as an exact problem, therefore it is necessary to describe an approximate and a fuzzy model. In this paper, both fixed costs and variable costs are considered as the fuzzy numbers. Three well-known algorithms that included a single point-based and two population-based metaheuristics are developed. Besides, a new population-based algorithm that has not been used in the previous works is developed: whale optimization algorithm (WOA). Contrary to previous works, this paper proposes new approaches in solution algorithms using both spanning tree-based Prüfer number and priority-based representation. Also, Taguchi method is used to guarantee the proper performance of algorithms and calibration of parameters. In addition, several problems with different sizes are generated to assess the capability of the algorithms and commercial software according to the real-world case.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Clover F, Klingman D, Phillips NV (1992) Network models in optimization and their applications in practice. Wiley, New York Clover F, Klingman D, Phillips NV (1992) Network models in optimization and their applications in practice. Wiley, New York
3.
4.
Zurück zum Zitat Adlakha V, Kowalski K (2003) A simple heuristic for solving small fixed-charge transportation problems. Omega Int J Manag Sci 31:205–211CrossRef Adlakha V, Kowalski K (2003) A simple heuristic for solving small fixed-charge transportation problems. Omega Int J Manag Sci 31:205–211CrossRef
5.
Zurück zum Zitat Jawahar N, Balaji N (2011) A genetic algorithm based heuristic to the multi-period fixed charge distribution problem. Appl Soft Comput 12:682–699CrossRef Jawahar N, Balaji N (2011) A genetic algorithm based heuristic to the multi-period fixed charge distribution problem. Appl Soft Comput 12:682–699CrossRef
6.
Zurück zum Zitat Juman ZAMS, Hoque MA (2015) An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Appl Soft Comput 34:813–826 Juman ZAMS, Hoque MA (2015) An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Appl Soft Comput 34:813–826
7.
Zurück zum Zitat Holmberg K, Joborn M, Melin K (2008) Lagrangian based heuristics for the multi-commodity network flow problem with fixed costs on paths. Eur J Oper Res 188(1):101–108 Holmberg K, Joborn M, Melin K (2008) Lagrangian based heuristics for the multi-commodity network flow problem with fixed costs on paths. Eur J Oper Res 188(1):101–108
8.
Zurück zum Zitat Gottlieb J, Paulmann L (1998) Genetic algorithms for the fixed charge transportation problem. In Proceedings of IEEE international conference on evolutionary computation. Anchorage pp 330–335 Gottlieb J, Paulmann L (1998) Genetic algorithms for the fixed charge transportation problem. In Proceedings of IEEE international conference on evolutionary computation. Anchorage pp 330–335
9.
Zurück zum Zitat Sun M, Aronson JE, Mckeown PG, Drinka D (1998) A tabu search heuristic procedure for the fixe charge transportation problem. Eur J Oper Res 106:441–456CrossRefMATH Sun M, Aronson JE, Mckeown PG, Drinka D (1998) A tabu search heuristic procedure for the fixe charge transportation problem. Eur J Oper Res 106:441–456CrossRefMATH
10.
Zurück zum Zitat Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, NY Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, NY
11.
Zurück zum Zitat Prüfer H (1918) Neuer bewis eines saizes uber permutationen. Arch Math Phys 27:742–744 Prüfer H (1918) Neuer bewis eines saizes uber permutationen. Arch Math Phys 27:742–744
12.
Zurück zum Zitat Dossey J, Otto A, Spence L, Eynden C (1993) Discrete mathematics. Harper Collins, New York Dossey J, Otto A, Spence L, Eynden C (1993) Discrete mathematics. Harper Collins, New York
13.
Zurück zum Zitat Zhou G, Gen M (1997) A note on genetic algorithm for degree-constrained spanning tree problem. Networks 30:91–95CrossRefMATH Zhou G, Gen M (1997) A note on genetic algorithm for degree-constrained spanning tree problem. Networks 30:91–95CrossRefMATH
14.
Zurück zum Zitat Syarif A, Gen M (2003b) Double spanning tree-based genetic algorithm for two stage transportation problem. International Journal of Knowledge-based Engineering Systems 7:214–221 Syarif A, Gen M (2003b) Double spanning tree-based genetic algorithm for two stage transportation problem. International Journal of Knowledge-based Engineering Systems 7:214–221
15.
Zurück zum Zitat Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, NY Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, NY
16.
Zurück zum Zitat Syarif A, Gen M (2003c) Hybrid genetic algorithm for production/distribution system in supply chain. International Journal of Smart Engineering System Design 5:289–298CrossRefMATH Syarif A, Gen M (2003c) Hybrid genetic algorithm for production/distribution system in supply chain. International Journal of Smart Engineering System Design 5:289–298CrossRefMATH
17.
Zurück zum Zitat Gen M, Syarif A (2005) Hybrid genetic algorithm for multi-time period production/distribution planning. Comput Ind Eng 48:799–809CrossRef Gen M, Syarif A (2005) Hybrid genetic algorithm for multi-time period production/distribution planning. Comput Ind Eng 48:799–809CrossRef
18.
Zurück zum Zitat Syarif A, Yun YS, Gen M (2002) Study on multi-stage logistics chain network: a spanning tree based genetic algorithm. Comput Ind Eng 43:299–314CrossRef Syarif A, Yun YS, Gen M (2002) Study on multi-stage logistics chain network: a spanning tree based genetic algorithm. Comput Ind Eng 43:299–314CrossRef
19.
Zurück zum Zitat Jo JB, Li Y, Gen M (2007) Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput Ind Eng 53:290–298CrossRef Jo JB, Li Y, Gen M (2007) Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput Ind Eng 53:290–298CrossRef
20.
Zurück zum Zitat Syarif A, Gen M (2003a) Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm. International Journal of Intelligent Manufacturing 14:389–399CrossRef Syarif A, Gen M (2003a) Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm. International Journal of Intelligent Manufacturing 14:389–399CrossRef
21.
Zurück zum Zitat Zhou G, Gen M (1999) Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur J Oper Res 114:141–152CrossRefMATH Zhou G, Gen M (1999) Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur J Oper Res 114:141–152CrossRefMATH
22.
Zurück zum Zitat Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. Journal of Operational Research 28:337–354MathSciNetMATH Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. Journal of Operational Research 28:337–354MathSciNetMATH
23.
Zurück zum Zitat Lotfi MM, Tavakkoli-Moghaddam R (2013) A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Appl Soft Comput 13:2711–2726CrossRef Lotfi MM, Tavakkoli-Moghaddam R (2013) A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Appl Soft Comput 13:2711–2726CrossRef
24.
Zurück zum Zitat Hajiaghaei-Keshteli M, Molla-Alizadeh-Zavardehi S, Tavakkoli-Moghaddam R (2010) Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Comput Ind Eng 59(2010):259–271CrossRef Hajiaghaei-Keshteli M, Molla-Alizadeh-Zavardehi S, Tavakkoli-Moghaddam R (2010) Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Comput Ind Eng 59(2010):259–271CrossRef
25.
Zurück zum Zitat El-Sherbiny MM, Alhamali RM (2012) A hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem. Comput Ind Eng 64(2013):610–620 El-Sherbiny MM, Alhamali RM (2012) A hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem. Comput Ind Eng 64(2013):610–620
26.
Zurück zum Zitat Xie F, Jia R (2012) Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm. Comput Ind Eng 63:763–778CrossRef Xie F, Jia R (2012) Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm. Comput Ind Eng 63:763–778CrossRef
27.
Zurück zum Zitat Altassan KM, El-Sherbiny MM, Abid AD (2014) Artificial immune algorithm for solving fixed charge transportation problem. Applied Mathematics and Information Sciences 2:751–759CrossRef Altassan KM, El-Sherbiny MM, Abid AD (2014) Artificial immune algorithm for solving fixed charge transportation problem. Applied Mathematics and Information Sciences 2:751–759CrossRef
28.
Zurück zum Zitat Jawahara N, Balajib AN (2009) A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur J Oper Res 194:496–537CrossRef Jawahara N, Balajib AN (2009) A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur J Oper Res 194:496–537CrossRef
29.
Zurück zum Zitat Hajiaghaei-Keshteli M, Aminnayeri M (2014) Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm. Appl Soft Comput 25:184–203CrossRef Hajiaghaei-Keshteli M, Aminnayeri M (2014) Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm. Appl Soft Comput 25:184–203CrossRef
30.
Zurück zum Zitat Hajiaghaei-Keshteli M, Aminnayeri M, Fatemi Ghomi SMT (2014) Integrated scheduling of production and rail transportation. Comput Ind Eng 74:240–256CrossRef Hajiaghaei-Keshteli M, Aminnayeri M, Fatemi Ghomi SMT (2014) Integrated scheduling of production and rail transportation. Comput Ind Eng 74:240–256CrossRef
31.
Zurück zum Zitat Molla-Alizadeh-Zavardehi S, Sadi Nezhad S, Tavakkoli-Moghaddam R, Yazdani M (2013) Solving a fuzzy fixed charge solid transportation problem by metaheuristics. Math Comput Model 57:1543–1558MathSciNetCrossRef Molla-Alizadeh-Zavardehi S, Sadi Nezhad S, Tavakkoli-Moghaddam R, Yazdani M (2013) Solving a fuzzy fixed charge solid transportation problem by metaheuristics. Math Comput Model 57:1543–1558MathSciNetCrossRef
32.
Zurück zum Zitat Pramanik S, Janab DK, Mondala SK, Maiti M (2015) A fixed-charge transportation problem in two-stage supply chain network in Gaussian type-2 fuzzy environments. Inf Sci 325:190–214MathSciNetCrossRef Pramanik S, Janab DK, Mondala SK, Maiti M (2015) A fixed-charge transportation problem in two-stage supply chain network in Gaussian type-2 fuzzy environments. Inf Sci 325:190–214MathSciNetCrossRef
33.
Zurück zum Zitat Ebrahimnejad A (2016) New method for solving fuzzy transportation problems with LR flat fuzzy numbers. Inf Sci 357:108–124CrossRef Ebrahimnejad A (2016) New method for solving fuzzy transportation problems with LR flat fuzzy numbers. Inf Sci 357:108–124CrossRef
35.
Zurück zum Zitat Gao SP, Liu SY (2004) Two-phase fuzzy algorithms for multi-objective transportation problem. The Journal of Fuzzy Mathematics 12:147–155MATH Gao SP, Liu SY (2004) Two-phase fuzzy algorithms for multi-objective transportation problem. The Journal of Fuzzy Mathematics 12:147–155MATH
36.
Zurück zum Zitat Samanta B, Roy TK (2005) Multi-objective entropy transportation model with trapezoidal fuzzy number penalties, sources and destination. J Transp Eng 131:419–428CrossRef Samanta B, Roy TK (2005) Multi-objective entropy transportation model with trapezoidal fuzzy number penalties, sources and destination. J Transp Eng 131:419–428CrossRef
37.
Zurück zum Zitat Omar MS, Samir AA (2003) A parametric study on transportation problem under fuzzy environment. The Journal of Fuzzy Mathematics 11:115–124MathSciNetMATH Omar MS, Samir AA (2003) A parametric study on transportation problem under fuzzy environment. The Journal of Fuzzy Mathematics 11:115–124MathSciNetMATH
38.
Zurück zum Zitat Chanas S, Kuchta D (1996) A concept of the optimal solution of the transportation problem with fuzzy cost coefficients. Fuzzy Sets and System 82:299–305MathSciNetCrossRef Chanas S, Kuchta D (1996) A concept of the optimal solution of the transportation problem with fuzzy cost coefficients. Fuzzy Sets and System 82:299–305MathSciNetCrossRef
39.
Zurück zum Zitat Ojha D, Mondal SK, Maiti M (2009) An entropy based solid transportation problem for general fuzzy costs and time with fuzzy equality. Math Comput Model 50:166–178MathSciNetCrossRefMATH Ojha D, Mondal SK, Maiti M (2009) An entropy based solid transportation problem for general fuzzy costs and time with fuzzy equality. Math Comput Model 50:166–178MathSciNetCrossRefMATH
41.
Zurück zum Zitat Fuzzy logic: an introductory course for engineering students (studies in fuzziness and soft computing) 2015th Edition by Enric Trillas and Luka Eciolaza Fuzzy logic: an introductory course for engineering students (studies in fuzziness and soft computing) 2015th Edition by Enric Trillas and Luka Eciolaza
42.
Zurück zum Zitat Enric Trillas, Luka Eciolaza (2015) Fuzzy Logic. An introductory course for engineering students, 320. Springer. Enric Trillas, Luka Eciolaza (2015) Fuzzy Logic. An introductory course for engineering students, 320. Springer.
44.
Zurück zum Zitat Kennedy, J and Eberhart, R. (1995). Particle swarm optimization. Proc of IEEE International Conference on Neural Network, Perth, Australia, IEEE Service Center Piscataway, NJ, 1942–1948. Kennedy, J and Eberhart, R. (1995). Particle swarm optimization. Proc of IEEE International Conference on Neural Network, Perth, Australia, IEEE Service Center Piscataway, NJ, 1942–1948.
45.
Zurück zum Zitat Su YX, Chi R (2015) Multi-objective particle swarm-differential evolution algorithm. Neural Comput Applic: 1–12 Su YX, Chi R (2015) Multi-objective particle swarm-differential evolution algorithm. Neural Comput Applic: 1–12
46.
Zurück zum Zitat Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
47.
Zurück zum Zitat Aličković E, Subasi A (2015) Breast cancer diagnosis using GA feature selection and rotation forest. Neural Comput Applic: 1–11 Aličković E, Subasi A (2015) Breast cancer diagnosis using GA feature selection and rotation forest. Neural Comput Applic: 1–11
48.
Zurück zum Zitat Mirjalili SA, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67CrossRef Mirjalili SA, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67CrossRef
49.
Zurück zum Zitat Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization/UNIPUB, White Plains Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization/UNIPUB, White Plains
50.
Zurück zum Zitat Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, NJ Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, NJ
51.
Zurück zum Zitat Naderi B, Zandieh M, Ghoshe Balagh AK, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36:9625–9633CrossRef Naderi B, Zandieh M, Ghoshe Balagh AK, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36:9625–9633CrossRef
52.
Zurück zum Zitat Naderi B, Khalili M, Tavakkoli-Moghaddam R (2009) A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Comput Ind Eng 56:1494–1501CrossRef Naderi B, Khalili M, Tavakkoli-Moghaddam R (2009) A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Comput Ind Eng 56:1494–1501CrossRef
53.
Zurück zum Zitat Sun M, Aronson JE, Patrick PG, Drinka D (1998) A tabu search heuristic procedure for the fixed charge transportation problem. Eur J Oper Res 106:441456CrossRefMATH Sun M, Aronson JE, Patrick PG, Drinka D (1998) A tabu search heuristic procedure for the fixed charge transportation problem. Eur J Oper Res 106:441456CrossRefMATH
Metadaten
Titel
New approaches in metaheuristics to solve the fixed charge transportation problem in a fuzzy environment
verfasst von
Samira Sadeghi-Moghaddam
Mostafa Hajiaghaei-Keshteli
Mehdi Mahmoodjanloo
Publikationsdatum
03.05.2017
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe Sonderheft 1/2019
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-017-3027-3

Weitere Artikel der Sonderheft 1/2019

Neural Computing and Applications 1/2019 Zur Ausgabe

Machine Learning Applications for Self-Organized Wireless Networks

Jointly network: a network based on CNN and RBM for gesture recognition

S.I. : Machine Learning Applications for Self-Organized Wireless Networks

An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm