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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amiri A (2006) Designing a distribution network in a supply chain system: formulation and efficient solution procedure. Eur J Oper Res 171:567–576
Bazaraa M, Jarvis J, Sherali H (2005) Linear programming and network flows, 3rd edn. Wiley-Interscience, Hoboken
Calvete H, Galé C, Iranzo J (2014) Planning of a decentralized distribution network using bilevel optimization. Omega Int J Manag Sci 49:30–41
Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spect 28:337–354
Jayaraman V, Pirkul H (2001) Planning and coordination of production and distribution facilities for multiple commodities. Eur J Oper Res 133(2):394–408
Marín A (2007) Lower bounds for the two-stage uncapacitated facility location problems. Eur J Oper Res 179:1126–1142
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–678
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–878
Raj K, Rajendran C (2012) A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput Oper Res 39(9):2016–2032
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
Author information
Authors and Affiliations
Corresponding author
Additional information
This research work has been funded by the Gobierno de Aragón under grant E58 (FSE) and by UZ-Santander under grant UZ2012-CIE-07.
Rights and permissions
About this article
Cite this article
Calvete, H.I., Galé, C. & Iranzo, J.A. An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots. OR Spectrum 38, 189–206 (2016). https://doi.org/10.1007/s00291-015-0416-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-015-0416-9