Feature issue: Neural networks and operations research/management science
Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem

https://doi.org/10.1016/0377-2217(96)00040-9Get rights and content

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. The process of mapping an optimisation problem onto a HNN is demonstrated explicitly, and modifications to the existing neural approaches are presented which guarantee feasibility of solutions. Further modifications are proposed to improve the solution quality by permitting escape from local minima in an attempt to locate the global optimum. Results from all solutions techniques are compared on a set of instances of the CSP, and conclusions drawn.

References (22)

  • S.V.B. Aiyer et al.

    A theoretical investigation into the performance of the Hopfield model

    IEEE Transactions on Neural Networks

    (1990)
  • N. Botros et al.

    Hardware implementation of an artificial neural network using field programmable gate arrays (FPGAs)

    IEEE Transactions on Industrial Electronics

    (1994)
  • R.D. Brandt et al.

    Alternative networks for Solving the Travelling Salesman Problem and the List-Matching Problem

  • P. Chu

    A neural network for solving optimization problems with linear equality constraints

  • T.A. Feo et al.

    The intermodal trailer assignment problem

  • M.R. Garey et al.

    Computers and Intractability

    (1979)
  • A.H. Gee

    Problem solving with optimization networks

  • S.T. Hackman et al.

    Fast, effective algorithms for simple assembly line balancing problems

    Operations Research

    (1989)
  • S. Hegde et al.

    Determination of parameters in a Hopfield/Tank computational network

  • J.J. Hopfield

    Neural networks and physical systems with emergent collective computational abilities

  • J.J. Hopfield

    Neurons with graded response have collective computational properties like those of two-state neurons

  • Cited by (40)

    • Optimizing real-time vehicle sequencing of a paint shop conveyor system

      2015, Omega (United Kingdom)
      Citation Excerpt :

      Consequently, they attempt to solve a very large integer programming assignment problem with side constraints. Because these problems are NP-hard, they are usually solved with heuristic techniques, such as local search (e.g., [12–15]), tabu search (e.g., [16]), simulated annealing (e.g., [17,18]), and ant colony optimization (e.g., [19,20]). In certain instances, they are solved with exact branch-and-bound algorithms (e.g., [21,22]).

    • Optimal sequencing of mixed models with sequence-dependent setups and utility workers on an assembly line

      2010, International Journal of Production Economics
      Citation Excerpt :

      Prior to the 1980s, the main goal was (1) to smooth the workload at each workstation through the line. This goal seeks to reduce line stoppages or inefficiencies like work congestion or utility work (see Mitsumori, 1969 or Xiaobo and Ohno, 1997 for optimal models and for heuristics, see Thomopoulos, 1967; Macaskill, 1973; Sumichrast et al., 1992; Smith et al., 1996; Gottlieb et al., 2003). The emerging JIT concept by the mid 1980s has raised a second goal that consists in keeping a constant rate of part usage to avoid large inventories.

    • Iterated tabu search for the car sequencing problem

      2008, European Journal of Operational Research
    View all citing articles on Scopus
    View full text