Rudi Leroy
ABSTRACT
Many real-world problems in different industrial and economic fields are permutation combinatorial optimization problems. Solving to optimality large instances of these problems, such as the flowshop problem, is a challenge for multi-core computing.
This paper proposes four work stealing strategies for the multithreaded factoradic-based branch-and-bound (B&B) algorithm to solve permutation combinatorial problems on multi-core processors. The factoradic, called also factorial number system, is a mixed radix numeral system adapted to numbering permutations. In our new parallel strategies, the B&B is based on a matrix of integers instead of a pool of permutations, and work units exchanged between threads are intervals of factoradics instead of sets of nodes.
The experiments show that the strategy based on selecting the largest interval is better than the three other strategies in terms of the number of interval sharing events. Furthermore, the worst factoradic-based strategy spends on average 7.2 times less time managing the pool of subproblems than a conventional pool-based parallel B&B algorithm.
- L. Barreto and M. Bauer. Parallel branch and bound algorithm-a comparison between serial, openmp and mpi implementations. In Journal of Physics: Conference Series, volume 256, page 012018. IOP Publishing, 2010.Google Scholar
- G. Cantor. Zeitschrift für mathematik und physik 14, 1869.Google Scholar
- S. Climer and W. Zhang. Cut-and-solve: an iterative search strategy for combinatorial optimization problems, artificial intelligence. 170:714--738, 2006. Google ScholarDigital Library
- V.D. Cung, S. Dowaji, B. Le Cun, T. Mautor, and C. Roucairol. Parallel and distributed branch-and-bound/A* algorithms. Technical Report 94/31, Laboratoire PRISM, Université de Versailles, 1994.Google Scholar
- J. Eckstein, C. A. Phillips, and W. E. Hart. PICO: An object-oriented framework for parallel branch-and-bound. Research Report 40--2000, RUTCOR, 2000.Google ScholarCross Ref
- M.R. Garey, D.S. Johnson, and R. Sethi. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1:117--129, 1976.Google ScholarDigital Library
- B. Gendron and T.G. Crainic. Parallel Branch and Bound Algorithms: Survey and Synthesis. Operations Research, 42:1042--1066, 1994.Google ScholarDigital Library
- B. Goldengorin, D. Ghosh, and G. Sierksma. Branch and peg algorithms for the simple plant location problem. Computers & Operations Research, 31:241--255, 2004. Google ScholarDigital Library
- V.K. Janakiram, D.P. Agrawal, and R. Mehrotra. A Randomized Parallel Branch-and-bound Algorithm. In in Proc. of Int. Conf. on Parallel Processing, pages 69--75, Aug. 1988.Google ScholarDigital Library
- S.M. Johnson. Optimal two and three-stage production schedules with setup times included. Naval Research Logistis Quarterly, 1:61--68, 1954.Google ScholarCross Ref
- D.E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Reading, Ma, page 192, 1997. ISBN=9780201896848. Google ScholarDigital Library
- V. Kumar and L. Kanal. Parallel Branch-and-Bound Formulations For And/Or Tree Search. IEEE Trans. Pattern. Anal. and Machine Intell., PAMI--6:768--778, 1984. Google ScholarDigital Library
- C-A. Laisant. Sur la numération factorielle, application aux permutations. Bulletin de la Société Mathématique de France, 16:176--183, 1888.Google ScholarCross Ref
- J.K. Lenstra, B.J. Lageweg, and A.H.G. Rinnooy Kan. A General bounding scheme for the permutation flow-shop problem. Operations Research, 26(1):53--67, 1978.Google ScholarDigital Library
- J. McCaffrey. Using permutations in .NET for improved systems security, 2003.Google Scholar
- N. Melab. Contributions à la résolution de problèmes d'optimisation combinatoire sur grilles de calcul. LIFL, USTL, Novembre 2005. Thèse HDR.Google Scholar
- M. Mezmaz, N. Melab, and E-G. Talbi. A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. In In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS). Long Beach, California, March 2007.Google ScholarCross Ref
- M. Mezmaz, N. Melab, and D. Tuyttens. A multithreaded branch-and-bound algorithm for solving the flow-shop problem on a multicore environment, chapter 3, pages 53--70. Large Scale Network--Centric Distributed Systems. John Wiley & Sons, July 2013. ISBN-10: 0470936886, ISBN-13: 978-0470936887.Google ScholarCross Ref
- D.L. Miller and J.F. Pekny. The Role of Performance Metrics for Parallel Mathematical Programming Algorithms. ORSA J. Computing, 5(1):26--28, 1993.Google ScholarCross Ref
- R. Pastor and A. Corominas. Branch and win: Or tree search algorithms for solving combinatorial optimisation problems. Top, 1:169--192, 2004.Google ScholarCross Ref
- R. Paulavičius and J. Žilinskas. Parallel branch and bound algorithm with combination of lipschitz bounds over multidimensional simplices for multicore computers. Parallel Scientific Computing and Optimization, pages 93--102, 2009.Google ScholarCross Ref
- J.F. Sanjuan-Estrada, L.G. Casado, and I. García. Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures. The Journal of Supercomputing, pages 1--9, 2011.Google ScholarCross Ref
- E. Taillard. Benchmarks for basic scheduling problems. Journal of Operational Research, 64:278--285, 1993.Google ScholarCross Ref
Index Terms
- Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System
Recommendations
Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System
PMAM'14: Proceedings of Programming Models and Applications on Multicores and ManycoresMany real-world problems in different industrial and economic fields are permutation combinatorial optimization problems. Solving to optimality large instances of these problems, such as the flowshop problem, is a challenge for multi-core computing.
...
A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System
IPDPS '14: Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing SymposiumMany real-world problems in different industrial and economic fields are permutation combinatorial optimization problems. Solving to optimality large instances of these problems, such as flowshop problem, is a challenge for multi-core computing. This ...
Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms
In this paper, the focus is put on multi-core branch-and-bound algorithms for solving large-scale permutation-based optimization problems. We investigate five work stealing WS strategies with a new data structure called integer-vector-matrix IVM. In ...
Comments