Skip to main content
Erschienen in: OR Spectrum 1/2016

01.01.2016 | Regular Article

An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots

verfasst von: Herminia I. Calvete, Carmen Galé, José A. Iranzo

Erschienen in: OR Spectrum | Ausgabe 1/2016

Einloggen

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

search-config
loading …

Abstract

This paper addresses a two-stage transportation problem with a fixed charge at depots. The goal is to determine the best way of delivering a commodity from a set of plants to a set of customers with known demand using a set of potential depots as intermediate transshipment points, while minimizing the overall costs incurred. These costs refer to fixed costs arising from using the depots and to variable shipping costs. To solve the problem, a hybrid evolutionary algorithm is developed which combines the control by the chromosomes of which depots to open with the use of optimization techniques to associate a feasible solution to each chromosome. The computational results show the efficiency of the algorithm in terms of the quality of the solutions yielded and the computing time.

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 "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
Zurück zum Zitat Amiri A (2006) Designing a distribution network in a supply chain system: formulation and efficient solution procedure. Eur J Oper Res 171:567–576CrossRef Amiri A (2006) Designing a distribution network in a supply chain system: formulation and efficient solution procedure. Eur J Oper Res 171:567–576CrossRef
Zurück zum Zitat Bazaraa M, Jarvis J, Sherali H (2005) Linear programming and network flows, 3rd edn. Wiley-Interscience, Hoboken Bazaraa M, Jarvis J, Sherali H (2005) Linear programming and network flows, 3rd edn. Wiley-Interscience, Hoboken
Zurück zum Zitat Calvete H, Galé C, Iranzo J (2014) Planning of a decentralized distribution network using bilevel optimization. Omega Int J Manag Sci 49:30–41CrossRef Calvete H, Galé C, Iranzo J (2014) Planning of a decentralized distribution network using bilevel optimization. Omega Int J Manag Sci 49:30–41CrossRef
Zurück zum Zitat Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spect 28:337–354CrossRef Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spect 28:337–354CrossRef
Zurück zum Zitat Jayaraman V, Pirkul H (2001) Planning and coordination of production and distribution facilities for multiple commodities. Eur J Oper Res 133(2):394–408CrossRef Jayaraman V, Pirkul H (2001) Planning and coordination of production and distribution facilities for multiple commodities. Eur J Oper Res 133(2):394–408CrossRef
Zurück zum Zitat Marín A (2007) Lower bounds for the two-stage uncapacitated facility location problems. Eur J Oper Res 179:1126–1142CrossRef Marín A (2007) Lower bounds for the two-stage uncapacitated facility location problems. Eur J Oper Res 179:1126–1142CrossRef
Zurück zum Zitat Marín A, Pelegrín B (1997) A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points. Comput Oper Res 24(7):659–678CrossRef Marín A, Pelegrín B (1997) A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points. Comput Oper Res 24(7):659–678CrossRef
Zurück zum Zitat Pirkul H, Jayaraman V (1998) A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. Comput Oper Res 25(10):869–878CrossRef Pirkul H, Jayaraman V (1998) A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. Comput Oper Res 25(10):869–878CrossRef
Zurück zum Zitat Raj K, Rajendran C (2012) A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput Oper Res 39(9):2016–2032CrossRef Raj K, Rajendran C (2012) A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput Oper Res 39(9):2016–2032CrossRef
Zurück zum Zitat Syarif A, Gen M (2003) Double spanning tree-based genetic algorithm for two stage transportation problem. Int J Knowl Based Intell Eng Sys 7(3):157–354 Syarif A, Gen M (2003) Double spanning tree-based genetic algorithm for two stage transportation problem. Int J Knowl Based Intell Eng Sys 7(3):157–354
Metadaten
Titel
An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
verfasst von
Herminia I. Calvete
Carmen Galé
José A. Iranzo
Publikationsdatum
01.01.2016
Verlag
Springer Berlin Heidelberg
Erschienen in
OR Spectrum / Ausgabe 1/2016
Print ISSN: 0171-6468
Elektronische ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-015-0416-9

Weitere Artikel der Ausgabe 1/2016

OR Spectrum 1/2016 Zur Ausgabe