IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n506531.html
   My bibliography  Save this article

Designing a Fresh Food Supply Chain Network: An Application of Nonlinear Programming

Author

Listed:
  • Yu-Chung Tsao

Abstract

In today’s business environment, many fresh food companies have complex supply networks to distribute their products. For example, agricultural products are distributed through a multiechelon supply chain which includes agricultural association, agricultural produce marketing corporations (APMCs), markets, and so forth. In this paper a fresh produce supply network model is designed to determine the optimal service area for APMCs, the replenishment cycle time of APMCs, and the freshness‐keeping effort, while maximizing the total profit. The objective is to address the integrated facility location, inventory allocation, and freshness‐keeping effort problems. This paper develops an algorithm to solve the nonlinear problem, provides numerical analysis to illustrate the proposed solution procedure, and discusses the effects of various system parameters on the decisions and total profits. A real case of an agricultural product supply chain in Taiwan is used to verify the model. Results of this study can serve as a reference for business managers and administrators.

Suggested Citation

  • Yu-Chung Tsao, 2013. "Designing a Fresh Food Supply Chain Network: An Application of Nonlinear Programming," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
  • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:506531
    DOI: 10.1155/2013/506531
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/506531
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/506531?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
    ---><---

    More about this item

    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:wly:jnljam:v:2013:y:2013:i:1:n:506531. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1155/4058 .

    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.