Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
MODIFIED SIMULATED ANNEALING ALGORITHMS FOR THE FLOW-SHOP SEQUENCING PROBLEM
Autore:
ISHIBUCHI H; MISAKI S; TANAKA H;
Indirizzi:
UNIV OSAKA PREFECTURE,DEPT IND ENGN,GAKUENCHO 1-1 SAKAI OSAKA 593 JAPAN
Titolo Testata:
European journal of operational research
fascicolo: 2, volume: 81, anno: 1995,
pagine: 388 - 398
SICI:
0377-2217(1995)81:2<388:MSAAFT>2.0.ZU;2-I
Fonte:
ISI
Lingua:
ENG
Keywords:
SIMULATED ANNEALING; GENERATION MECHANISM; FLOW SHOP SEQUENCING; COMBINATORIAL OPTIMIZATION;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Physical, Chemical & Earth Sciences
CompuMath Citation Index
Citazioni:
16
Recensione:
Indirizzi per estratti:
Citazione:
H. Ishibuchi et al., "MODIFIED SIMULATED ANNEALING ALGORITHMS FOR THE FLOW-SHOP SEQUENCING PROBLEM", European journal of operational research, 81(2), 1995, pp. 388-398

Abstract

In this paper, two simulated annealing algorithms with a modified generation mechanism are proposed and applied to the m-machine and n-job flow shop sequencing problem with the objective of minimizing the makespan. The generation mechanism is modified in order to obtain robust performance with respect to the choice of a cooling schedule. By computer simulations on randomly generated test problems, it is shown that the performance of the proposed algorithms is less sensitive to the choice of a cooling schedule than that of the standard simulated annealing algorithm. The proposed algorithms are also compared with other heuristics such as two multi-start descent algorithms, two taboo search algorithms and a random sampling technique.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 21/09/20 alle ore 15:50:36