Template design under demand uncertainty by integer linear local search

$63.37 plus tax (Refund Policy)

Buy Article:


Production planning under uncertain demands leads to optimization problems that are hard both to model and to solve. We describe an integer linear model for a template design problem under uncertainty, and investigate its solution by a general-purpose local search algorithm for integer linear programs. Several such algorithms have previously been proposed as tools for solving large combinatorial optimization problems, and ours is based on a recent Boolean Satisfiability algorithm. In experiments it was slower than other methods on small instances, but rapidly outstripped them as the problem size and number of templates increased. It also found near-optimal solutions to all instances much more quickly. A general-purpose local search algorithm provides a rapid and convenient way of finding high-quality solutions to complex production problems.

Keywords: Demand uncertainty; Integer linear local search; Template design

Document Type: Research Article

DOI: http://dx.doi.org/10.1080/00207540600621060

Affiliations: 1: Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland 2: Faculty of Computer Science, Izmir University of Economics, Izmir, Turkey

Publication date: November 15, 2006

More about this publication?
Related content

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more