Search

The paper deals with assortment optimization when customers purchase products using a nonparametric choice model. Each customer is presented with a preference list and will buy an available highest‐ranked offered product on the preference list. The paper presents a novel bi‐objective integer programming model for assortment optimization following a ranking‐based consumer choice model. The objectives are maximizing the expected revenue and maximizing customer satisfaction. This problem is recognized as an NP‐hard problem. After developing the bi‐objective model, an improved version of the augmented ε$\varepsilon $‐constraint method is proposed to solve the problem and retrieve the Pareto‐optimal solutions. In each iteration, this algorithm solves a single‐objective linear integer programming sub‐problem. Our approach aims to obtain a complete set of Pareto‐optimal solutions. Finally, we present computational experiments on synthetic data. Several numerical illustrations are provided at the end to demonstrate the application of the proposed methodology. The computational results provide the decision‐makers with valuable information regarding the factors that mainly affect the solutions. [ABSTRACT FROM AUTHOR]

Data clustering is a popular analysis tool for data statistics in several fields including pattern recognition, data mining, machine learning, image analysis and bioinformatics, in which the information to be analyzed can be of any distribution in size and shape. Clustering is effective as a technique for discerning the structure and unraveling the complex relationship between massive amounts of data. See-See partridge chick's optimization (SSPCO) algorithm is a new optimization algorithm that is inspired by the behavior of a type of bird called seesee partridge. We propose chaotic map SSPCO optimization method for clustering, which uses a chaotic map to adopt a random sequence with a random starting point as a parameter; the method relies on this parameter to update the positions and velocities of the chicks. In this study, twelve different clustering algorithms were compared on thirteen data sets. The results indicate that the performance of the Chaotic SSPCO method is significantly better than the performance of the other algorithms for data clustering problems. [ABSTRACT FROM AUTHOR]