Generating non-dominated solution sets for the bi-objective shortest path problems with the ACO and HUMANT algorithm

Additional Metadata
Keywords	Ant colony optimization; mulit-objective optimization; shortest paths problems; HUMANT algorithm; Ant Systems
Thesis Advisor	Hoogendoorn, Y.N.
Persistent URL	hdl.handle.net/2105/53584
Series	Econometrie
Organisation	Erasmus School of Economics
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Bosman, A.W. (2020, November 13). Generating non-dominated solution sets for the bi-objective shortest path problems with the ACO and HUMANT algorithm. Econometrie. Retrieved from http://hdl.handle.net/2105/53584

Publication