Imagen de Portada
Código QR

Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.

By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In orde...

Descripción completa

Publicado en:Scientific World Journal pp. 652061 - 652062
Autores principales: Yu, Zhang, Yang, Xiaomei
Formato: research Journal Article
Publicado: Wiley-Blackwell 2013
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=104121147&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 104121147
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        1537744X
        1BX5
      jtl: Scientific World Journal
      issn: 1537744X
      maglogo: N
    pubinfo:
      dt: 2013
      pid: 480
      pub: Wiley-Blackwell
      place: Malden, Massachusetts
    artinfo:
      ui:
        104121147
        104121147
        NLM24294135
        2012402087
        10.1155/2013/652061
        NLM24294135
        PMC3833294
        104121147
      ppf: 652061
      ppct: 1
      formats:
      tig:
        atl: Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.
      aug:
        au:
          Yu, Zhang
          Yang, Xiaomei
        affil: Computer Science and Technology School, Taiyuan University of Science & Technology, Taiyuan 030024, China.
      sug:
        subj:
          Algorithms
          Biotechnology Methods
          Management Information Systems
          Marketing Methods
          Animals
      ab: By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.
      pubtype: Academic Journal
      doctype:
        research
        Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N