1. Home
  2. Issues
  3. Volume 31, Issue 4 (2020)
  4. A Parallel Algorithm for Solving a Two-S ...

Informatica


A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem
Volume 31, Issue 4 (2020), pp. 681–706
Pub. online: 15 October 2020      Type: Research Article      Open accessOpen Access
Received
1 September 2019
Accepted
1 September 2020
Published
15 October 2020

Abstract

This paper deals with the two-stage transportation problem with fixed charges, denoted by TSTPFC. We propose a fast solving method, designed for parallel environments, that allows solving real-world applications efficiently. The proposed constructive heuristic algorithm is iterative and its primary feature is that the solution search domain is reduced at each iteration. Our achieved computational results were compared with those of the existing solution approaches. We tested the method on two sets of instances available in literature. The outputs prove that we have identified a very competitive approach as compared to the methods than one can find in literature.

References

 
Buson, E., Roberti, R., Toth, P. (2014). A reduced-cost iterated local search heuristic for the fixed-charge transportation problem. Operations Research, 62(5), 1095–1106.
 
Calvete, H., Gale, C., Iranzo, J. (2016). An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots. OR Spectrum, 38, 189–206.
 
Calvete, H., Gale, C., Iranzo, J., Toth, P. (2018). A matheuristic for the two-stage fixed-charge transportation problem. Computers & Operations Research, 95, 113–122.
 
Cosma, O., Danciulescu, D., Pop, P.C. (2019). On the two-stage transportation problem with fixed charge for opening the distribution centers. IEEE Access, 7, 113684–113698.
 
Cosma, O., Pop, P.C., Danciulescu, D. (2020). A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. Computers & Operations Research, 118, 104906.
 
Cosma, O., Pop, P.C., Matei, O., Zelina, I. (2018). A hybrid iterated local search for solving a particular two-stage fixed-charge transportation problem. In: Hybrid Artificial Intelligent Systems, HAIS 2018, Lecture Notes in Computer Science, Vol. 10870, pp. 684–693.
 
Gen, M., Altiparmak, F., Lin, L. (2006). A genetic algorithm for two-stage transportation problem using priority based encoding. OR Spectrum, 28, 337–354.
 
Guisewite, G., Pardalos, P. (1990). Minimum concave-cost network flow problems: applications, complexity, and algorithms. Annals of Operations Research, 25(1), 75–99.
 
Hundt, R. (2011). Loop Recognition in C++/Java/Go/Scala. In: Proceedings of Scala Days 2011. https://days2011.scala-lang.org/sites/days2011/files/ws3-1-Hundt.pdf.
 
PassMark (2020). CPU Benchmarks. https://www.cpubenchmark.net/compare/Intel-Pentium-D-830-vs-Intel-i5-4590/1127vs2234.
 
Pirkul, H., Jayaraman, V. (1998). A multi-commodity, multi-plant, capacitated facility location problem. Formulation and efficient heuristic solution. Computers & Operations Research, 25(10), 869–878.
 
Pop, P.C., Matei, O., Pop Sitar, C., Zelina, I. (2016). A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpathian Journal of Mathematics, 32(2), 225–232.
 
Pop, P.C., Sabo, C., Biesinger, B., Hu, B., Raidl, G. (2017). Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpathian Journal of Mathematics, 33(3), 365–371.
 
Raj, K.A.A.D., Rajendran, C. (2012). A genetic algorithm for solving the fixed-charge transportation model. Two-stage problem. Computers & Operations Research, 39(9), 2016–2032.
 
Trobec, R., Slivnik, B., Bulic, P., Robic, B. (2018). Introduction to Parallel Computing. From Algorithms to Programming on State-of-the-Art Platforms. Springer, Switzerland.

Biographies

Cosma Ovidiu
ovidiu.cosma@cunbm.utcluj.ro

O. Cosma received the BS degree in automatic control and computer science and the PhD degree in automatic control from Politehnica University, Bucharest, Romania, in 1986 and 2004, respectively. From 1986 to 1992, he was an analyst programmer with the Electronic Computing Center, Baia Mare. In 1992, he began his activity as assistant professor with North University, Baia Mare. He is currently an associate professor with the Technical University of Cluj-Napoca, the North University Center, Baia Mare. His research interests include optimization algorithms, image processing, and programming languages. He has authored six books, more than 50 research articles, and two inventions.

Pop Petrică C.
petrica.pop@cunbm.utcluj.ro

P.C. Pop received the BS degree in mathematics from the Babes-Bolyai University of Cluj-Napoca, Romania, the MS and PhD degrees in operations research from the University of Twente, The Netherlands, and the Habilitation degree in informatics from the Babes-Bolyai University of Cluj-Napoca. He currently serves as a Professor with the Department of Mathematics and Computer Science, Technical University of Cluj-Napoca, the North University Center, Baia Mare. He wrote more than 130 papers from which more than 100 appeared in ISI journals, ISI proceedings, and international journals. His research interests include combinatorial optimization, mathematical modelling, artificial intelligence, and operations research. Several research stays have taken him to Italy, UK, Japan, France, Austria, Greece, The Netherlands, Spain, and Canada.

Dănciulescu Daniela
dana.danciulescu@ucv.ro

D. Dănciulescu received the BS degree in informatics from the University of Craiova in 1994, the BS degree in accounting and management informatics, in 2009, the MS degree in management, in 2011, the PhD degree in cybernetics and economic statistics from the Faculty of Economic Sciences, University of Craiova, in 2003, the second PhD degree in computer science from the West University of Timişoara, in 2015, and the habilitation degree in economic informatics from the A. I. Cuza University of Iaşi, in 2018. She is currently an associate professor with the University of Craiova. She has authored a monograph, eight course books for students and over 80 papers in peer-reviewed journals, out of which 18 ISI papers and papers in ISI or conference proceedings indexed in well-known international databases.


Full article Related articles Cited by PDF XML
Full article Related articles Cited by PDF XML

Copyright
© 2020 Vilnius University
Open access article under the CC BY license.

Keywords
parallel computing heuristic algorithms transportation system design two-stage fixed-charge transportation problem

Metrics
since January 2020
1670

Article info
views

 737

Full article
views
1149

PDF
downloads

 214

XML
downloads


Share


RSS