IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8696910.html
   My bibliography  Save this article

Optimizing Terminal Delivery of Perishable Products considering Customer Satisfaction

Author

Listed:
  • Xuping Wang
  • Xiaoyu Sun
  • Jie Dong
  • Meng Wang
  • Junhu Ruan

Abstract

Freshness of products and timeliness of delivery are two critical factors which have impact on customer satisfaction in terminal delivery of perishable products. This paper investigates how to make a cost-saving vehicle scheduling for perishable products by maximizing customer satisfaction. Customer satisfaction is defined from the two aspects of freshness and time window. Then we develop a priority function based on customer satisfaction and use the hierarchical clustering method to identify customer service priority. Based on the priority, a multiobjective vehicle scheduling optimization model for perishable products is formulated to maximize customer satisfaction and minimize total delivery costs. To solve the proposed model, a priority-based genetic algorithm (PB-GA) is designed. Numerical experiments and sensitivity analysis are performed to show the validity and advantage of our approach. Results indicate that PB-GA can achieve better solutions than traditional genetic algorithm. The improvement of customer satisfaction is higher than the decrease rate of total costs within a certain shelf life range, which reveals that the proposed method is applicable to the terminal delivery of perishable products.

Suggested Citation

  • Xuping Wang & Xiaoyu Sun & Jie Dong & Meng Wang & Junhu Ruan, 2017. "Optimizing Terminal Delivery of Perishable Products considering Customer Satisfaction," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-12, February.
  • Handle: RePEc:hin:jnlmpe:8696910
    DOI: 10.1155/2017/8696910
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/8696910.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/8696910.xml
    Download Restriction: no

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yu Song & Xi Fang, 2023. "An Improved Strength Pareto Evolutionary Algorithm 2 with Adaptive Crossover Operator for Bi-Objective Distributed Unmanned Aerial Vehicle Delivery," Mathematics, MDPI, vol. 11(15), pages 1-25, July.

    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:hin:jnlmpe:8696910. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.