A Survey of League Championship Algorithm: Prospects and Challenges <s> Generalization <s> POPMUSIC—partial optimization metaheuristic under special intensification conditions—is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labelling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template is to find an initial solution. This article presents a method for generating an appropriate initial solution to the location-routing problem by producing in O (n 3/2) an approximate solution to the capacitated p-median problem. The method is tested on LRP instances with millions of entities. <s> BIB001 </s> A Survey of League Championship Algorithm: Prospects and Challenges <s> Generalization <s> In this study, a further extension of the vehicle routing problem with pickup and delivery (VRPPD) is considered. The VRPPD problem is seen in many practical applications as logistic, distribution and transportation. However, a formal definition of the VRPPD cannot fully represent the real-life daily macro routing problem. For this reason, firstly, a new model of the very close to real-life problem is defined. Secondly, a novel heuristic algorithm with a new objective function is proposed to solve the daily macro routing problem. The proposed nature-inspired algorithm called as Heuristic Bubble Algorithm (HBA) is suitable for the proposed problem because of its particular new operators and fast response. The Matlab simulation results motivate that the proposed model and HBA is capable of solving real-life macro routing problems. <s> BIB002 </s> A Survey of League Championship Algorithm: Prospects and Challenges <s> Generalization <s> We consider a dynamic offloading problem arising in the context of mobile cloud computing (MCC). In MCC, three types of tasks can be identified: (i) those which can be processed only locally in a mobile device, (ii) those which are processed in the cloud, and (iii) those which can be processed either in the mobile or in the cloud. For type (iii) tasks, it is of interest to consider when they should be processed locally and when in the cloud. Furthermore, for both type (ii) and (iii) tasks, there may be several ways to access the cloud (e.g., via a costly cellular connection, or via intermittently available WLAN hotspots). The optimal strategy involves multi-dimensional considerations such as the availability of WLAN hotspots, energy consumption, communication costs and the expected delays. We approach this challenging problem in the framework of Markov decision processes and derive a near-optimal offloading policy. <s> BIB003 </s> A Survey of League Championship Algorithm: Prospects and Challenges <s> Generalization <s> Recent researches have shown that grid resources can be accessed by client on-demand, with the help of virtualization technology in the Cloud. The virtual machines hosted by the hypervisors are being utilized to build the grid network within the cloud environment. The aim of this study is to survey some concepts used for the on-demand grid provisioning using Infrastructure as a Service Cloud and the taxonomy of its related components. This paper, discusses the different approaches for on-demand grid using infrastructural Cloud, the issues it tries to address and the implementation tools. The paper also, proposed an extended classification for the virtualization technology used and a new classification for the Grid-Cloud integration which was based on the architecture, communication flow and the user demand for the Grid resources. This survey, tools and taxonomies presented here will contribute as a guide in the design of future architectures for further researches. <s> BIB004
Generalization is a very important feature of any optimization algorithm and this also includes the LCA. Evaluating the LCA's generalization can be a complex task because of the diverse implementations. The complexity is correlated to that of evaluating the generalization ability of LCA system in general. It is not unusual to come BIB001 BIB002 , assignment problem BIB003 51 , resource allocation  and resource distribution BIB004 , etc.