1 / 20

Introduction

APPLICATION OF LOCAL SEARCH METHODS FOR SOLVING A QUADRATIC ASSIGNMENT PROBLEM: A CASE STUDY Gürdal Ertek, Burak Aksu, Ş. İlker Birbil, Murat Cihan İkikat, Can Yıldırmaz Sabancı University Orhanlı, Tuzla 34956 Istanbul, Turkey. Introduction. Application of local search methods

asher
Download Presentation

Introduction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. APPLICATION OF LOCAL SEARCH METHODS FOR SOLVING A QUADRATIC ASSIGNMENT PROBLEM: A CASE STUDYGürdal Ertek, Burak Aksu, Ş. İlker Birbil, Murat Cihan İkikat, Can YıldırmazSabancı UniversityOrhanlı, Tuzla 34956Istanbul, Turkey

  2. Introduction • Application of local search methods • Real-life application at a steel cord manufacturing plant • Layout problem that can be represented as a Quadratic Assignment Problem (QAP) • Implement the well-known local search methods, 2-opt, 3-opt and tabu search. • Compare to solution of NEOS

  3. Steel Cord • Typicallyused as the main reinforcement material in manufacturing steel radial tires. • Strengthens the tire to provide fuel savings, long mileage, safety and comfort. • Continuous processes, where wire semi-products are stored on discrete inventory units, namely “spools”

  4. Literature on Steel Cord Manufacturing • Very specialized type of manufacturing. • Systems required are produced and installed by only a handful of companies in the world.

  5. Literature on Steel Cord Manufacturing • Thomas et al. (2002):Improvement of operations in a steel cord manufacturing company using simulation • Mercankaya (2003): Development of an optimization-based decision support system • Türkseven and Ertek (2003): Determination of optimal spool lengths under certain constraints.

  6. Steel Cord Manufacturing Processes • Incoming raw material, the “steel rod wire”, is thinned by dry and wet drawing into “filaments” that are used in successive bunching operations to construct the “steel cord” final products. • The first phase of the production is carried out by machines that are fixed to their locations. • The focus of our research is the second phase of production, which starts with wet wire drawing and ends with spiraling.

  7. Begin Production Dry drawing I & II Copper plating Steel wire rod Annealing Zinc plating Cold air bath Wet drawing Filament Cold water bath Bunching RESEARCH FOCUS RESEARCH FOCUS Acidic solution Spiraling Basic solution Packaging Steel cord End production to Copper plating

  8. Steel Cord Manufacturing Processes • Machine types MT01, MT02 and MT03, have to be located in the neighborhood of a lubricant pool. • These machines use the lubricant liquid, which is supplied to the machines by an underground pipeline system. • We assigned a high flow volume between these machine types and the lubricant cells.

  9. Mathematical Model • We assume that the flow from an area of machine type i to another area of machine type j is equally distributed.

  10. Machine type i Machine type j 1 1 1 1 1 2 1 1 2 1 3

  11. Very similar to the Quadratic Assignment Problem (QAP) problem.

  12. Solution Approaches • GAMS Model • The model required specification of the rectilinear distances between areas • We implement a “model generator” program to generate the model automatically based on input datausing the Java programming language.

  13. Machine types Ki Fij Model Generator NEOS GAMSModel

  14. http://www-neos.mcs.anl.gov/neos/

  15. Visualization done by a Java program • 2-opt and 3-optalgorithms terminated without finding any improved solutions.

  16. Solution Approaches • Tabu search heuristic developed by Taillard (1991) • http://ina.eivd.ch/collaborateurs/etd/ • We tried 5 different starting solutions, and observed that all these solutions had the objective function value of 6,953,483. • Tabu search heuristic is very much applicable for the problem that we have presented.

  17. Future Research • How to assign the flows from each area of machine type i to each area of machine type j. • An embedded network flow problem: • Given a layout, each flow assignment is a possible solution. • Given a flow assignment each layout choice is a possible solution. • There is a need to develop algorithms that can solve these two interrelated problems simultaneously.

  18. Machine type i Machine type j 1 2 1 1 2 2 2 1 3

More Related