IDEAS home Printed from https://ideas.repec.org/a/col/000431/013293.html
   My bibliography  Save this article

Optimización multiobjetivo en una cadena de suministro

Author

Listed:
  • Adel Alfonso Mendoza Mendoza
  • Tomás José Fontalvo Herrera
  • Delimiro Alberto Visbal Cadavid

Abstract

En este artículo se presenta un modelo matemático de optimización multiobjetivo de una cadena de suministro global. En el modelo propuesto se consideran las capacidades de abastecimiento de los proveedores, de producción y de distribución. Para el análisis se incluyen en las diferentes funciones objetivo, los costos de inversión, los costos de materia prima, los costos de producción, así como también el Lead Time en toda la cadena. Se muestra un caso de aplicacióndel modelo con tres proveedores, tres plantas de producción, tres centros de distribución, tres mercados de consumo, dos tipos de materia prima y dos clases de transporte. La solución del modelo emplea un algoritmo evolutivo y para evaluar su eficiencia se compara con resultados obtenidos de optimización individual de cada una de las funciones objetivo.

Suggested Citation

  • Adel Alfonso Mendoza Mendoza & Tomás José Fontalvo Herrera & Delimiro Alberto Visbal Cadavid, 2014. "Optimización multiobjetivo en una cadena de suministro," Revista Ciencias Estratégicas, Universidad Pontificia Bolivariana, December.
    • Handle: RePEc:col:000431:013293
    as

    Download full text from publisher

    File URL: https://revistas.upb.edu.co/index.php/cienciasestrategicas/article/view/4026
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Edward Rothberg, 2007. "An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 534-541, November.
    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. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2021. "Weighted proximity search," Journal of Heuristics, Springer, vol. 27(3), pages 459-496, June.
    2. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    3. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    4. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2022. "Weighted iterated local branching for mathematical programming problems with binary variables," Journal of Heuristics, Springer, vol. 28(3), pages 329-350, June.
    5. Kuo-Ling Huang & Sanjay Mehrotra, 2013. "An empirical evaluation of walk-and-round heuristics for mixed integer linear programs," Computational Optimization and Applications, Springer, vol. 55(3), pages 545-570, July.
    6. Stephen J. Maher, 2021. "Enhancing large neighbourhood search heuristics for Benders’ decomposition," Journal of Heuristics, Springer, vol. 27(4), pages 615-648, August.
    7. Fischetti, Matteo & Monaci, Michele & Sinnl, Markus, 2018. "A dynamic reformulation heuristic for Generalized Interdiction Problems," European Journal of Operational Research, Elsevier, vol. 267(1), pages 40-51.
    8. Lluís-Miquel Munguía & Shabbir Ahmed & David A. Bader & George L. Nemhauser & Yufen Shao, 2018. "Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs," Computational Optimization and Applications, Springer, vol. 69(1), pages 1-24, January.
    9. Akkan, Can & Erdem Külünk, M. & Koçaş, Cenk, 2016. "Finding robust timetables for project presentations of student teams," European Journal of Operational Research, Elsevier, vol. 249(2), pages 560-576.
    10. Álvarez-Miranda, Eduardo & Cacchiani, Valentina & Lodi, Andrea & Parriani, Tiziano & Schmidt, Daniel R., 2014. "Single-commodity robust network design problem: Complexity, instances and heuristic solutions," European Journal of Operational Research, Elsevier, vol. 238(3), pages 711-723.
    11. David F. Koza & Guy Desaulniers & Stefan Ropke, 2020. "Integrated Liner Shipping Network Design and Scheduling," Transportation Science, INFORMS, vol. 54(2), pages 512-533, March.

    More about this item

    Keywords

    Cadena de suministro; optimización multiobjetivo; tiempo de entrega;
    All these keywords.

    JEL classification:

    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    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:col:000431:013293. 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: Revista Ciencias Estratégicas (email available below). General contact details of provider: .

    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.