Applications of Modern Heuristic Search Methods to

Applications of Modern Heuristic Search Methods to (1999)

by Pattern Sequencing Problems , Andreas Fink , Stefan Voß

Venue:

Computers & Operations Research

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Applications of Modern Heuristic Search Methods to	user correction - Legacy Corrections
AUTHOR NAME	Pattern Sequencing Problems	user correction - Legacy Corrections
AUTHOR NAME	Andreas Fink	user correction - Legacy Corrections
AUTHOR NAME	Stefan Voß	user correction - Legacy Corrections
ABSTRACT	This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with respect to some given objective function. We consider two di#erent objectives: Minimization of the number of simultaneously open stacks and minimization of the average order spread. Both objectives require the adaptive evaluation of changed solutions to allow an e#cient application of neighbourhood search techniques.	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	Computers & Operations Research	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	17--34	INFERENCE
VOLUME	26	INFERENCE
CITATIONS	19 found	ParsCit 1.0