Skip to main content

Template design under demand uncertainty by integer linear local search

Buy Article:

$55.00 plus tax (Refund Policy)

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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

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

Document Type: Research Article

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: 2006-11-15

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect 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