Optimal directed hypergraph traversal with ant-colony optimisation

DOI10.1016/J.INS.2018.08.058zbMATH Open1441.90168OpenAlexW2888999101WikidataQ129269006 ScholiaQ129269006MaRDI QIDQ2200670FDOQ2200670

Authors: Marco Comuzzi 

Publication date: 22 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.08.058

Recommendations

• scientific article; zbMATH DE number 1222555
• Directed hypergraphs and applications
• Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
• scientific article; zbMATH DE number 4057024
• Directed hypergraphs: introduction and fundamental algorithms -- a survey

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Hypergraphs (05C65)

Cites Work

• Directed hypergraphs and applications
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Soundness of workflow nets: classification, decidability, and analysis
• Linear connectivity problems in directed hypergraphs
• Title not available (Why is that?)
• Directed hypergraphs: introduction and fundamental algorithms -- a survey

Cited In (1)

• Boosting the exploration of huge dynamic graphs

This page was built for publication: Optimal directed hypergraph traversal with ant-colony optimisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200670)