EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search
  • New Ant System Algorithm by An...
  • More details
Cover Image

New Ant System Algorithm by Ant-Tabu Agents

Year of publication:
2002
Authors: Kaji, Taichi
Published in:
商学討究 (Shogaku Tokyu). - Department of Economics. - Vol. 53.2002, 2/3, p. 143-163
Publisher: Department of Economics
Subject: Ant System Algorithm | Traveling Salesman Problem | Multi Agents | Parallel Algothm | Meta-Heuristics | Tabu Search
Saved in:
  • More details
Extent:
application/pdf
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10010964379
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • Maximising store revenues using Tabu search for floor space optimisation

      Xu, Jiefeng, (2021)

    • GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem

      Guemri, Oualid, (2016)

    • New Tabu search heuristics for the dynamic facility layout problem

      McKendall, Alan R., (2012)

    • More ...
    Similar items by person
    • A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

      Kaji, Taichi, (1999)

    • A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclicgraphs

      Kaji, Taichi, (1999)

    • ヒューリスティック手法における解析と評価 = Experimental and theoretical analysis for heuristics

      Kaji, Taichi, (2006)

    • More ...
    A service of the
    zbw
    FAQ-Assistent (beta)
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...