IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v38y2010i5p393-397.html
   My bibliography  Save this article

A branching method for the fixed charge transportation problem

Author

Listed:
  • Adlakha, Veena
  • Kowalski, Krzysztof
  • Lev, Benjamin

Abstract

This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound embedded within a branching process. We present a detailed numerical example to illustrate the proposed method.

Suggested Citation

  • Adlakha, Veena & Kowalski, Krzysztof & Lev, Benjamin, 2010. "A branching method for the fixed charge transportation problem," Omega, Elsevier, vol. 38(5), pages 393-397, October.
    • Handle: RePEc:eee:jomega:v:38:y:2010:i:5:p:393-397
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(09)00074-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    2. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    3. V Adlakha & K Kowalski, 2004. "A simple algorithm for the source-induced fixed-charge transportation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1275-1280, December.
    4. Yu, Ming-Miin & Lin, Erwin T.J., 2008. "Efficiency and effectiveness in railway performance using a multi-activity network DEA model," Omega, Elsevier, vol. 36(6), pages 1005-1017, December.
    5. Arsham, Hossein & Adlakha, Veena & Lev, Benjamin, 2009. "A simplified algebraic method for system of linear inequalities with LP applications," Omega, Elsevier, vol. 37(4), pages 876-882, August.
    6. Adlakha, Veena & Kowalski, Krzysztof & Vemuganti, R.R. & Lev, Benjamin, 2007. "More-for-less algorithm for fixed-charge transportation problems," Omega, Elsevier, vol. 35(1), pages 116-127, February.
    7. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    8. G.Y. Tütüncü & B.M. Carreto Baker, 2009. "A visual interactive approach to the classical and mixed vehicle routing problems with backhauls," Post-Print hal-00581628, HAL.
    9. Katta G. Murty, 1968. "Solving the Fixed Charge Problem by Ranking the Extreme Points," Operations Research, INFORMS, vol. 16(2), pages 268-279, April.
    10. Warren E. Walker, 1976. "A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem," Management Science, INFORMS, vol. 22(5), pages 587-596, January.
    11. Caramia, M. & Guerriero, F., 2009. "A heuristic approach to long-haul freight transportation with multiple objective functions," Omega, Elsevier, vol. 37(3), pages 600-614, June.
    12. Li, Jing-Quan & Borenstein, Denis & Mirchandani, Pitu B., 2008. "Truck scheduling for solid waste collection in the City of Porto Alegre, Brazil," Omega, Elsevier, vol. 36(6), pages 1133-1149, December.
    13. ORTEGA , Francisco & WOLSEY, Laurence A., 2003. "A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem," LIDAM Reprints CORE 1611, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. Udatta S. Palekar & Mark H. Karwan & Stanley Zionts, 1990. "A Branch-and-Bound Method for the Fixed Charge Transportation Problem," Management Science, INFORMS, vol. 36(9), pages 1092-1105, September.
    15. YazgI Tütüncü, G. & Carreto, Carlos A.C. & Baker, Barrie M., 2009. "A visual interactive approach to classical and mixed vehicle routing problems with backhauls," Omega, Elsevier, vol. 37(1), pages 138-154, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    2. Gourav Gupta & Shivani & Deepika Rani, 2024. "Neutrosophic goal programming approach for multi-objective fixed-charge transportation problem with neutrosophic parameters," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1274-1300, September.
    3. Khurana, Archana & Adlakha, Veena & Lev, Benjamin, 2018. "Multi-index constrained transportation problem with bounds on availabilities, requirements and commodities," Operations Research Perspectives, Elsevier, vol. 5(C), pages 319-333.
    4. Adlakha, Veena & Kowalski, Krzysztof & Wang, Simi & Lev, Benjamin & Shen, Wenjing, 2014. "On approximation of the fixed charge transportation problem," Omega, Elsevier, vol. 43(C), pages 64-70.
    5. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    6. J R Montoya-Torres & A Aponte & P Rosas, 2011. "Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 397-406, February.
    7. Kowalski, Krzysztof & Lev, Benjamin & Shen, Wenjing & Tu, Yan, 2014. "A fast and simple branching algorithm for solving small scale fixed-charge transportation problem," Operations Research Perspectives, Elsevier, vol. 1(1), pages 1-5.
    8. Huang, Shan-Huen & Lin, Pei-Chun, 2015. "Vehicle routing–scheduling for municipal waste collection system under the “Keep Trash off the Ground” policy," Omega, Elsevier, vol. 55(C), pages 24-37.
    9. V. Adlakha & K. Kowalski, 2015. "Fractional Polynomial Bounds for the Fixed Charge Problem," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1026-1038, March.
    10. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    11. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Adlakha, Veena & Kowalski, Krzysztof & Wang, Simi & Lev, Benjamin & Shen, Wenjing, 2014. "On approximation of the fixed charge transportation problem," Omega, Elsevier, vol. 43(C), pages 64-70.
    2. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    3. Kowalski, Krzysztof & Lev, Benjamin & Shen, Wenjing & Tu, Yan, 2014. "A fast and simple branching algorithm for solving small scale fixed-charge transportation problem," Operations Research Perspectives, Elsevier, vol. 1(1), pages 1-5.
    4. V. Adlakha & K. Kowalski, 2015. "Fractional Polynomial Bounds for the Fixed Charge Problem," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1026-1038, March.
    5. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    6. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    7. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.
    8. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    9. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    10. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.
    11. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.
    12. Hong, Jiangtao & Diabat, Ali & Panicker, Vinay V. & Rajagopalan, Sridharan, 2018. "A two-stage supply chain problem with fixed costs: An ant colony optimization approach," International Journal of Production Economics, Elsevier, vol. 204(C), pages 214-226.
    13. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    14. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    15. Ma, Hong & Miao, Zhaowei & Lim, Andrew & Rodrigues, Brian, 2011. "Crossdocking distribution networks with setup cost and time window constraint," Omega, Elsevier, vol. 39(1), pages 64-72, January.
    16. Aristide Mingozzi & Roberto Roberti, 2018. "An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns," Transportation Science, INFORMS, vol. 52(2), pages 229-238, March.
    17. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    18. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    19. Ma, Li-Ching, 2012. "Screening alternatives graphically by an extended case-based distance approach," Omega, Elsevier, vol. 40(1), pages 96-103, January.
    20. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:38:y:2010:i:5:p:393-397. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.