IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v237y2014i3p814-823.html
   My bibliography  Save this article

The Red–Blue transportation problem

Author

Listed:
  • Vancroonenburg, Wim
  • Della Croce, Federico
  • Goossens, Dries
  • Spieksma, Frits C.R.

Abstract

This paper considers the Red–Blue Transportation Problem (Red–Blue TP), a generalization of the transportation problem where supply nodes are partitioned into two sets and so-called exclusionary constraints are imposed. We encountered a special case of this problem in a hospital context, where patients need to be assigned to rooms. We establish the problem’s complexity, and we compare two integer programming formulations. Furthermore, a maximization variant of Red–Blue TP is presented, for which we propose a constant-factor approximation algorithm. We conclude with a computational study on the performance of the integer programming formulations and the approximation algorithms, by varying the problem size, the partitioning of the supply nodes, and the density of the problem.

Suggested Citation

  • Vancroonenburg, Wim & Della Croce, Federico & Goossens, Dries & Spieksma, Frits C.R., 2014. "The Red–Blue transportation problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 814-823.
    • Handle: RePEc:eee:ejores:v:237:y:2014:i:3:p:814-823
    DOI: 10.1016/j.ejor.2014.02.055
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714001908
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.02.055?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Alex Orden, 1956. "The Transhipment Problem," Management Science, INFORMS, vol. 2(3), pages 276-285, April.
    2. Ulrich Pferschy & Joachim Schauer, 2013. "The maximum flow problem with disjunctive constraints," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 109-119, July.
    3. MacKinnon, James G., 1975. "An algorithm for the generalized transportation problem," Regional Science and Urban Economics, Elsevier, vol. 5(4), pages 445-464, December.
    4. Sun, Minghe, 2002. "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms," European Journal of Operational Research, Elsevier, vol. 140(3), pages 629-647, 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. Guido, Rosita & Groccia, Maria Carmela & Conforti, Domenico, 2018. "An efficient matheuristic for offline patient-to-bed assignment problems," European Journal of Operational Research, Elsevier, vol. 268(2), pages 486-503.
    2. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    3. Juman, Z.A.M.S. & Hoque, M.A., 2014. "A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies," European Journal of Operational Research, Elsevier, vol. 239(1), pages 146-156.

    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. Şuvak, Zeynep & Altınel, İ. Kuban & Aras, Necati, 2020. "Exact solution algorithms for the maximum flow problem with additional conflict constraints," European Journal of Operational Research, Elsevier, vol. 287(2), pages 410-437.
    2. Annette M. C. Ficker & Frits C. R. Spieksma & Gerhard J. Woeginger, 2021. "The transportation problem with conflicts," Annals of Operations Research, Springer, vol. 298(1), pages 207-227, March.
    3. Osleeb, Jeffrey P. & Ratick, Samuel J., 2010. "An Interperiod Network Storage Location–Allocation (INSLA) model for rail distribution of ethanol biofuels," Journal of Transport Geography, Elsevier, vol. 18(6), pages 729-737.
    4. Kelley, Jason & Kuby, Michael & Sierra, Rodrigo, 2013. "Transportation network optimization for the movement of indigenous goods in Amazonian Ecuador," Journal of Transport Geography, Elsevier, vol. 28(C), pages 89-100.
    5. C. Y. Lam, 2021. "Optimizing logistics routings in a network perspective of supply and demand nodes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 357-377, March.
    6. MacAulay, T. Gordon & Batterham, Robert L. & Fisher, Brian S., 1989. "Solution Of Spatial Trading Systems With Concave Cubic Programming," Australian Journal of Agricultural Economics, Australian Agricultural and Resource Economics Society, vol. 33(3), pages 1-17, December.
    7. Goossens, D.R. & Maas, A.J.T. & Spieksma, F.C.R. & van de Klundert, J.J., 2007. "Exact algorithms for procurement problems under a total quantity discount structure," European Journal of Operational Research, Elsevier, vol. 178(2), pages 603-626, April.
    8. Brucker, Peter & Qu, Rong & Burke, Edmund, 2011. "Personnel scheduling: Models and complexity," European Journal of Operational Research, Elsevier, vol. 210(3), pages 467-473, May.
    9. Paul, Jomon Aliyas & Wang, Xinfang (Jocelyn), 2015. "Robust optimization for United States Department of Agriculture food aid bid allocations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 129-146.
    10. Rowse, John, 1980. "1. On User Solution Strategy for Mixed-Integer Linear Programming Models 2. On the Solution of Spatial Price and Allocation Models," Queen's Institute for Economic Research Discussion Papers 275172, Queen's University - Department of Economics.
    11. Marta Boczoń & Alistair J. Wilson, 2023. "Goals, Constraints, and Transparently Fair Assignments: A Field Study of Randomization Design in the UEFA Champions League," Management Science, INFORMS, vol. 69(6), pages 3474-3491, June.
    12. Ulrich Pferschy & Joachim Schauer, 2017. "Approximation of knapsack problems with conflict and forcing graphs," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1300-1323, May.
    13. Cassidy, P.A. & McCarthy, W.O. & Toft, H.I., 1970. "An Application Of Spatial Analysis To Beef Slaughter Plant Location And Size, Queensland," Australian Journal of Agricultural Economics, Australian Agricultural and Resource Economics Society, vol. 14(1), pages 1-20, June.
    14. Paggi, Mechel & Fuller, Stephen & Grant, Warren R., 1987. "Cargo Preference: Its Impact on the U.S. Wheat Sector," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 28(1).
    15. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
    16. Li, Xinyan & Xie, Chi & Bao, Zhaoyao, 2022. "A multimodal multicommodity network equilibrium model with service capacity and bottleneck congestion for China-Europe containerized freight flows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    17. Luiz Viana & Manoel Campêlo & Ignasi Sau & Ana Silva, 2021. "A unifying model for locally constrained spanning tree problems," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 125-150, July.
    18. Shakeel Javaid & Dr. S.N. Gupta, 2008. "Capacitated Stochastic Fractional Transshipment Problem," Journal of Commerce and Trade, Society for Advanced Management Studies, vol. 3(1), pages 84-93, April.
    19. Martin, Alexander & Weibelzahl, Martin, 2014. "Where and when to pray? Optimal mass planning and efficient resource allocation in the church," FAU Discussion Papers in Economics 06/2014, Friedrich-Alexander University Erlangen-Nuremberg, Institute for Economics.
    20. M T Lucas & D Chhajed, 2004. "Applications of location analysis in agriculture: a survey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 561-578, June.

    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:ejores:v:237:y:2014:i:3:p:814-823. 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/locate/eor .

    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.