AbstractThe joint replenishment problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimize the total costs (comprised of holding cost and setup cost) over the planning horizon. In this paper, we look at the multi-buyer, multi-item version of the JRP. We propose a new modified genetic algorithm which is very efficient. Tests are conducted on problems from a leading bank in Hong Kong and from the literature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving the multi-buyer joint replenishment problem with a modified genetic algorithm


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2002-02-20


    Format / Umfang :

    9 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch







    A Decomposed Genetic Algorithm for Solving the Joint Product Family Optimization Problem

    Khajavirad, Aida / Michalek, Jeremy / Simpson, Timothy | AIAA | 2007


    SOLVING FUZZY DYNAMIC SHIP ROUTING AND SCHEDULING PROBLEM THROUGH MODIFIED GENETIC ALGORITHM

    Das, Madhushree / Roy, Arindam / Maity, Samir et al. | BASE | 2022

    Freier Zugriff