Skip to main content

2018 | OriginalPaper | Buchkapitel

Fixed Charge Bulk Transportation Problem

verfasst von : Bindu Kaushal, Shalini Arora

Erschienen in: Operations Research and Optimization

Verlag: Springer Singapore

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

search-config
loading …

Abstract

This paper discusses an exact method to solve fixed charge bulk transportation problem (FCBTP). The fixed charge bulk transportation problem is a variant of the classical transportation problem in which a fixed cost is incurred in addition to the bulk transportation cost. This paper comprises of two sections. In Sect. 2, an algorithm based on lexi-search approach is proposed to solve FCBTP which gives the optimal solution in a finite number of iterations. Section 3 reports and corrects the errors which occurred in the paper entitled ‘Solving the fixed charge problem by ranking the extreme point’ by Murty (Oper. Res. 16(2): 268–279, 1968) [24]. Towards the end, some Concluding Remarks are given.

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

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!

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"

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!

Literatur
1.
Zurück zum Zitat Adlakha, V., Kowalski, K.: On the fixed-charge transportation problem. Omega 27(27), 381–388 (1999)CrossRef Adlakha, V., Kowalski, K.: On the fixed-charge transportation problem. Omega 27(27), 381–388 (1999)CrossRef
2.
Zurück zum Zitat Adlakha, V., Kowalski, K.: A simple heuristic for solving small fixed-charge transportation problems. Omega 31(3), 205–211 (2003)CrossRef Adlakha, V., Kowalski, K.: A simple heuristic for solving small fixed-charge transportation problems. Omega 31(3), 205–211 (2003)CrossRef
3.
Zurück zum Zitat Adlakha, V., Kowalski, K., Vemuganti, R.R., Lev, B.: More-for-less algorithm for fixed charge transportation problems. OMEGA Int. J. Manag. Sci. 35(1), 116–127 (2007)CrossRef Adlakha, V., Kowalski, K., Vemuganti, R.R., Lev, B.: More-for-less algorithm for fixed charge transportation problems. OMEGA Int. J. Manag. Sci. 35(1), 116–127 (2007)CrossRef
4.
Zurück zum Zitat Adlakha, V., Kowalski, K., Wang, S., Lev, B., Shen, W.: On approximation of the fixed charge transportation problem. Omega 43, 64–70 (2014)CrossRef Adlakha, V., Kowalski, K., Wang, S., Lev, B., Shen, W.: On approximation of the fixed charge transportation problem. Omega 43, 64–70 (2014)CrossRef
5.
Zurück zum Zitat Aguado, J.: Fixed charge transportation problems: a new heuristic approach based on lagrangean relaxation and the solving of core problems. Ann. Oper. Res. 172, 45–69 (2009)MathSciNetCrossRefMATH Aguado, J.: Fixed charge transportation problems: a new heuristic approach based on lagrangean relaxation and the solving of core problems. Ann. Oper. Res. 172, 45–69 (2009)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Arora, S.R., Ahuja, A.: A Paradox in a fixed charge transportation problem. Indian J. Pure Appl. Math. 31(7), 809–822 (2000) Arora, S.R., Ahuja, A.: A Paradox in a fixed charge transportation problem. Indian J. Pure Appl. Math. 31(7), 809–822 (2000)
7.
Zurück zum Zitat Arora, S., Puri, M.C.: A variant of time minimizing assignment problem. Eur. J. Oper. Res. 110, 314–325 (1998)CrossRefMATH Arora, S., Puri, M.C.: A variant of time minimizing assignment problem. Eur. J. Oper. Res. 110, 314–325 (1998)CrossRefMATH
8.
Zurück zum Zitat Balas, E., Glover, F., Zionts, S.: An additive algorithm for solving linear programs with zero one variables. Oper. Res. INFORMS 13(4), 517–549 (1965)MathSciNetCrossRef Balas, E., Glover, F., Zionts, S.: An additive algorithm for solving linear programs with zero one variables. Oper. Res. INFORMS 13(4), 517–549 (1965)MathSciNetCrossRef
9.
Zurück zum Zitat Balinski, M.L.: Fixed-cost transportation problems. Nav. Res. Logist. Q. 8(01), 41–54 (1961)CrossRefMATH Balinski, M.L.: Fixed-cost transportation problems. Nav. Res. Logist. Q. 8(01), 41–54 (1961)CrossRefMATH
10.
Zurück zum Zitat Caramia, M., Guerreio, F.: A heuristic approach to long-haul freight transportation with multiple objective functions. OMEGA Int. J. Manag. Sci. 37, 600–614 (2009)CrossRef Caramia, M., Guerreio, F.: A heuristic approach to long-haul freight transportation with multiple objective functions. OMEGA Int. J. Manag. Sci. 37, 600–614 (2009)CrossRef
11.
Zurück zum Zitat Cooper, L., Drebes, C.: An approximate solution method for the fixed charge problem. Nav. Res. Logist. Q. 14(1) (1967) Cooper, L., Drebes, C.: An approximate solution method for the fixed charge problem. Nav. Res. Logist. Q. 14(1) (1967)
13.
Zurück zum Zitat Cooper, L., Olson, A.M.: Random Perturbations and MI-MII Heuristics for the Fixed Charge Problem Cooper, L., Olson, A.M.: Random Perturbations and MI-MII Heuristics for the Fixed Charge Problem
14.
Zurück zum Zitat De Maio, A., Roveda, C.: An all zero-one algorithm for a certain class of transportation problems. INFORMS 19(6), 1406–1418 (1969)MATH De Maio, A., Roveda, C.: An all zero-one algorithm for a certain class of transportation problems. INFORMS 19(6), 1406–1418 (1969)MATH
15.
Zurück zum Zitat Denzler, D.R.: An approximative algorithm for the fixed charge problem. Nav. Res. Logist. Q. 16(3) (1969) Denzler, D.R.: An approximative algorithm for the fixed charge problem. Nav. Res. Logist. Q. 16(3) (1969)
16.
Zurück zum Zitat Gray, P.: Exact solution of the fixed-charge transportation problem. Oper. Res. 19(6), 1529–1538 (1971)CrossRefMATH Gray, P.: Exact solution of the fixed-charge transportation problem. Oper. Res. 19(6), 1529–1538 (1971)CrossRefMATH
17.
Zurück zum Zitat Hajiaghaei-Keshteli, M., Molla-Alizadeh-Zavardehi, S., Tavakkoli-Moghaddam, R.: Addressing a non linear fixed-charge transportation using a spanning tree based genetic algorithm. Comput. Ind. Eng. 59, 259–271 (2010)CrossRef Hajiaghaei-Keshteli, M., Molla-Alizadeh-Zavardehi, S., Tavakkoli-Moghaddam, R.: Addressing a non linear fixed-charge transportation using a spanning tree based genetic algorithm. Comput. Ind. Eng. 59, 259–271 (2010)CrossRef
18.
Zurück zum Zitat Jo, J., Li, Y., Gen, M.: Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput. Ind. Eng. 53, 290–298 (2007)CrossRef Jo, J., Li, Y., Gen, M.: Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput. Ind. Eng. 53, 290–298 (2007)CrossRef
19.
Zurück zum Zitat Kowalski, K., Lev, B.: On step fixed-charge transportation problem. OMEGA Int. J. Manag. Sci. 36(5), 913–917 (2008)CrossRef Kowalski, K., Lev, B.: On step fixed-charge transportation problem. OMEGA Int. J. Manag. Sci. 36(5), 913–917 (2008)CrossRef
20.
Zurück zum Zitat Kowalski, K., Lev, B., Shen, W., Tu, Y.: A fast and simple branching algorithm for solving small scale fixed-charge transportation problem. Oper. Res. Perspect. 1(1), 1–5 (2014)MathSciNetCrossRef Kowalski, K., Lev, B., Shen, W., Tu, Y.: A fast and simple branching algorithm for solving small scale fixed-charge transportation problem. Oper. Res. Perspect. 1(1), 1–5 (2014)MathSciNetCrossRef
21.
Zurück zum Zitat Liu, S.-T.: The total cost bounds of transportation problem with varying demand and supply. OMEGA Int. J. Manag. Sci. 31(4), 247–251 (2003)CrossRef Liu, S.-T.: The total cost bounds of transportation problem with varying demand and supply. OMEGA Int. J. Manag. Sci. 31(4), 247–251 (2003)CrossRef
22.
Zurück zum Zitat Ma, H., Miao, Z., Lim, A., Rodrigues, B.: Cross docking distribution networks with setup cost and time window constraint. OMEGA Int. J. Manag. Sci. 39(1), 64–72 (2011)CrossRef Ma, H., Miao, Z., Lim, A., Rodrigues, B.: Cross docking distribution networks with setup cost and time window constraint. OMEGA Int. J. Manag. Sci. 39(1), 64–72 (2011)CrossRef
23.
Zurück zum Zitat Murthy, M.S.: A bulk transportation problem. OPSEARCH 13(3–4), 143–155 (1976)MathSciNet Murthy, M.S.: A bulk transportation problem. OPSEARCH 13(3–4), 143–155 (1976)MathSciNet
24.
Zurück zum Zitat Murty, K.G.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2), 268–279 (1968)CrossRefMATH Murty, K.G.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2), 268–279 (1968)CrossRefMATH
25.
Zurück zum Zitat Ortega, F., Wolsey, L.: A branch and cut algorithm for the single-commodity, uncapacitated, fixed charge network flow problem. Networks 41, 143–158 (2003)MathSciNetCrossRefMATH Ortega, F., Wolsey, L.: A branch and cut algorithm for the single-commodity, uncapacitated, fixed charge network flow problem. Networks 41, 143–158 (2003)MathSciNetCrossRefMATH
26.
Zurück zum Zitat Puri, M.C., Swarup, K.: A systematic extreme point enumeration procedure for fixed charge problem. Trab Estad y Investig Oper. 25(1), 99–108 (1974)MathSciNetCrossRefMATH Puri, M.C., Swarup, K.: A systematic extreme point enumeration procedure for fixed charge problem. Trab Estad y Investig Oper. 25(1), 99–108 (1974)MathSciNetCrossRefMATH
27.
28.
Zurück zum Zitat Sadagopan, S., Ravindran, A.: A vertex ranking algorithm for the fixed-charge transportation problem. J. Optim. Theory Appl. 37(2) (1982) Sadagopan, S., Ravindran, A.: A vertex ranking algorithm for the fixed-charge transportation problem. J. Optim. Theory Appl. 37(2) (1982)
29.
Zurück zum Zitat Srinivasan, V., Thompson, G.L.: An algorithm for assigning uses to sources in a special class of transportation problems. INFORMS 21(1), 284–295 (1973)MATH Srinivasan, V., Thompson, G.L.: An algorithm for assigning uses to sources in a special class of transportation problems. INFORMS 21(1), 284–295 (1973)MATH
30.
Zurück zum Zitat Steinberg, D.I.: The fixed charge problem. Nav. Res. Logist. Q. 17(2) (1970) Steinberg, D.I.: The fixed charge problem. Nav. Res. Logist. Q. 17(2) (1970)
31.
Zurück zum Zitat Thirwani, D.: A note on fixed charge Bi-Criterion transportation problem with enhanced flow. Indian J. Pure Appl. Math. 29(5), 565–571 (1998) Thirwani, D.: A note on fixed charge Bi-Criterion transportation problem with enhanced flow. Indian J. Pure Appl. Math. 29(5), 565–571 (1998)
32.
Zurück zum Zitat Walker, W.: A heuristic adjacent extreme point algorithm for fixed charge problem. Manag. Sci. 22, 587–596 (1976)CrossRefMATH Walker, W.: A heuristic adjacent extreme point algorithm for fixed charge problem. Manag. Sci. 22, 587–596 (1976)CrossRefMATH
33.
Zurück zum Zitat Warren, M.H, George, B.D.: The fixed charge problem. RAND Corp. RM-1383, 413–424 (1954) Warren, M.H, George, B.D.: The fixed charge problem. RAND Corp. RM-1383, 413–424 (1954)
34.
Zurück zum Zitat Warren, M.H., Hoffman, A.J.: Extreme varieties, concave functions, and the fixed charge problem. Commun. Pure Appl. Math. XIV, 355–369(1961) Warren, M.H., Hoffman, A.J.: Extreme varieties, concave functions, and the fixed charge problem. Commun. Pure Appl. Math. XIV, 355–369(1961)
Metadaten
Titel
Fixed Charge Bulk Transportation Problem
verfasst von
Bindu Kaushal
Shalini Arora
Copyright-Jahr
2018
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-7814-9_22