Among the different problems used to test and compare constraint problem solving approaches, the car sequencing problem is interesting in that it corresponds to a real industrial problem while remaining relatively simple to model. It could thus become a benchmark for constraint problem solving. Based on a realistic definition of the car sequencing problem, the authors present an approach based on the use of simulated annelling. They will demonstrate that the results obtained with this method are extremely interesting. It is then compared simulated annealing with constraint problem solving in the context of this particular problem. This discussion could form the basis for a methodological approach in establishing relationships between the features of a problem and its possible solution.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving constraint satisfaction problems with simulated annealing: the car sequencing problem revisited


    Weitere Titelangaben:

    Zwangsbedingte Problemlösung mit der Methode des Simulated Annealing bei der Nachkontrolle im Kraftfahrzeugbau


    Beteiligte:
    Chew, Tat-Leong (Autor:in) / David, J.M. (Autor:in) / Nguyen, A. (Autor:in) / Tourbier, Y. (Autor:in)


    Erscheinungsdatum :

    1992


    Format / Umfang :

    12 Seiten, 4 Bilder, 10 Quellen



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch







    Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling

    Wang, ChangYing / Lin, Min / Zhong, YiWen et al. | British Library Online Contents | 2015


    Shipbuilding Scheduling Problems Solved by Algorithms as a Weighted Constraint Satisfaction Problem

    Matsuda, M. / Makino, Y. / Nakama, Y. et al. | British Library Conference Proceedings | 2007