Some experiments with simulated annealing techniques for packing problems

Article Abstract:

Simulated annealing techniques can be used to solve problems with packing. The simulated annealing algorithm has proved to be an efficient local search heuristic procedure. The quality of the solution is reliant on the algorithm's basic requirements comprising parameters to govern the rejection or acceptance of new solutions and a neighbourhood structure on the feasible solutions set. The efficacy of the procedure is studied via various experiments, with experiments also conducted to discover the best parameters to apply and the best neighbourhood structure to use.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Shortest-route formulation of mixed-model assembly line balancing problem

Article Abstract:

A study on the complex mathematical nature of the assembly line problem was conducted to investigate mixed-model assembly lines which are the most frequently encountered type in industry. It is assumed that a set of common tasks among the models exists, though the performance times of these tasks may vary across the models. A shortest-route formulation of the mixed-model assembly line balancing problem results in an optimal solution.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Improved methods of assembly sequence determination for automatic assembly systems

Article Abstract:

Research exploring methods of assembly sequence using as performance measure the product unit cost is presented, as an alternative to simulated annealing. Particular attention is given to finding the global optimum for a given automatic assembly problem.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: