IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v236y2025icp221-247.html
   My bibliography  Save this article

Optimization of a price break policy and advertisement effort based non-instantaneous deteriorating inventory problem with partial backlogged via metaheuristic algorithms

Author

Listed:
  • Mondal, Rajan
  • Manna, Amalesh Kumar
  • Akhtar, Md
  • Bhunia, Asoke Kumar

Abstract

Repeated advertisements of an item in different media, displayed stock in a decorated showroom, and also price break policies play a vital role in an inventory control system. Also, the relationship between products’ selling price and market demand is conflicting when all other factors are fixed. Thus, the incorporation of advertisement policy and price break facility in a business is more realistic. This work investigates an inventory problem for non-instantaneous deteriorating items with advertisement and displayed inventory level dependent demand under price break facility. Moreover, partially backlogged shortages and transportation cost for replenishing items are considered in the proposed inventory model. Based on the customer’s demand and storage space of the shop, several cases and sub-cases are considered. In this study, different metaheuristic algorithms are considered for maximizing the average profit in each scenario. Then, considering one numerical example, the proposed model is justified. Finally, the sensitivity analysis is carried out to investigate the impact of model parameters on the policy of optimality and a fruitful conclusion is drawn.

Suggested Citation

  • Mondal, Rajan & Manna, Amalesh Kumar & Akhtar, Md & Bhunia, Asoke Kumar, 2025. "Optimization of a price break policy and advertisement effort based non-instantaneous deteriorating inventory problem with partial backlogged via metaheuristic algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 236(C), pages 221-247.
  • Handle: RePEc:eee:matcom:v:236:y:2025:i:c:p:221-247
    DOI: 10.1016/j.matcom.2025.04.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425001375
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.04.007?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:matcom:v:236:y:2025:i:c:p:221-247. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.