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

On the fixed-charge transportation problem

Author

Listed:
  • Adlakha, Veena
  • Kowalski, Krzysztof

Abstract

In many distribution problems, the transportation cost consists of a fixed cost, independent of the amount transported and a variable cost, proportional to the amount shipped. In such fixed-charge transportation problems, is it possible to find a solution with less (or equal) cost than the optimal solution by shipping more units, under the condition that at least the same amount is shipped from each supply point and to each market? This question has not received any attention in the literature, and no algorithm (either analytical or heuristic) is known to address this problem. The more-for-less analysis could be useful for managers in decisions such as increasing warehouse/plant capacity, analyzing company acquisitions, mergers, consolidations or downsizing. In this paper we develop a quick sufficient condition to identify candidate markets and supply points to ship more for less in fixed-charge transportation problems.

Suggested Citation

  • Adlakha, Veena & Kowalski, Krzysztof, 1999. "On the fixed-charge transportation problem," Omega, Elsevier, vol. 27(3), pages 381-388, June.
    • Handle: RePEc:eee:jomega:v:27:y:1999:i:3:p:381-388
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(98)00064-4
    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. Katta G. Murty, 1968. "Solving the Fixed Charge Problem by Ranking the Extreme Points," Operations Research, INFORMS, vol. 16(2), pages 268-279, April.
    2. 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.
    3. Charnes, A. & Duffuaa, S. & Ryan, M., 1987. "The more-for-less paradox in linear programming," European Journal of Operational Research, Elsevier, vol. 31(2), pages 194-197, August.
    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. 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. 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.
    3. Hüseyin Güden & Haldun Süral, 2017. "A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1085-1093, September.
    4. 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.
    5. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    6. 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.
    7. 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.

    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. 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.
    2. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    3. 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.
    4. 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.
    5. 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.
    6. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    7. 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.
    8. 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.
    9. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Adlakha, Veena & Kowalski, Krzysztof, 1998. "A quick sufficient solution to the More-for-Less paradox in the transportation problem," Omega, Elsevier, vol. 26(4), pages 541-547, August.
    16. H. Neil Geismar & Gilbert Laporte & Lei Lei & Chelliah Sriskandarajah, 2008. "The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 21-33, February.
    17. Guinet, Alain, 2001. "Multi-site planning: A transshipment problem," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 21-32, December.
    18. Gavin J. Bell & Bruce W. Lamar & Chris A. Wallace, 1999. "Capacity improvement, penalties, and the fixed charge transportation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 341-355, June.
    19. ORTEGA, Francisco & WOLSEY, Laurence, 2000. "A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem," LIDAM Discussion Papers CORE 2000049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.

    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:27:y:1999:i:3:p:381-388. 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.