In this paper, we address to the multi-item capacitated lot-sizing problem with production time windows and setup times under the non-customer specific case. This problem is known to be NP-hard. Two cooperative approaches are proposed for solving this problem by combining mathematical programming and metaheuristics based on a decomposition scheme. The algorithms use simultaneously the mathematical programming and heuristic procedures such that the local Search algorithm and Variable Neighborhood descent algorithm. The computational experiments show the effectiveness of our proposed algorithms according to the approaches already presented in the literature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Metaheuristics for the multi-item capacitated lot-sizing problem with time Windows and setup times


    Beteiligte:
    Erromdhani, R. (Autor:in) / Jarboui, B. (Autor:in) / Eddaly, M. (Autor:in) / Rebai, A. (Autor:in)


    Erscheinungsdatum :

    01.05.2011


    Format / Umfang :

    1048012 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

    Braysy, O. / Gendreau, M. | British Library Online Contents | 2005


    Split-Delivery Capacitated Arc-Routing Problem With Time Windows

    Lai, Qidong / Zhang, Zizhen / Yu, Mingzhu et al. | IEEE | 2022


    A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Pandey, Digesh / Srivastava, Namita | BASE | 2018

    Freier Zugriff

    Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows

    Yuliza, Evi / Puspita, Fitri Maya / Supadi, Siti Suzlin | BASE | 2021

    Freier Zugriff