Journal article

Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem

K Smith, M Palaniswami, M Krishnamoorthy

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | ELSEVIER SCIENCE BV | Published : 1996

Abstract

This paper considers the problem of optimally sequencing different car models along an assembly line according to some contiguity constraints, while ensuring that the demands for each of the models are satisfied. This car sequencing problem (CSP) is a practical NP-hard combinatorial optimisation problem. The CSP is formulated as a nonlinear integer programming problem and it is shown that exact solutions to the problem are difficult to obtain due to the indefinite quadratic form of the CSP objective function. Two traditional heuristics (steepest descent and simulated annealing) are employed to solve the CSP approximately. Several Hopfield neural network (HNN) approaches are also presented. T..

View full abstract