Metaheuristic for the capacitated lot-sizing problem: a software tool for MPS elaboration (Q606601)

From MaRDI portal





scientific article; zbMATH DE number 5816962
Language Label Description Also known as
default for all languages
No label defined
    English
    Metaheuristic for the capacitated lot-sizing problem: a software tool for MPS elaboration
    scientific article; zbMATH DE number 5816962

      Statements

      Metaheuristic for the capacitated lot-sizing problem: a software tool for MPS elaboration (English)
      0 references
      0 references
      0 references
      0 references
      17 November 2010
      0 references
      Summary: The master production schedule elaboration plays a major part in tactical planning. Among mathematical models which deal with the tactical planning, a particular one is dedicated to it: the capacitated lot-sizing problem. Literature about its resolution is huge, but few metaheuristics have been developed in order to solve it: we propose to use optimisation methods based on a simulated annealing: the data encoding are based on a production planning matrix and the neighbourhood system is maked up of several possible moves. We also proposed a bi-objective function which integrates logistic costs and an evaluation of the degree of the capacities' temporarily leave the set of feasible solutions in order to escape from local minimas. We have tested our optimisation methods on benchmarks from the literature and some best results are outperformed. These methods have been integrated into a software tool.
      0 references
      CLSP
      0 references
      capacitated lot sizing problem
      0 references
      metaheuristics
      0 references
      neighbourhood system
      0 references
      bi-objective function
      0 references
      software tools
      0 references
      MPS
      0 references
      master production schedule
      0 references
      mathematical modelling
      0 references
      simulated annealing
      0 references
      production planning
      0 references
      scheduling
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references