[ { "key": "UKSID2F6", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/UKSID2F6", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/UKSID2F6", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Dorigo et al.", "parsedDate": "1991", "numChildren": 0 }, "data": { "key": "UKSID2F6", "version": 3, "itemType": "newspaperArticle", "title": "Positive feedback as a research strategy", "creators": [ { "creatorType": "author", "firstName": "Marco", "lastName": "Dorigo" }, { "creatorType": "author", "firstName": "Vittorio", "lastName": "Maniezo" }, { "creatorType": "author", "firstName": "Alberto", "lastName": "Colorni" } ], "abstractNote": "", "publicationTitle": "", "publisher": "", "place": "", "date": "1991", "volume": "", "issue": "", "edition": "", "section": "", "pages": "", "ISSN": "", "DOI": "", "citationKey": "", "url": "", "accessDate": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-29T09:26:51Z", "dateModified": "2014-01-29T09:28:14Z" } }, { "key": "EA3MHM6X", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/EA3MHM6X", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/EA3MHM6X", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Dorigo et al.", "parsedDate": "1999", "numChildren": 0 }, "data": { "key": "EA3MHM6X", "version": 3, "itemType": "journalArticle", "title": "Ant Algorithms for Discrete Optimization", "creators": [ { "creatorType": "author", "firstName": "Marco", "lastName": "Dorigo" }, { "creatorType": "author", "firstName": "Gianni", "lastName": "Di Caro" }, { "creatorType": "author", "firstName": "Luca M.", "lastName": "Gambardella" } ], "abstractNote": "", "publicationTitle": "Artif. Life", "publisher": "", "place": "", "date": "avril 1999", "volume": "5", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "137–172", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1162/106454699568728", "citationKey": "", "url": "http://dx.doi.org/10.1162/106454699568728", "accessDate": "2014-01-12T20:52:38Z", "PMID": "", "PMCID": "", "ISSN": "1064-5462", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ACM Digital Library", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Ant Algorithms", "type": 1 }, { "tag": "Ant colony optimization", "type": 1 }, { "tag": "metaheuristics", "type": 1 }, { "tag": "natural computation", "type": 1 }, { "tag": "swarm intelligence", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-12T20:52:38Z", "dateModified": "2014-01-12T20:52:38Z" } }, { "key": "9EX4AZ74", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/9EX4AZ74", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/9EX4AZ74", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Dorigo and Gambardella", "parsedDate": "1997", "numChildren": 0 }, "data": { "key": "9EX4AZ74", "version": 3, "itemType": "journalArticle", "title": "Ant colony system: a cooperative learning approach to the traveling salesman problem", "creators": [ { "creatorType": "author", "firstName": "M.", "lastName": "Dorigo" }, { "creatorType": "author", "firstName": "L.M.", "lastName": "Gambardella" } ], "abstractNote": "This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs", "publicationTitle": "IEEE Transactions on Evolutionary Computation", "publisher": "", "place": "", "date": "1997", "volume": "1", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "53-66", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1109/4235.585892", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "1089-778X", "archive": "", "archiveLocation": "", "shortTitle": "Ant colony system", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "ACS-3-opt", "type": 1 }, { "tag": "Ant colony optimization", "type": 1 }, { "tag": "Computational modeling", "type": 1 }, { "tag": "Global communication", "type": 1 }, { "tag": "Helium", "type": 1 }, { "tag": "Legged locomotion", "type": 1 }, { "tag": "Simulated Annealing", "type": 1 }, { "tag": "Traveling salesman problem", "type": 1 }, { "tag": "Traveling salesman problems", "type": 1 }, { "tag": "ant colony system", "type": 1 }, { "tag": "cooperating agents", "type": 1 }, { "tag": "cooperative learning approach", "type": 1 }, { "tag": "cooperative systems", "type": 1 }, { "tag": "distributed algorithm", "type": 1 }, { "tag": "distributed algorithms", "type": 1 }, { "tag": "evolutionary computation", "type": 1 }, { "tag": "feedback", "type": 1 }, { "tag": "learning (artificial intelligence)", "type": 1 }, { "tag": "local search procedure", "type": 1 }, { "tag": "nature-inspired algorithms", "type": 1 }, { "tag": "pheromone", "type": 1 }, { "tag": "search problems", "type": 1 }, { "tag": "travelling salesman problems", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-12T20:51:29Z", "dateModified": "2014-01-12T20:51:29Z" } }, { "key": "HCK6J68I", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/HCK6J68I", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/HCK6J68I", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Dorigo et al.", "parsedDate": "1996", "numChildren": 0 }, "data": { "key": "HCK6J68I", "version": 3, "itemType": "journalArticle", "title": "Ant system: optimization by a colony of cooperating agents", "creators": [ { "creatorType": "author", "firstName": "M.", "lastName": "Dorigo" }, { "creatorType": "author", "firstName": "V.", "lastName": "Maniezzo" }, { "creatorType": "author", "firstName": "A.", "lastName": "Colorni" } ], "abstractNote": "An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical traveling salesman problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling. Finally we discuss the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS", "publicationTitle": "IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics", "publisher": "", "place": "", "date": "1996", "volume": "26", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "29-41", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1109/3477.484436", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "1083-4419", "archive": "", "archiveLocation": "", "shortTitle": "Ant system", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Ant colony optimization", "type": 1 }, { "tag": "Computational modeling", "type": 1 }, { "tag": "Data Structures", "type": 1 }, { "tag": "Distributed computing", "type": 1 }, { "tag": "Intelligent robots", "type": 1 }, { "tag": "Optimisation", "type": 1 }, { "tag": "Optimization", "type": 1 }, { "tag": "Robustness", "type": 1 }, { "tag": "Simulated Annealing", "type": 1 }, { "tag": "Stochastic Programming", "type": 1 }, { "tag": "Traveling salesman problem", "type": 1 }, { "tag": "Traveling salesman problems", "type": 1 }, { "tag": "ant colonies", "type": 1 }, { "tag": "ant system", "type": 1 }, { "tag": "artificial intelligence", "type": 1 }, { "tag": "computational paradigm", "type": 1 }, { "tag": "constructive greedy heuristic", "type": 1 }, { "tag": "cooperating agents", "type": 1 }, { "tag": "distributed communication", "type": 1 }, { "tag": "distributed computation", "type": 1 }, { "tag": "feedback", "type": 1 }, { "tag": "global data structure revision", "type": 1 }, { "tag": "job-shop scheduling", "type": 1 }, { "tag": "parameter selection", "type": 1 }, { "tag": "positive feedback", "type": 1 }, { "tag": "probabilistic transitions", "type": 1 }, { "tag": "quadratic assignment", "type": 1 }, { "tag": "robust control", "type": 1 }, { "tag": "search problems", "type": 1 }, { "tag": "stochastic combinatorial optimization", "type": 1 }, { "tag": "tabu search", "type": 1 }, { "tag": "travelling salesman problems", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-12T20:51:12Z", "dateModified": "2014-01-12T20:51:12Z" } }, { "key": "EUVF46NT", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/EUVF46NT", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/EUVF46NT", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Stützle and Hoos", "parsedDate": "1999-01-01", "numChildren": 0 }, "data": { "key": "EUVF46NT", "version": 3, "itemType": "bookSection", "title": "The Max-Min ANT System and Local Search for Combinatorial Optimization Problems", "creators": [ { "creatorType": "author", "firstName": "Thomas", "lastName": "Stützle" }, { "creatorType": "author", "firstName": "Holger", "lastName": "Hoos" }, { "creatorType": "editor", "firstName": "Stefan", "lastName": "Voß" }, { "creatorType": "editor", "firstName": "Silvano", "lastName": "Martello" }, { "creatorType": "editor", "firstName": "Ibrahim H.", "lastName": "Osman" }, { "creatorType": "editor", "firstName": "Catherine", "lastName": "Roucairol" } ], "abstractNote": "In this paper we present an extension of the MAX−MIN\\mathcal{M}\\mathcal{A}\\mathcal{X} - \\mathcal{M}\\mathcal{I}\\mathcal{N} Ant System and apply it to Traveling Salesman Problems and Quadratic Assignment Problems. The extension involves the use of a modified choice rule and a hybrid scheme allowing ants to improve their solution by local search. The computational results show that this algorithm can be used to efficiently find near-optimal solutions to hard combinatorial optimization problems and that it is one of the best methods for the solution of structured quadratic assignment problems.", "bookTitle": "Meta-Heuristics", "series": "", "seriesNumber": "", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999/01/01", "publisher": "Springer US", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "313-329", "ISBN": "978-1-4613-7646-0, 978-1-4615-5775-3", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/978-1-4615-5775-3_22", "accessDate": "2014-01-09T14:57:26Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1999 Kluwer Academic Publishers", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Mathematical Modeling and Industrial Mathematics", "type": 1 }, { "tag": "Operation Research/Decision Theory", "type": 1 }, { "tag": "Optimization", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:57:26Z", "dateModified": "2014-01-09T14:57:26Z" } }, { "key": "JKUDJHCX", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/JKUDJHCX", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/JKUDJHCX", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Talbi et al.", "parsedDate": "1999-01-01", "numChildren": 0 }, "data": { "key": "JKUDJHCX", "version": 3, "itemType": "bookSection", "title": "Parallel ant colonies for combinatorial optimization problems", "creators": [ { "creatorType": "author", "firstName": "El-ghazali", "lastName": "Talbi" }, { "creatorType": "author", "firstName": "Olivier", "lastName": "Roux" }, { "creatorType": "author", "firstName": "Cyril", "lastName": "Fonlupt" }, { "creatorType": "author", "firstName": "Denis", "lastName": "Robillard" }, { "creatorType": "editor", "firstName": "José", "lastName": "Rolim" }, { "creatorType": "editor", "firstName": "Frank", "lastName": "Mueller" }, { "creatorType": "editor", "firstName": "Albert Y.", "lastName": "Zomaya" }, { "creatorType": "editor", "firstName": "Fikret", "lastName": "Ercal" }, { "creatorType": "editor", "firstName": "Stephan", "lastName": "Olariu" }, { "creatorType": "editor", "firstName": "Binoy", "lastName": "Ravindran" }, { "creatorType": "editor", "firstName": "Jan", "lastName": "Gustafsson" }, { "creatorType": "editor", "firstName": "Hiroaki", "lastName": "Takada" }, { "creatorType": "editor", "firstName": "Ron", "lastName": "Olsson" }, { "creatorType": "editor", "firstName": "Laxmikant V.", "lastName": "Kale" }, { "creatorType": "editor", "firstName": "Pete", "lastName": "Beckman" }, { "creatorType": "editor", "firstName": "Matthew", "lastName": "Haines" }, { "creatorType": "editor", "firstName": "Hossam", "lastName": "ElGindy" }, { "creatorType": "editor", "firstName": "Denis", "lastName": "Caromel" }, { "creatorType": "editor", "firstName": "Serge", "lastName": "Chaumette" }, { "creatorType": "editor", "firstName": "Geoffrey", "lastName": "Fox" }, { "creatorType": "editor", "firstName": "Yi", "lastName": "Pan" }, { "creatorType": "editor", "firstName": "Keqin", "lastName": "Li" }, { "creatorType": "editor", "firstName": "Tao", "lastName": "Yang" }, { "creatorType": "editor", "firstName": "G.", "lastName": "Chiola" }, { "creatorType": "editor", "firstName": "G.", "lastName": "Conte" }, { "creatorType": "editor", "firstName": "L. V.", "lastName": "Mancini" }, { "creatorType": "editor", "firstName": "Domenique", "lastName": "Méry" }, { "creatorType": "editor", "firstName": "Beverly", "lastName": "Sanders" }, { "creatorType": "editor", "firstName": "Devesh", "lastName": "Bhatt" }, { "creatorType": "editor", "firstName": "Viktor", "lastName": "Prasanna" } ], "abstractNote": "Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is feasible to solve large optimization problems.", "bookTitle": "Parallel and Distributed Processing", "series": "Lecture Notes in Computer Science", "seriesNumber": "1586", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "239-247", "ISBN": "978-3-540-65831-3, 978-3-540-48932-0", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/BFb0097905", "accessDate": "2014-01-09T14:57:22Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1999 Springer-Verlag", "extra": "", "tags": [ { "tag": "Computer Hardware", "type": 1 }, { "tag": "Computer Systems Organization and Communication Networks", "type": 1 }, { "tag": "Discrete Mathematics in Computer Science", "type": 1 }, { "tag": "Software Engineering/Programming and Operating Systems", "type": 1 }, { "tag": "Theory of Computation", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:57:22Z", "dateModified": "2014-01-09T14:57:22Z" } }, { "key": "PUIFQERP", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/PUIFQERP", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/PUIFQERP", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Jennings and Arvidsson", "parsedDate": "1999-01-01", "numChildren": 0 }, "data": { "key": "PUIFQERP", "version": 3, "itemType": "bookSection", "title": "Co-operating Market/Ant Based Multi-agent Systems for Intelligent Network Load Control", "creators": [ { "creatorType": "author", "firstName": "Brendan", "lastName": "Jennings" }, { "creatorType": "author", "firstName": "Åke", "lastName": "Arvidsson" }, { "creatorType": "editor", "firstName": "Sahin", "lastName": "Albayrak" } ], "abstractNote": "Recent years have seen increases in the number, complexity and usage of telecommunications services, many of which are realised by systems based on the Intelligent Network (IN) architecture. As the volume of traffic carried by INs has increased there has been a realisation that flexible and efficient load control strategies are required to ensure that Quality-of-Service levels meet desired targets. In this paper we present an agent-based IN load control strategy, realised by two co-operating multi-agent systems making use of Market-based Control and Ant Colony Optimisation paradigms respectively.", "bookTitle": "Intelligent Agents for Telecommunication Applications", "series": "Lecture Notes in Computer Science", "seriesNumber": "1699", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "62-75", "ISBN": "978-3-540-66539-7, 978-3-540-48165-2", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-48165-6_5", "accessDate": "2014-01-09T14:57:19Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1999 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Communications Engineering, Networks", "type": 1 }, { "tag": "Computer Communication Networks", "type": 1 }, { "tag": "Information Systems Applications (incl.Internet)", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:57:19Z", "dateModified": "2014-01-09T14:57:19Z" } }, { "key": "8ACRMTEC", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/8ACRMTEC", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/8ACRMTEC", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Burke and Kendall", "parsedDate": "1999-01-01", "numChildren": 0 }, "data": { "key": "8ACRMTEC", "version": 3, "itemType": "bookSection", "title": "Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem", "creators": [ { "creatorType": "author", "firstName": "Edmund", "lastName": "Burke" }, { "creatorType": "author", "firstName": "Graham", "lastName": "Kendall" }, { "creatorType": "editor", "firstName": "Norman", "lastName": "Foo" } ], "abstractNote": "In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant algorithm) is developed and the results from this algorithm are compared against SA, TS and GA We discuss the ideas behind ant algorithms and describe how they have been implemented with regards to the nesting problem. The evaluation method used is described, as is the NFP. Computational results are given.", "bookTitle": "Advanced Topics in Artificial Intelligence", "series": "Lecture Notes in Computer Science", "seriesNumber": "1747", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "453-464", "ISBN": "978-3-540-66822-0, 978-3-540-46695-6", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-46695-9_38", "accessDate": "2014-01-09T14:57:15Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1999 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Ant Algorithms", "type": 1 }, { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "No Fit Polygon", "type": 1 }, { "tag": "Simulated Annealing", "type": 1 }, { "tag": "genetic algorithm", "type": 1 }, { "tag": "search", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:57:15Z", "dateModified": "2014-01-09T14:57:15Z" } }, { "key": "Z794NH3P", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/Z794NH3P", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/Z794NH3P", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Besten et al.", "parsedDate": "2000-01-01", "numChildren": 0 }, "data": { "key": "Z794NH3P", "version": 3, "itemType": "bookSection", "title": "Ant Colony Optimization for the Total Weighted Tardiness Problem", "creators": [ { "creatorType": "author", "firstName": "Matthijs den", "lastName": "Besten" }, { "creatorType": "author", "firstName": "Thomas", "lastName": "Stützle" }, { "creatorType": "author", "firstName": "Marco", "lastName": "Dorigo" }, { "creatorType": "editor", "firstName": "Marc", "lastName": "Schoenauer" }, { "creatorType": "editor", "firstName": "Kalyanmoy", "lastName": "Deb" }, { "creatorType": "editor", "firstName": "Günther", "lastName": "Rudolph" }, { "creatorType": "editor", "firstName": "Xin", "lastName": "Yao" }, { "creatorType": "editor", "firstName": "Evelyne", "lastName": "Lutton" }, { "creatorType": "editor", "firstName": "Juan Julian", "lastName": "Merelo" }, { "creatorType": "editor", "firstName": "Hans-Paul", "lastName": "Schwefel" } ], "abstractNote": "In this article we present an application of the Ant Colony Optimization (ACO) metaheuristic to the single machine total weighted tardiness problem. First, we briefly discuss the constructive phase of ACO in which a colony of artificial ants generates a set of feasible solutions. Then, we introduce some simple but very effective local search. Last, we combine the constructive phase with local search obtaining a novel ACO algorithm that uses a heterogeneous colony of ants and is highly effective in finding the best-known solutions on all instances of a widely used set of benchmark problems.", "bookTitle": "Parallel Problem Solving from Nature PPSN VI", "series": "Lecture Notes in Computer Science", "seriesNumber": "1917", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2000/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "611-620", "ISBN": "978-3-540-41056-0, 978-3-540-45356-7", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-45356-3_60", "accessDate": "2014-01-09T14:57:08Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2000 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Algorithm Analysis and Problem Complexity", "type": 1 }, { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Computation by Abstract Devices", "type": 1 }, { "tag": "Computer Appl. in Life Sciences", "type": 1 }, { "tag": "Programming Techniques", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:57:08Z", "dateModified": "2014-01-09T14:57:08Z" } }, { "key": "P57JH2VK", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/P57JH2VK", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/P57JH2VK", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Coello et al.", "parsedDate": "2000-01-01", "numChildren": 0 }, "data": { "key": "P57JH2VK", "version": 3, "itemType": "bookSection", "title": "Ant Colony System for the Design of Combinational Logic Circuits", "creators": [ { "creatorType": "author", "firstName": "Carlos A. Coello", "lastName": "Coello" }, { "creatorType": "author", "firstName": "Rosa Laura G.", "lastName": "Zavala" }, { "creatorType": "author", "firstName": "Benito Mendoza", "lastName": "García" }, { "creatorType": "author", "firstName": "Arturo Hernández", "lastName": "Aguirre" }, { "creatorType": "editor", "firstName": "Julian", "lastName": "Miller" }, { "creatorType": "editor", "firstName": "Adrian", "lastName": "Thompson" }, { "creatorType": "editor", "firstName": "Peter", "lastName": "Thomson" }, { "creatorType": "editor", "firstName": "Terence C.", "lastName": "Fogarty" } ], "abstractNote": "In this paper we propose an application of the Ant System (AS) to optimize combinational logic circuits at the gate level. We define a measure of quality improvement in partially built circuits to compute the distances required by the AS and we consider as optimal those solutions that represent functional circuits with a minimum amount of gates. The proposed methodology is described together with some examples taken from the literature that illustrate the feasibility of the approach.", "bookTitle": "Evolvable Systems: From Biology to Hardware", "series": "Lecture Notes in Computer Science", "seriesNumber": "1801", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2000/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "21-30", "ISBN": "978-3-540-67338-5, 978-3-540-46406-8", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-46406-9_3", "accessDate": "2014-01-09T14:57:05Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2000 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Computation by Abstract Devices", "type": 1 }, { "tag": "Computer Appl. in Life Sciences", "type": 1 }, { "tag": "Computer Hardware", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:57:05Z", "dateModified": "2014-01-09T14:57:05Z" } }, { "key": "GRA7HDEJ", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/GRA7HDEJ", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/GRA7HDEJ", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Irving et al.", "parsedDate": "1999-01-01", "numChildren": 0 }, "data": { "key": "GRA7HDEJ", "version": 3, "itemType": "bookSection", "title": "Transmission Network Planing Using Genetic Algorithms", "creators": [ { "creatorType": "author", "firstName": "M. R.", "lastName": "Irving" }, { "creatorType": "author", "firstName": "H. M.", "lastName": "Chebbo" }, { "creatorType": "author", "firstName": "S. O.", "lastName": "Orero" }, { "creatorType": "editor", "firstName": "Professor Yong-Hua", "lastName": "Song" } ], "abstractNote": "There has recently been considerable interest in Genetic Algorithms, and other evolutionary techniques, among researchers in various application fields. The simplicity, flexibility and robustness of such algorithms has opened up new areas of application, and has also encouraged a re-appraisal of some traditional problems that were either very difficult or even intractable for traditional optimisation techniques.", "bookTitle": "Modern Optimisation Techniques in Power Systems", "series": "International Series on Microprocessor-Based and Intelligent Systems Engineering", "seriesNumber": "20", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999/01/01", "publisher": "Springer Netherlands", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "91-111", "ISBN": "978-90-481-5216-2, 978-94-015-9189-8", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/978-94-015-9189-8_5", "accessDate": "2014-01-09T14:55:57Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1999 Springer Science+Business Media B.V.", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Electrical Engineering", "type": 1 }, { "tag": "Mathematical Modeling and Industrial Mathematics", "type": 1 }, { "tag": "Optimization", "type": 1 }, { "tag": "Systems Theory, Control", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:55:57Z", "dateModified": "2014-01-09T14:55:57Z" } }, { "key": "5NC2PG9A", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/5NC2PG9A", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/5NC2PG9A", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Merkle and Middendorf", "parsedDate": "2000-01-01", "numChildren": 0 }, "data": { "key": "5NC2PG9A", "version": 3, "itemType": "bookSection", "title": "An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems", "creators": [ { "creatorType": "author", "firstName": "Daniel", "lastName": "Merkle" }, { "creatorType": "author", "firstName": "Martin", "lastName": "Middendorf" }, { "creatorType": "editor", "firstName": "Stefano", "lastName": "Cagnoni" } ], "abstractNote": "Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness Problem. Compared to an existing ACO algorithm for the unweighted Total Tardiness Problem our algorithm has several improvements. The main novelty is that in our algorithm the ants are guided on their way to good solutions by sums of pheromone values. This allows the ants to take into account pheromone values that have already been used for making earlier decisions.", "bookTitle": "Real-World Applications of Evolutionary Computing", "series": "Lecture Notes in Computer Science", "seriesNumber": "1803", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2000/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "290-299", "ISBN": "978-3-540-67353-8, 978-3-540-45561-5", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-45561-2_28", "accessDate": "2014-01-09T14:55:53Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2000 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Algorithm Analysis and Problem Complexity", "type": 1 }, { "tag": "Computer Communication Networks", "type": 1 }, { "tag": "Image Processing and Computer Vision", "type": 1 }, { "tag": "Systems and Information Theory in Engineering", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:55:53Z", "dateModified": "2014-01-09T14:55:53Z" } }, { "key": "AZZJZ9PQ", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/AZZJZ9PQ", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/AZZJZ9PQ", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Michel and Middendorf", "parsedDate": "1998-01-01", "numChildren": 0 }, "data": { "key": "AZZJZ9PQ", "version": 3, "itemType": "bookSection", "title": "An island model based ant system with lookahead for the shortest supersequence problem", "creators": [ { "creatorType": "author", "firstName": "René", "lastName": "Michel" }, { "creatorType": "author", "firstName": "Martin", "lastName": "Middendorf" }, { "creatorType": "editor", "firstName": "Agoston E.", "lastName": "Eiben" }, { "creatorType": "editor", "firstName": "Thomas", "lastName": "Bäck" }, { "creatorType": "editor", "firstName": "Marc", "lastName": "Schoenauer" }, { "creatorType": "editor", "firstName": "Hans-Paul", "lastName": "Schwefel" } ], "abstractNote": "In this paper we introduce an Ant Colony Optimisation (ACO) algorithm for the Shortest Common Supersequence (SCS) problem, which has applications in production system planning, mechanical engineering and molecular biology. The ACO algorithm is used to find good parameters for a heuristic for the SCS problem. An island model with several populations of ants is used for the ACO algorithm. Besides we introduce a lookahead function which makes the decisions of the ants dependent on the state arrived after the decision.", "bookTitle": "Parallel Problem Solving from Nature — PPSN V", "series": "Lecture Notes in Computer Science", "seriesNumber": "1498", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1998/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "692-701", "ISBN": "978-3-540-65078-2, 978-3-540-49672-4", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/BFb0056911", "accessDate": "2014-01-09T14:55:01Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1998 Springer-Verlag", "extra": "", "tags": [ { "tag": "Algorithm Analysis and Problem Complexity", "type": 1 }, { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Computation by Abstract Devices", "type": 1 }, { "tag": "Processor Architectures", "type": 1 }, { "tag": "Programming Techniques", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:55:01Z", "dateModified": "2014-01-09T14:55:01Z" } }, { "key": "7B67MXHW", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/7B67MXHW", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/7B67MXHW", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Bonabeau et al.", "parsedDate": "1998-01-01", "numChildren": 0 }, "data": { "key": "7B67MXHW", "version": 3, "itemType": "bookSection", "title": "Routing in telecommunications networks with ant-like agents", "creators": [ { "creatorType": "author", "firstName": "Eric", "lastName": "Bonabeau" }, { "creatorType": "author", "firstName": "Florian", "lastName": "Henaux" }, { "creatorType": "author", "firstName": "Sylvain", "lastName": "Guérin" }, { "creatorType": "author", "firstName": "Dominique", "lastName": "Snyers" }, { "creatorType": "author", "firstName": "Pascale", "lastName": "Kuntz" }, { "creatorType": "author", "firstName": "Guy", "lastName": "Theraulaz" }, { "creatorType": "editor", "firstName": "Sahin", "lastName": "Albayrak" }, { "creatorType": "editor", "firstName": "Francisco J.", "lastName": "Garijo" } ], "abstractNote": "A simple mechanism is presented, based on ant-like agents, for routing and load balancing in telecommunications networks, following the initial works of Appleby and Stewart [1] and Schoonderwoerd et al. [32,33]. In the present work, agents are very similar to those proposed by Schoonderwoerd et al. [32,33], but are supplemented with the ability to perform more computations at switching nodes, which significantly improves the network's relaxation and its response to perturbations.", "bookTitle": "Intelligent Agents for Telecommunication Applications", "series": "Lecture Notes in Computer Science", "seriesNumber": "1437", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1998/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "60-71", "ISBN": "978-3-540-64720-1, 978-3-540-69102-0", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/BFb0053944", "accessDate": "2014-01-09T14:54:43Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1998 Springer-Verlag", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Communications Engineering, Networks", "type": 1 }, { "tag": "Computer Communication Networks", "type": 1 }, { "tag": "Information Systems Applications (incl.Internet)", "type": 1 }, { "tag": "Multimedia Information Systems", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:54:43Z", "dateModified": "2014-01-09T14:54:43Z" } }, { "key": "SPPGMA49", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/SPPGMA49", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/SPPGMA49", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Tong et al.", "parsedDate": "1999-01-01", "numChildren": 0 }, "data": { "key": "SPPGMA49", "version": 3, "itemType": "bookSection", "title": "Ant Colony Optimization for the Ship Berthing Problem", "creators": [ { "creatorType": "author", "firstName": "Chia Jim", "lastName": "Tong" }, { "creatorType": "author", "firstName": "Hoong Chuin", "lastName": "Lau" }, { "creatorType": "author", "firstName": "Andrew", "lastName": "Lim" }, { "creatorType": "editor", "firstName": "P. S.", "lastName": "Thiagarajan" }, { "creatorType": "editor", "firstName": "Roland", "lastName": "Yap" } ], "abstractNote": "Ant Colony Optimization (ACO) is a paradigm that em- ploys a set of cooperating agents to solve functions or obtain good so- lutions for combinatorial optimization problems. It has previously been applied to the TSP and QAP with encouraging results that demonstrate its potential. In this paper, we present FF-AS-SBP, an algorithm that applies ACO to the ship berthing problem (SBP), a generalization of the dynamic storage allocation problem (DSA), which is NP-complete. FF-AS-SBP is compared against a randomized first-fit algorithm. Ex- perimental results suggest that ACO can be applied effectively to find good solutions for SBPs, with mean costs of solutions obtained in the experiment on difficult (compact) cases ranging from 0% to 17% of opti- mum. By distributing the agents over multiple processors, applying local search methods, optimizing numerical parameters and varying the basic algorithm, performance could be further improved.", "bookTitle": "Advances in Computing Science — ASIAN’99", "series": "Lecture Notes in Computer Science", "seriesNumber": "1742", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "359-370", "ISBN": "978-3-540-66856-5, 978-3-540-46674-1", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-46674-6_30", "accessDate": "2014-01-09T14:54:35Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1999 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Computer Communication Networks", "type": 1 }, { "tag": "Logics and Meanings of Programs", "type": 1 }, { "tag": "Mathematical Logic and Formal Languages", "type": 1 }, { "tag": "Programming Languages, Compilers, Interpreters", "type": 1 }, { "tag": "Special Purpose and Application-Based Systems", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:54:35Z", "dateModified": "2014-01-09T14:54:35Z" } }, { "key": "X58EJ6DP", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/X58EJ6DP", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/X58EJ6DP", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Stützle", "parsedDate": "1998-01-01", "numChildren": 0 }, "data": { "key": "X58EJ6DP", "version": 3, "itemType": "bookSection", "title": "Parallelization strategies for Ant Colony Optimization", "creators": [ { "creatorType": "author", "firstName": "Thomas", "lastName": "Stützle" }, { "creatorType": "editor", "firstName": "Agoston E.", "lastName": "Eiben" }, { "creatorType": "editor", "firstName": "Thomas", "lastName": "Bäck" }, { "creatorType": "editor", "firstName": "Marc", "lastName": "Schoenauer" }, { "creatorType": "editor", "firstName": "Hans-Paul", "lastName": "Schwefel" } ], "abstractNote": "Ant Colony Optimization (ACO) is a new population oriented search metaphor that has been successfully applied to NP-hard combinatorial optimization problems. In this paper we discuss parallelization strategies for Ant Colony Optimization algorithms. We empirically test the most simple strategy, that of executing parallel independent runs of an algorithm. The empirical tests are performed applying MAX-MIN Ant System, one of the most efficient ACO algorithms, to the Traveling Salesman Problem and show that using parallel independent runs is very effective.", "bookTitle": "Parallel Problem Solving from Nature — PPSN V", "series": "Lecture Notes in Computer Science", "seriesNumber": "1498", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1998/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "722-731", "ISBN": "978-3-540-65078-2, 978-3-540-49672-4", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/BFb0056914", "accessDate": "2014-01-09T14:54:00Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1998 Springer-Verlag", "extra": "", "tags": [ { "tag": "Algorithm Analysis and Problem Complexity", "type": 1 }, { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Computation by Abstract Devices", "type": 1 }, { "tag": "Processor Architectures", "type": 1 }, { "tag": "Programming Techniques", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:54:00Z", "dateModified": "2014-01-09T14:54:00Z" } }, { "key": "FVWN7UDQ", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/FVWN7UDQ", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/FVWN7UDQ", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Caro and Dorigo", "parsedDate": "1998-01-01", "numChildren": 0 }, "data": { "key": "FVWN7UDQ", "version": 3, "itemType": "bookSection", "title": "Ant colonies for adaptive routing in packet-switched communications networks", "creators": [ { "creatorType": "author", "firstName": "Gianni Di", "lastName": "Caro" }, { "creatorType": "author", "firstName": "Marco", "lastName": "Dorigo" }, { "creatorType": "editor", "firstName": "Agoston E.", "lastName": "Eiben" }, { "creatorType": "editor", "firstName": "Thomas", "lastName": "Bäck" }, { "creatorType": "editor", "firstName": "Marc", "lastName": "Schoenauer" }, { "creatorType": "editor", "firstName": "Hans-Paul", "lastName": "Schwefel" } ], "abstractNote": "In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of communication observed in ant colonies. We present compelling evidence that AntNet, when measuring performance by standard measures such as network throughput and average packet delay, outperforms the current Internet routing algorithm (OSPF), some old Internet routing algorithms (SPF and distributed adaptive Bellman-Ford), and recently proposed forms of asynchronous online Bellman-Ford (Q-routing and Predictive Q-routing).", "bookTitle": "Parallel Problem Solving from Nature — PPSN V", "series": "Lecture Notes in Computer Science", "seriesNumber": "1498", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1998/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "673-682", "ISBN": "978-3-540-65078-2, 978-3-540-49672-4", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/BFb0056909", "accessDate": "2014-01-09T14:53:55Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©1998 Springer-Verlag", "extra": "", "tags": [ { "tag": "Algorithm Analysis and Problem Complexity", "type": 1 }, { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Computation by Abstract Devices", "type": 1 }, { "tag": "Processor Architectures", "type": 1 }, { "tag": "Programming Techniques", "type": 1 } ], "collections": [ "EF2KZ9GN" ], "relations": {}, "dateAdded": "2014-01-09T14:53:55Z", "dateModified": "2014-01-09T14:53:55Z" } }, { "key": "4IMSV2FM", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/4IMSV2FM", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/4IMSV2FM", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Burke et al.", "parsedDate": "2003-01-01", "numChildren": 0 }, "data": { "key": "4IMSV2FM", "version": 3, "itemType": "bookSection", "title": "Hyper-Heuristics: An Emerging Direction in Modern Search Technology", "creators": [ { "creatorType": "author", "firstName": "Edmund", "lastName": "Burke" }, { "creatorType": "author", "firstName": "Graham", "lastName": "Kendall" }, { "creatorType": "author", "firstName": "Jim", "lastName": "Newall" }, { "creatorType": "author", "firstName": "Emma", "lastName": "Hart" }, { "creatorType": "author", "firstName": "Peter", "lastName": "Ross" }, { "creatorType": "author", "firstName": "Sonia", "lastName": "Schulenburg" }, { "creatorType": "editor", "firstName": "Fred", "lastName": "Glover" }, { "creatorType": "editor", "firstName": "Gary A.", "lastName": "Kochenberger" } ], "abstractNote": "This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyperheuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than current meta-heuristic technology which tends to be customised to a particular problem or a narrow class of problems. Hyper-heuristics are broadly concerned with intelligently choosing the right heuristic or algorithm in a given situation. Of course, a hyper-heuristic can be (often is) a (meta-)heuristic and it can operate on (meta-)heuristics. In a certain sense, a hyper-heuristic works at a higher level when compared with the typical application of meta-heuristics to optimisation problems, i.e., a hyper-heuristic could be thought of as a (meta)-heuristic which operates on lower level (meta-)heuristics. In this chapter we will introduce the idea and give a brief history of this emerging area. In addition, we will review some of the latest work to be published in the field.", "bookTitle": "Handbook of Metaheuristics", "series": "International Series in Operations Research & Management Science", "seriesNumber": "57", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2003/01/01", "publisher": "Springer US", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "457-474", "ISBN": "978-1-4020-7263-5, 978-0-306-48056-0", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/0-306-48056-5_16", "accessDate": "2013-12-21T01:01:37Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "Hyper-Heuristics", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2003 Kluwer Academic Publishers", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Calculus of Variations and Optimal Control; Optimization", "type": 1 }, { "tag": "Heuristic", "type": 1 }, { "tag": "Hyper-heuristic", "type": 1 }, { "tag": "Meta-heuristic", "type": 1 }, { "tag": "Operations Research, Mathematical Programming", "type": 1 }, { "tag": "Operations Research/Decision Theory", "type": 1 }, { "tag": "Optimisation", "type": 1 }, { "tag": "Optimization", "type": 1 }, { "tag": "search", "type": 1 } ], "collections": [ "NEMVIEVK" ], "relations": {}, "dateAdded": "2013-12-21T01:01:37Z", "dateModified": "2013-12-21T01:01:37Z" } }, { "key": "TEQXPJUD", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/TEQXPJUD", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/TEQXPJUD", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Voss et al.", "parsedDate": "1999", "numChildren": 0 }, "data": { "key": "TEQXPJUD", "version": 3, "itemType": "book", "title": "Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization", "creators": [ { "creatorType": "editor", "firstName": "Stefan", "lastName": "Voss" }, { "creatorType": "editor", "firstName": "Ibrahim H.", "lastName": "Osman" }, { "creatorType": "editor", "firstName": "Catherine", "lastName": "Roucairol" } ], "abstractNote": "From the Publisher:A meta-heuristic is an iterative master process that guides and modifies the operations of subordinate heuristics to efficiently produce high-quality solutions, and recently, there have been significant advances in the theory and application of meta-heuristics to the approximate solutions of hard optimization problems. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies.", "series": "", "seriesNumber": "", "volume": "", "numberOfVolumes": "", "edition": "", "date": "1999", "publisher": "Kluwer Academic Publishers", "place": "Norwell, MA, USA", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "numPages": "", "ISBN": "0792383699", "DOI": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "Meta-Heuristics", "language": "", "libraryCatalog": "ACM Digital Library", "callNumber": "", "rights": "", "extra": "", "tags": [], "collections": [ "NEMVIEVK" ], "relations": {}, "dateAdded": "2013-12-21T01:01:35Z", "dateModified": "2013-12-21T01:01:35Z" } }, { "key": "E36XSW37", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/E36XSW37", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/E36XSW37", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Voß", "parsedDate": "2001-01-01", "numChildren": 0 }, "data": { "key": "E36XSW37", "version": 3, "itemType": "bookSection", "title": "Meta-heuristics: The State of the Art", "creators": [ { "creatorType": "author", "firstName": "Stefan", "lastName": "Voß" }, { "creatorType": "editor", "firstName": "Alexander", "lastName": "Nareyek" } ], "abstractNote": "Meta-heuristics support managers in decision-making with robust tools that provide high-quality solutions to important applications in business, engineering, economics and science in reasonable time horizons. In this paper we give some insight into the state of the art of meta-heuristics. This primarily focuses on the significant progress which general frames within the meta-heuristics field have implied for solving combinatorial optimization problems, mainly those for planning and scheduling.", "bookTitle": "Local Search for Planning and Scheduling", "series": "Lecture Notes in Computer Science", "seriesNumber": "2148", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2001/01/01", "publisher": "Springer Berlin Heidelberg", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "1-23", "ISBN": "978-3-540-42898-5, 978-3-540-45612-4", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/3-540-45612-0_1", "accessDate": "2013-12-21T01:01:25Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "Meta-heuristics", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2001 Springer-Verlag Berlin Heidelberg", "extra": "", "tags": [ { "tag": "Algorithm Analysis and Problem Complexity", "type": 1 }, { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Discrete Mathematics in Computer Science", "type": 1 }, { "tag": "Numeric Computing", "type": 1 } ], "collections": [ "NEMVIEVK" ], "relations": {}, "dateAdded": "2013-12-21T01:01:25Z", "dateModified": "2013-12-21T01:01:25Z" } }, { "key": "STKFAF38", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/STKFAF38", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/STKFAF38", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Burke et al.", "parsedDate": "2003-01-01", "numChildren": 0 }, "data": { "key": "STKFAF38", "version": 3, "itemType": "bookSection", "title": "Hyper-Heuristics: An Emerging Direction in Modern Search Technology", "creators": [ { "creatorType": "author", "firstName": "Edmund", "lastName": "Burke" }, { "creatorType": "author", "firstName": "Graham", "lastName": "Kendall" }, { "creatorType": "author", "firstName": "Jim", "lastName": "Newall" }, { "creatorType": "author", "firstName": "Emma", "lastName": "Hart" }, { "creatorType": "author", "firstName": "Peter", "lastName": "Ross" }, { "creatorType": "author", "firstName": "Sonia", "lastName": "Schulenburg" }, { "creatorType": "editor", "firstName": "Fred", "lastName": "Glover" }, { "creatorType": "editor", "firstName": "Gary A.", "lastName": "Kochenberger" } ], "abstractNote": "This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyperheuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than current meta-heuristic technology which tends to be customised to a particular problem or a narrow class of problems. Hyper-heuristics are broadly concerned with intelligently choosing the right heuristic or algorithm in a given situation. Of course, a hyper-heuristic can be (often is) a (meta-)heuristic and it can operate on (meta-)heuristics. In a certain sense, a hyper-heuristic works at a higher level when compared with the typical application of meta-heuristics to optimisation problems, i.e., a hyper-heuristic could be thought of as a (meta)-heuristic which operates on lower level (meta-)heuristics. In this chapter we will introduce the idea and give a brief history of this emerging area. In addition, we will review some of the latest work to be published in the field.", "bookTitle": "Handbook of Metaheuristics", "series": "International Series in Operations Research & Management Science", "seriesNumber": "57", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2003/01/01", "publisher": "Springer US", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "457-474", "ISBN": "978-1-4020-7263-5, 978-0-306-48056-0", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/0-306-48056-5_16", "accessDate": "2013-12-21T01:01:20Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "Hyper-Heuristics", "language": "", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2003 Kluwer Academic Publishers", "extra": "", "tags": [ { "tag": "Artificial Intelligence (incl. Robotics)", "type": 1 }, { "tag": "Calculus of Variations and Optimal Control; Optimization", "type": 1 }, { "tag": "Heuristic", "type": 1 }, { "tag": "Hyper-heuristic", "type": 1 }, { "tag": "Meta-heuristic", "type": 1 }, { "tag": "Operations Research, Mathematical Programming", "type": 1 }, { "tag": "Operations Research/Decision Theory", "type": 1 }, { "tag": "Optimisation", "type": 1 }, { "tag": "Optimization", "type": 1 }, { "tag": "search", "type": 1 } ], "collections": [ "NEMVIEVK" ], "relations": {}, "dateAdded": "2013-12-21T01:01:20Z", "dateModified": "2013-12-21T01:01:20Z" } }, { "key": "NKSEZGXJ", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/NKSEZGXJ", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/NKSEZGXJ", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "(CONDOR)", "parsedDate": "1988", "numChildren": 0 }, "data": { "key": "NKSEZGXJ", "version": 3, "itemType": "journalArticle", "title": "Operations Research: The Next Decade", "creators": [ { "creatorType": "author", "firstName": "Committee On the Next Decade in Operations Research", "lastName": "(CONDOR)" } ], "abstractNote": "This report highlights several research areas in operations research likely to produce significant results over the next decade. It is the result of a workshop held between May 31 and June 2, 1987, and sponsored by the Systems Theory and Operations Research (STOR) Program of the Electrical, Communications, and Systems Engineering Division of the National Science Foundation; 24 operations research professionals participated, representing 15 U.S. universities, 1 foreign university, and 3 U.S. companies. After summarizing some significant OR accomplishments, the report sketches some important opportunities in the fields of optimization, stochastic processes, the operations research/artificial intelligence interface, operational and modeling science, and manufacturing and logistics.", "publicationTitle": "Operations Research", "publisher": "", "place": "", "date": "juillet 1, 1988", "volume": "36", "issue": "4", "section": "", "partNumber": "", "partTitle": "", "pages": "619-637", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Operations Research", "DOI": "", "citationKey": "", "url": "http://www.jstor.org/stable/171141", "accessDate": "2013-12-20T12:57:11Z", "PMID": "", "PMCID": "", "ISSN": "0030-364X", "archive": "", "archiveLocation": "", "shortTitle": "Operations Research", "language": "", "libraryCatalog": "JSTOR", "callNumber": "", "rights": "Copyright © 1988 INFORMS", "extra": "ArticleType: research-article / Full publication date: Jul. - Aug., 1988 / Copyright © 1988 INFORMS", "tags": [], "collections": [ "RDX5RRIJ" ], "relations": {}, "dateAdded": "2013-12-20T12:57:11Z", "dateModified": "2013-12-20T12:57:11Z" } }, { "key": "2PJJZPJK", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/2PJJZPJK", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/2PJJZPJK", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Hajek", "parsedDate": "1988", "numChildren": 0 }, "data": { "key": "2PJJZPJK", "version": 3, "itemType": "journalArticle", "title": "Cooling Schedules for Optimal Annealing", "creators": [ { "creatorType": "author", "firstName": "Bruce", "lastName": "Hajek" } ], "abstractNote": "A Monte Carlo optimization technique called \"simulated annealing\" is a descent algorithm modified by random ascent moves in order to escape local minima which are not global minima. The level of randomization is determined by a control parameter T, called temperature, which tends to zero according to a deterministic \"cooling schedule\". We give a simple necessary and sufficient condition on the cooling schedule for the algorithm state to converge in probability to the set of globally minimum cost states. In the special case that the cooling schedule has parametric form T (t) = c/log(1 + t), the condition for convergence is that c be greater than or equal to the depth, suitably defined, of the deepest local minimum which is not a global minimum state.", "publicationTitle": "Mathematics of Operations Research", "publisher": "", "place": "", "date": "mai 1, 1988", "volume": "13", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "311-329", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Mathematics of Operations Research", "DOI": "", "citationKey": "", "url": "http://www.jstor.org/stable/3689827", "accessDate": "2013-12-20T12:57:06Z", "PMID": "", "PMCID": "", "ISSN": "0364-765X", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "JSTOR", "callNumber": "", "rights": "Copyright © 1988 INFORMS", "extra": "ArticleType: research-article / Full publication date: May, 1988 / Copyright © 1988 INFORMS", "tags": [], "collections": [ "RDX5RRIJ" ], "relations": {}, "dateAdded": "2013-12-20T12:57:06Z", "dateModified": "2013-12-20T12:57:06Z" } }, { "key": "BHV5AA2S", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/BHV5AA2S", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/BHV5AA2S", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "O'Sullivan and O'Sullivan", "parsedDate": "1988", "numChildren": 0 }, "data": { "key": "BHV5AA2S", "version": 3, "itemType": "journalArticle", "title": "Deconvolution of Episodic Hormone Data: An analysis of the Role of Season on the Onset of Puberty in Cows", "creators": [ { "creatorType": "author", "firstName": "Finbarr", "lastName": "O'Sullivan" }, { "creatorType": "author", "firstName": "Janet", "lastName": "O'Sullivan" } ], "abstractNote": "A new approach to the analysis of episodic hormone data is described. The method involves a stochastic model in which measured blood hormone concentration is represented as a convolution of individual pulses, each of which is thought of as the response to a burst of neural activity. Individual pulses are not constrained to occur in a fixed regular pattern in time. The methodology takes a series of blood hormone measurements and produces a spike train of pulse peak times together with a set of pulse shape parameters. This decomposition motivates some fresh approaches to the analysis of hormone data. For a given number of pulses the model is fit by minimizing a residual sum of squares criterion. This is a difficult combinatorial optimization problem. A randomized local adjustment algorithm is developed. Generalized cross-validation is used to select the number of pulses. The technique seems to produce reliable results on simulated data sets. The methodology is used to study some data concerned with the role of season of birth on the onset of puberty in bovine females. The analysis raises some interesting questions related to the maturation of the pituitary and hypothalamus.", "publicationTitle": "Biometrics", "publisher": "", "place": "", "date": "juin 1, 1988", "volume": "44", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "339-353", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Biometrics", "DOI": "10.2307/2531849", "citationKey": "", "url": "http://www.jstor.org/stable/2531849", "accessDate": "2013-12-20T12:57:03Z", "PMID": "", "PMCID": "", "ISSN": "0006-341X", "archive": "", "archiveLocation": "", "shortTitle": "Deconvolution of Episodic Hormone Data", "language": "", "libraryCatalog": "JSTOR", "callNumber": "", "rights": "Copyright © 1988 International Biometric Society", "extra": "ArticleType: research-article / Full publication date: Jun., 1988 / Copyright © 1988 International Biometric Society", "tags": [], "collections": [ "RDX5RRIJ" ], "relations": {}, "dateAdded": "2013-12-20T12:57:03Z", "dateModified": "2013-12-20T12:57:03Z" } }, { "key": "Q99AN46B", "version": 3, "library": { "type": "group", "id": 238215, "name": "Metaheuristics", "links": { "alternate": { "href": "https://www.zotero.org/groups/metaheuristics", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/238215/items/Q99AN46B", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/metaheuristics/items/Q99AN46B", "type": "text/html" } }, "meta": { "createdByUser": { "id": 1284235, "username": "jgrosman", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/jgrosman", "type": "text/html" } } }, "creatorSummary": "Barahona et al.", "parsedDate": "1988", "numChildren": 0 }, "data": { "key": "Q99AN46B", "version": 3, "itemType": "journalArticle", "title": "An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design", "creators": [ { "creatorType": "author", "firstName": "Francisco", "lastName": "Barahona" }, { "creatorType": "author", "firstName": "Martin", "lastName": "Grötschel" }, { "creatorType": "author", "firstName": "Michael", "lastName": "Jünger" }, { "creatorType": "author", "firstName": "Gerhard", "lastName": "Reinelt" } ], "abstractNote": "We study the problem of finding ground states of spin glasses with exterior magnetic field, and the problem of minimizing the number of vias (holes on a printed circuit board, or contacts on a chip) subject to pin preassignments and layer preferences. The former problem comes up in solid-state physics, and the latter in very-large-scale-integrated (VLSI) circuit design and in printed circuit board design. Both problems can be reduced to the max-cut problem in graphs. Based on a partial characterization of the cut polytope, we design a cutting plane algorithm and report on computational experience with it. Our method has been used to solve max-cut problems on graphs with up to 1,600 nodes.", "publicationTitle": "Operations Research", "publisher": "", "place": "", "date": "mai 1, 1988", "volume": "36", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "493-513", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Operations Research", "DOI": "", "citationKey": "", "url": "http://www.jstor.org/stable/170992", "accessDate": "2013-12-20T12:57:01Z", "PMID": "", "PMCID": "", "ISSN": "0030-364X", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "JSTOR", "callNumber": "", "rights": "Copyright © 1988 INFORMS", "extra": "ArticleType: research-article / Full publication date: May - Jun., 1988 / Copyright © 1988 INFORMS", "tags": [], "collections": [ "RDX5RRIJ" ], "relations": {}, "dateAdded": "2013-12-20T12:57:01Z", "dateModified": "2013-12-20T12:57:01Z" } } ]