Optimization-based planning heuristic for material flow congestion avoidance in conveyor network design Academic Article uri icon


  • A model is developed to plan material flow congestion avoidance on a network of conveyors for handling discrete batches of items, e.g. scanned packages. Minimizing maximum material flow congestion is used as a guide to design the conveyor network by evenly distributing the flow of such batches by considering capacities of the conveyors and existing flow. Problems of this type are typically NP-hard which makes them unsolvable by standard mixed integer programming sol-vers. A method based on results from probability theory is used to solve the formulated problem. Experimental results are presented to demonstrate convergence within 10-100 iterations of the described method for most problems. The ncrease in CPU time is observed to be approximately linear with respect to the number of constraints and with respect to the number of binary variables for a constant number of iterations of the algorithm. A procedure for estimation of bounds is derived to show the proximity of the obtained solution to an optimal solution. 1999, Taylor & Francis Group, LLC. All rights reserved.

published proceedings


author list (cited authors)

  • Banerjee, P., Banerjee, A., & Tesic, R.

citation count

  • 3

complete list of authors

  • Banerjee, P||Banerjee, A||Tesic, R

publication date

  • January 1999