Teaching–Learning Based Optimization (TLBO) with Variable Neighborhood Search to Retail Shelf-Space Allocation
نویسندگان
چکیده
منابع مشابه
Joint Optimization of Product Price, Display Orientation and Shelf-Space Allocation in Retail Category Management*
We develop a model that jointly optimizes a retailer’s decisions for product prices, display facing areas, display orientations and shelf-space locations in a product category. Unlike the existing shelf-space allocation models that typically consider only the width of display shelves, our model considers both the width and height of each shelf, allowing products to be stacked. Furthermore, as d...
متن کاملoptimization of high-performance concrete structures by variable neighborhood search
this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...
متن کاملVariable Neighborhood Search for Robust Optimization and Applications to Aerodynamics
Many real-life applications lead to the definition of robust optimization problems where the objective function is a black box. This may be due, for example, to the fact that the objective function is evaluated through computer simulations, and that some parameters are uncertain. When this is the case, existing algorithms for optimization are not able to provide good-quality solutions in genera...
متن کاملa simulation-optimization approach for replenishment planning and shelf space allocation in retail industry under zone- and stock-dependent demand
asimulation-optimization approach is proposed for replenishment planning andshelf space allocation. the customers’ demand is divided into fixed andvariable demand. each customer follows a given path while shopping in thestore. by dividing the store space into several zones and calculating therelated substantial and random utilities, an analytical equation is proposedfor the probability of zone ...
متن کاملVariable neighborhood search for minimum cost berth allocation
The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8081296