A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems

Authors:
Yiyong Xiao;Ikou Kaku;Qiuhong Zhao;Renqian Zhang
Affiliations:
School of Reliability and System Engineering, Beihang University, Beijing 100191, China;Department of Management Science and Engineering, Akita Prefectural University, Yulihonjo, Akita 015-0055, Japan;School of Economics and Management, Beihang University, Beijing 100191, China;School of Economics and Management, Beihang University, Beijing 100191, China
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 7
Cited 0

Optimal lot-sizing algorithms for complex product structures

Operations Research
Variable neighborhood search

Computers and Operations Research
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems

Computers and Operations Research
A comparative study of heuristic algorithms on Economic Lot Scheduling Problem

Computers and Industrial Engineering
A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem

INFORMS Journal on Computing
Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

Computers & Mathematics with Applications
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an effective approach based on the variable neighborhood search (VNS) algorithm is presented to solve the uncapacitated multilevel lot-sizing (MLLS) problems with component commonality and multiple end-items. A neighborhood structure for the MLLS problem is defined, and two kinds of solution move policies, i.e., move at first improvement (MAFI) and move at best improvement (MABI), are used in the algorithm. A new rule called Setup shifting is developed to conduct a more efficient neighborhood search for the MLLS problems. Computational studies are carried out on two sets of benchmark problems. The experimental results show that the VNS algorithm is capable of solving MLLS problems with good optimality and high computational efficiency as well, outperforming most of the existing algorithms in comparison.