Neighborhood search techniques for solving 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 Operations Research
Year:
2012

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
Dynamic Version of the Economic Lot Size Model

Management Science
An Ant Colony Optimization Approach for the Multi-Level Unconstrained Lot-Sizing Problem

HICSS '09 Proceedings of the 42nd Hawaii International Conference on System Sciences
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, several neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems are investigated. We introduce three indexes: distance, changing range, and changing level that have great influence on the searching efficacy of neighborhood search techniques. These insights can help develop more efficient heuristic algorithms. As a result, we have developed an iterated neighborhood search (INS) algorithm that is very simple but that demonstrates good performance when tested against 176 benchmark instances under different scales (small, medium, and large), with 25 instances having been updated with new best known solutions in the computing experiments.