A Variable Neighborhood Search Heuristic for Supply Chain Coordination using Dynamic Price Discounts

This research studies the problem of supply chain coordination using temporary price discounts. The supplier decides how much discount should be introduced in each period to each of the customers, aiming to maximize its profit, while giving the customers the incentive to order in the desired periods. To solve this problem, a variable neighborhood search is introduced. The results of computational experiments indicate that the variable neighborhood search outperforms the mixed integer-based heuristic introduced earlier in the literature for this problem. Our metaheuristic procedure found the optimal solution for small instances in more than 80% of the cases. Moreover, an advantage of this metaheuristic is the significantly shorter computing time that allows applying it to larger instances.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • Copyright © 2018, Springer-Verlag Berlin Heidelberg and EURO - The Association of European Operational Research Societies. The contents of this paper reflect the views of the authors and do not necessarily reflect the official views or policies of the Transportation Research Board or the National Academy of Sciences.
  • Authors:
  • Publication Date: 2018-12

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01691686
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 28 2019 5:11PM