IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i4p471-d338533.html
   My bibliography  Save this article

Dimensionality-reduction Procedure for the Capacitated p-Median Transportation Inventory Problem

Author

Listed:
  • Rafael Bernardo Carmona-Benítez

    (School of Business and Economics, Universidad Anahuac Mexico, Huixquilucan 52786, Mexico)

Abstract

The capacitated p-median transportation inventory problem with heterogeneous fleet (CLITraP-HTF) aims to determine an optimal solution to a transportation problem subject to location-allocation, inventory management and transportation decisions. The novelty of CLITraP-HTF is to design a supply chain that solves all these decisions at the same time. Optimizing the CLITraP-HTF is a challenge because of the high dimension of the decision variables that lead to a large and complex search space. The contribution of this paper is to develop a dimensionality-reduction procedure (DRP) to reduce the CLITraP-HTF complexity and help to solve it. The proposed DRP is a mathematical proof to demonstrate that the inventory management and transportation decisions can be solved before the optimization procedure, thus reducing the complexity of the CLITraP-HTF by greatly narrowing its number of decision variables such that the remaining problem to solve is the well-known capacitated p-median problem (CPMP). The conclusion is that the proposed DRP helps to solve the CLITraP-HTF because the CPMP can be and has been solved by applying different algorithms and heuristic methods.

Suggested Citation

  • Rafael Bernardo Carmona-Benítez, 2020. "Dimensionality-reduction Procedure for the Capacitated p-Median Transportation Inventory Problem," Mathematics, MDPI, vol. 8(4), pages 1-16, March.
  • Handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:471-:d:338533
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/4/471/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/8/4/471/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Odell, P. R. & Rosing, K. E. & Beke-Vogelaar, H., 1976. "Optimising the oil pipeline system in the UK sector of the North Sea," Energy Policy, Elsevier, vol. 4(1), pages 50-55, March.
    2. Escalona, P. & Ordóñez, F. & Marianov, V., 2015. "Joint location-inventory problem with differentiated service levels using critical level policy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 141-157.
    3. A. M. El-Shaieb, 1973. "A New Algorithm for Locating Sources Among Destinations," Management Science, INFORMS, vol. 20(2), pages 221-231, October.
    4. Mark S. Daskin & Kayse Lee Maass, 2015. "The p-Median Problem," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 21-45, Springer.
    5. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    6. Ralph W. Swain, 1974. "A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems," Management Science, INFORMS, vol. 21(2), pages 189-198, October.
    7. R. S. Garfinkel & A. W. Neebe & M. R. Rao, 1974. "An Algorithm for the M-Median Plant Location Problem," Transportation Science, INFORMS, vol. 8(3), pages 217-236, August.
    Full references (including those not matched with items on IDEAS)

    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. Rosing, K. E. & ReVelle, C. S. & Schilling, D. A., 1999. "A gamma heuristic for the p-median problem," European Journal of Operational Research, Elsevier, vol. 117(3), pages 522-532, September.
    2. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    3. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    4. E L Hillsman, 1984. "The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis," Environment and Planning A, , vol. 16(3), pages 305-318, March.
    5. Sauvey, Christophe & Melo, Teresa & Correia, Isabel, 2019. "Two-phase heuristics for a multi-period capacitated facility location problem with service-differentiated customers," Technical Reports on Logistics of the Saarland Business School 16, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    6. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    7. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    8. K E Rosing, 1991. "Towards the Solution of the (Generalised) Multi-Weber Problem," Environment and Planning B, , vol. 18(3), pages 347-360, September.
    9. Averbakh, Igor & Berman, Oded, 1996. "Locating flow-capturing units on a network with multi-counting and diminishing returns to scale," European Journal of Operational Research, Elsevier, vol. 91(3), pages 495-506, June.
    10. C S Sung & W Yang, 2008. "An exact algorithm for a cross-docking supply chain network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 119-136, January.
    11. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    12. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    13. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    14. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    15. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    16. Jones, Dylan & Firouzy, Sina & Labib, Ashraf & Argyriou, Athanasios V., 2022. "Multiple criteria model for allocating new medical robotic devices to treatment centres," European Journal of Operational Research, Elsevier, vol. 297(2), pages 652-664.
    17. Yun, Lifen & Qin, Yong & Fan, Hongqiang & Ji, Changxu & Li, Xiaopeng & Jia, Limin, 2015. "A reliability model for facility location design under imperfect information," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 596-615.
    18. Faustino, Fausta J. & Lopes, José Calixto & Melo, Joel D. & Sousa, Thales & Padilha-Feltrin, Antonio & Brito, José A.S. & Garcia, Claudio O., 2023. "Identifying charging zones to allocate public charging stations for electric vehicles," Energy, Elsevier, vol. 283(C).
    19. Canos, M. J. & Ivorra, C. & Liern, V., 1999. "An exact algorithm for the fuzzy p-median problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 80-86, July.
    20. P B Mirchandani & A Oudjit, 1982. "Probabilistic Demands and Costs in Facility Location Problems," Environment and Planning A, , vol. 14(7), pages 917-932, July.

    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:gam:jmathe:v:8:y:2020:i:4:p:471-:d:338533. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.