Finding Effective Item Assignment Plans with Weighted Item Associations Using A Hybrid Genetic Algorithm

Abstract

By identifying useful relationships between massive datasets, association rule mining can provide new insights to decision-makers. Item assignment models based on association between items are used to place items in a retail or e-commerce environment to increase sales. However, existing models fail to combine these associations with item-specific information, such as profit and purchasing frequency. To find effective assignments with item-specific information, we propose a new hybrid genetic algorithm that incorporates a robust tabu search with a novel rectangular partially matched crossover, focusing on rectangular layouts. Interestingly, we show that our item assignment model is equivalent to popular quadratic assignment NP-hard problems. We show the effectiveness of the proposed algorithm, using benchmark instances from QAPLIB and synthetic databases that represent real-life retail situations, and compare our algorithm with other existing algorithms. We also show that the proposed crossover operator outperforms a few existing ones in both fitness values and search times. The experimental results show that not only does the proposed item assignment model generates a more profitable assignment plan than the other tested models based on association alone but it also obtains better solutions than the other tested algorithms.

Extended Maximal Covering Location and Vehicle Routing Problems in Designing Smartphone Waste Collection Channels: A Case Study of Yogyakarta Province, Indonesia

“…The method used in this research was the nearest neighbor and tabu search (NN-TS) method, where the results obtained from the nearest neighbor were used as input in the tabu search. It is important to note that the tabu search was initiated by approaching a local minimum and noting recent movements in a tabu list that forms an adaptive memory to explore better solutions, with its size indicating the degree of diversification and intensification [76]. The mathematical model was, however, first determined before the calculations, and this was based on several assumptions and limitations, which include the following: (1) the vehicle has enough capacity to accommodate smartphone waste; (2) the distance from location j(a) to j(b) is the same as the distance from location j(b) to j(a) due to symmetry; (3) collection activities to PCCs start from 08:00-16:00 WIB with a rest time of 1 h, and this means the planning time horizon for a day is 7 h; (4) one vehicle visits more than one PCC but each PCC is only visited by one vehicle; (5) the average vehicle speed is 45 km/h; (6) the loading time at a PCC is 10 min; (7) the unloading and administration time at the SCC is 30 min.…”

A Vibrational Signal Fault Diagnosis Rule Extraction Method Based on DST‐ACI Discriminant Criterion

“…en, the obtained knowledge can be put into industrial or commercial applications [10][11][12]. erefore, the two technologies have been widely used in many fields such as disease diagnosis, traffic management, weather forecasting, software testing, and commercial marketing [13][14][15][16][17][18][19].…”