Solving a multistage partial inspection problem using genetic algorithms
Journal Article
·
· International Journal of Production Research
- BATTELLE (PACIFIC NW LAB)
- Arizona State University
- Naval Postgraduate School
Traditionally, the multistage inspection problem has been formulated as consisting of a decision schedule where some manufacturing stages receive full inspection and the rest none. Dynamic programming and heuristic methods (like local search) are the most commonly used solution techniques. A highly constrained multistage inspection problem is presented where all stages must receive partial rectifying inspection and it is solved using a real-valued genetic algorithm. This solution technique can handle multiple objectives and quality constraints effectively.
- Research Organization:
- Pacific Northwest National Lab., Richland, WA (US)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- AC06-76RL01830
- OSTI ID:
- 15001694
- Report Number(s):
- PNNL-SA-36982; TRN: US200406%%185
- Journal Information:
- International Journal of Production Research, Vol. 40, Issue 8; Other Information: PBD: 1 Jan 2002
- Country of Publication:
- United States
- Language:
- English
Similar Records
A genetic algorithm for solving the unit commitment problem of a hydro-thermal power system
A parallel genetic algorithm for the set partitioning problem
Solution of the optimal plant location and sizing problem using simulated annealing and genetic algorithms
Journal Article
·
Mon Nov 01 00:00:00 EST 1999
· IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers)
·
OSTI ID:15001694
A parallel genetic algorithm for the set partitioning problem
Technical Report
·
Sun May 01 00:00:00 EDT 1994
·
OSTI ID:15001694
Solution of the optimal plant location and sizing problem using simulated annealing and genetic algorithms
Conference
·
Sun Dec 31 00:00:00 EST 1995
·
OSTI ID:15001694