Parallel Algorithm Portfolio with Market Trading-Based Time Allocation

We propose a parallel portfolio of metaheuristic algorithms that adopts a market trading-based time allocation mechanism. This mechanism dynamically allocates the total available execution time of the portfolio by favoring better-performing algorithms. The proposed approach is assessed on a significant Operations Research problem, namely the single-item lot sizing problem with returns and remanufacturing. Experimental evidence suggests that our approach is highly competitive with standard metaheuristics and specialized state-of-the-art algorithms.

[1]  Fei Peng,et al.  Population-Based Algorithm Portfolios for Numerical Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[2]  Bruce A. Robinson,et al.  Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces , 2009, IEEE Transactions on Evolutionary Computation.

[3]  K. V. Price,et al.  Differential evolution: a fast and simple numerical optimizer , 1996, Proceedings of North American Fuzzy Information Processing.

[4]  Felix T.S. Chan,et al.  Introducing algorithm portfolios to a class of vehicle routing and scheduling problem , 2008 .

[5]  Bart Selman,et al.  Algorithm Portfolio Design: Theory vs. Practice , 1997, UAI.

[6]  Tobias Schulz,et al.  A new Silver–Meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing , 2011 .

[7]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[8]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[9]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[12]  Ioannis Konstantaras,et al.  A FIRST STUDY OF PARTICLE SWARM OPTIMIZATION ON THE DYNAMIC LOT SIZING PROBLEM WITH PRODUCT RETURNS , 2013 .

[13]  Xin Yao,et al.  Population-based Algorithm Portfolios with automated constituent algorithms selection , 2014, Inf. Sci..

[14]  Ruud H. Teunter,et al.  Dynamic lot sizing with product returns and remanufacturing , 2006 .