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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:

    Published in:

    Publication date :

    2002-02-20


    Size :

    9 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    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

    Free access

    Solving School Bus Routing Problem with genetic algorithm

    Ben Sghaier, Sayda / Ben Guedria, Najeh / Mraihi, Rafaa | IEEE | 2013