A heuristic technique to find Pareto optimal solutions of the bicriterion sheet metal problem

Renu Tuli, Sudhir Kumar Chauhan, Pankaj Kumar Singh

Abstract


A heuristic algorithm is developed to find Pareto optimal solutions of the bicriterion sheet metal problem. The two criteria are to minimize the cost of left out material (scrap) and to minimize the total processing and setup time for all the orders associated with the blanking operation in sheet metal when nesting of orders is done. In comparison with the methods already existing in the industry for such type of problems the newly developed heuristic algorithm apart from being easy to understand and implement consumes very less implementation time and cost. Providing the decision maker with a set of Pareto optimal solutions gives him/her flexibility to select the best solution among the solutions obtained depending upon his/her priority. Implementation of the algorithm is explained through a numerical example.


Keywords


Blanking; Sheet metal; Nesting; heuristic; Bicriterion; Pareto Optimal.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2014 International Journal of Advances in Engineering Sciences



Subscribe to Print Journals