La heurística LDMTP: Una metodología híbrida basada en el problema de transporte para el diseño óptimo de la distribución de planta

This paper presents an efficient heuristics to determine the optimal design of plant layout, that minimizes the total cost of material flow within a company, including rules for the initial distribution and logical process to reduce the work to detect the arrangement that offers the best opportunities to reduce total cost process distribution. This new heuristic apply the modified use of Classic Transportation Problem (CTP), which is a proprietary tool of Linear Programming and part of the Operations Research. The LDMTP heuristic of own creation has proven to be efficient for solving the optimal design of plant layout due to is a selective method that is capable of distinguishing the best assignment order of all departments that make up the layout including criteria form (long and width) for each assigned department. Establishing the initial allocation of LDMTP heuristics is not a subjective matter because choosing the best assignment order of departments that make up the initial distribution follows a series of steps and has up to 4 different tiebreakers, so which favors the settlement of departments can make the greatest contribution is chosen to reducing the total cost of distribution.