Skip to main content
SpringerLink
Log in

Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper the Fixed Charge Transportation Problem is considered. A new heuristic approach is proposed, based on the intensive use of Lagrangean relaxation techniques. The more novel aspects of this approach are new Lagrangean relaxation and decomposition methods, the consideration of several core problems, defined from the previously computed Lagrangean reduced costs, the heuristic selection of the most promising core problem and the final resort to enumeration by applying a branch and cut algorithm to the selected core problem. For problems with a small ratio of the average fixed cost to the average variable cost (lower than or equal to 25), the proposed method can obtain similar or better solutions than the state-of-art algorithms, such as the tabu search procedure and the parametric ghost image processes. For larger ratios (between 50 and 180), the quality of the obtained solutions could be considered to be halfway between both methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adlakha, V., & Kowalski, K. (2003). A simple heuristic for solving small fixed-charge transportation problems. Omega, 31, 205–211.

    Article  Google Scholar 

  • Atamturk, A., & Savelsbergh, M. W. (2005). Integer programming software systems. Annals of Operations Research, 140, 67–124.

    Article  Google Scholar 

  • Avella, P., Boccia, M., Sforza, A., & Vasil’ev, I. (2008). An effective heuristic for large-scale capacitated facility location problems. Journal of Heuristics. doi:10.1007/s10732-008-9078-y.

  • Avella, P., Sassano, A., & Vasil’ev, I. (2007). Computational study of large-scale p-Median problems. Mathematical Programming, 109, 89–114.

    Article  Google Scholar 

  • Balakrishnan, A., Magnanti, T. L., & Mirchandani, P. (1997). Network design. In M. Dell’Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization. New York: Wiley.

    Google Scholar 

  • Balinski, M. L. (1961). Fixed-cost transportation problems. Naval Research Logistics Quarterly, 8, 41–54.

    Article  Google Scholar 

  • Beasley, J. E. (1993). Lagrangean relaxation. In C. R. Reeves (Ed.), Modern heuristic techniques for combinatorial problems (pp. 243–298). Oxford: Blackwell.

    Google Scholar 

  • Bell, G. J., Lamar, B., & Wallace, C. A. (1999). Capacity improvement, penalties, and the fixed charge transportation problem. Naval Research Logistics Quarterly, 46(4), 341–355.

    Article  Google Scholar 

  • Caprara, A., Fischetti, M., & Toth, P. (1999). A heuristic method for the Set Covering Problem. Operations Research, 47, 730–743.

    Article  Google Scholar 

  • Crainic, T. G., Gendron, B., & Hernu, G. (2004). A slope scaling/Lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics, 10(5), 525–545.

    Article  Google Scholar 

  • Cruz, F. R. B., MacGregor Smith, J., & Mateus, G. R. (1998). Solving to optimality the uncapacitated fixed-charge network flow problem. Computers & Operations Research, 25(1), 67–81.

    Article  Google Scholar 

  • Dongarra, J. J. (2008). Performance of various computers using standard linear equations software. http://www.netlib.org/benchmark/performance.ps.

  • Gendron, B., Crainic, T. G., & Frangioni, A. (1999). In P. Soriano & B. Sansò (Eds.), Multicommodity capacitated network design, telecommunications network planning (pp. 1–19). Norwell: Kluwer Academic.

    Google Scholar 

  • Ghiani, G., Laporte, G., & Musmanno, R. (2004). Introduction to logistics systems planning and control. New York: Wiley.

    Google Scholar 

  • Glover, F., Amini, M., & Kochenberger, G. (2005). Parametric ghost image processes for fixed-charge problems: a study of transportation networks. Journal of Heuristics, 11, 307–336.

    Article  Google Scholar 

  • Göthe-Lundgren, M., & Larsson, T. (1994). A set covering reformulation of the fixed charge transportation problem. Discrete Applied Mathematics, 48, 245–259.

    Article  Google Scholar 

  • Guignard, M. (2003). Lagrangean relaxation. TOP, 11, 151–228.

    Article  Google Scholar 

  • Guisewite, G. M., & Pardalos, P. M. (1990). Minimum concave-cost network flow problems: applications, complexity, and algorithms. Annals of Operations Research, 25, 75–100.

    Article  Google Scholar 

  • Hirsch, W. M., & Dantzig, G. B. (1968). The fixed charge problem. Naval Research Logistics Quarterly, 15, 413–424.

    Google Scholar 

  • Hochbaum, D. S., & Segev, A. (1989). Analysis of a flow problem with fixed charges. Networks, 19, 291–312.

    Article  Google Scholar 

  • Hultberg, T. H., & Cardoso, D. M. (1997). The teacher assignment problem: A special case of the fixed charge transportation problem. European Journal of Operational Research, 101, 463–473.

    Article  Google Scholar 

  • Kim, H. J., & Hooker, J. N. (2002). Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Annals of Operations Research, 115, 95–124.

    Article  Google Scholar 

  • Kim, D., & Pardalos, P. M. (1999). A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Operations Research Letters, 24, 195–203.

    Article  Google Scholar 

  • Klose, A. (2008). Algorithms for solving single-sink fixed-charge transportation problem. Computers & Operations Research, 35, 2079–2092.

    Article  Google Scholar 

  • Lamar, B. W., & Wallace, C. (1997). Revised-modified penalties for fixed charge transportation problems. Management Science, 43, 1431–1436.

    Article  Google Scholar 

  • Magnanti, T. L., & Wong, R. T. (1984). Network design and transportation planning: models and algorithms. Transportation Science, 18, 1–55.

    Article  Google Scholar 

  • Martello, S., & Toth, P. (1990). Knapsack problems. New York: Wiley.

    Google Scholar 

  • Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: Wiley.

    Google Scholar 

  • Ortega, F., & Wolsey, L. A. (2003). A Branch-and-Cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks, 41(3), 143–158.

    Article  Google Scholar 

  • Palekar, U. S., Karwan, M. H., & Zionts, S. (1990). A branch-and-bound method for the fixed charge transportation problem. Management Science, 36, 1092–1105.

    Article  Google Scholar 

  • Steinberg, D. I. (1970). The fixed charge problem. Naval Research Logistics Quarterly, 17, 217–236.

    Article  Google Scholar 

  • Stroup, J. W. (1967). Allocation of launch vehicles to space missions: a fixed-cost transportation problem. Operations Research, 15, 1157–1163.

    Article  Google Scholar 

  • Sun, M., Aronson, J. E., McKeown, P. G., & Drinka, D. (1998). A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research, 106, 441–456.

    Article  Google Scholar 

  • Walker, W. E. (1976). A heuristic adjacent extreme point algorithm for the fixed charge problem. Management Science, 22, 587–596.

    Article  Google Scholar 

  • Wright, D. D., & Haehling von Lanzenauer, C. (1989). Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics. European Journal of Operational Research, 42, 305–312.

    Article  Google Scholar 

  • Wright, D. D., & Haehling von Lanzenauer, C., (1991). COAL: A new heuristic approach for solving the fixed charge problem—computational results. European Journal of Operational Research, 52, 235–246.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Estadística e Investigación Operativa, Universidad de Valladolid, C/ Prado de la Magdalena s/n, 47005, Valladolid, Spain

    Jesús Sáez Aguado

Authors
  1. Jesús Sáez Aguado
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jesús Sáez Aguado.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sáez 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). https://doi.org/10.1007/s10479-008-0483-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0483-2

Keywords

Search

Navigation