A multiproduct EOQ model with permissible delay in payments and shortage within warehouse space constraint: a genetic algorithm approach (Q2204289): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:37, 2 February 2024

scientific article
Language Label Description Also known as
English
A multiproduct EOQ model with permissible delay in payments and shortage within warehouse space constraint: a genetic algorithm approach
scientific article

    Statements

    A multiproduct EOQ model with permissible delay in payments and shortage within warehouse space constraint: a genetic algorithm approach (English)
    0 references
    15 October 2020
    0 references
    Summary: In today's business transactions, sometimes customers are allowed to pay in a grace period, i.e., permissible delay in payment occurs. This policy is advantageous both for the suppliers and for the customers. This paper formulates a multi-product economic order quantity (EOQ) problem with an order-quantity-dependent permissible delay in payment. In this problem, the shortage is backlogged and there is a warehouse constraint. We show that the model of the problem is a constrained nonlinear-integer-program and propose a genetic algorithm (GA) to solve it. Moreover, a statistical approach is employed to calibrate the parameters of the GA. A numerical example is presented at the end to not only demonstrate the application of the proposed parameter-tuned GA, but also to verify the results and to show GA performs better than a simulated annealing (SA) approach.
    0 references
    economic order quantity
    0 references
    UCT EOQ
    0 references
    permissible delay
    0 references
    payment delays
    0 references
    shortage backlogging
    0 references
    warehouse space constraints
    0 references
    genetic algorithms
    0 references
    simulated annealing
    0 references
    nonlinear integer programming
    0 references
    NLIP
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references