Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 51, Issue 1, Pages 118-137Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2011.653010
Keywords
genetic algorithms; algorithm portfolios; inventory routing; stochastic demand
Categories
Funding
- EPSRC [EP/E044506/1, EP/I005781/1, EP/I002456/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/I002456/1, EP/E044506/1, EP/I005781/1] Funding Source: researchfish
Ask authors/readers for more resources
This paper presents an algorithm portfolio methodology based on evolutionary algorithms to solve complex dynamic optimisation problems. These problems are known to have computationally complex objective functions, which make their solutions computationally hard to find, when problem instances of large dimensions are considered. This is due to the inability of the algorithms to provide an optimal or near-optimal solution within an allocated time interval. Therefore, this paper employs a bundle of evolutionary algorithms (EAs) tied together with several processors, known as an algorithm portfolio, to solve a complex optimisation problem such as the inventory routing problem (IRP) with stochastic demands. EAs considered for algorithm portfolios are the genetic algorithm and its four variants such as the memetic algorithm, genetic algorithm with chromosome differentiation, age-genetic algorithm, and gender-specific genetic algorithm. In order to illustrate the applicability of the proposed methodology, a generic method for algorithm portfolios design, evaluation, and analysis is discussed in detail. Experiments were performed on varying dimensions of IRP instances to validate different properties of algorithm portfolio. A case study was conducted to illustrate that the set of EAs allocated to a certain number of processors performed better than their individual counterparts.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available