3,001 research outputs found

    Shell game optimization:A novel game-based algorithm

    Get PDF

    Evolutionary Computation 2020

    Get PDF
    Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

    Adaptive autotuning mathematical approaches for integrated optimization of automated container terminal

    Get PDF
    With the development of automated container terminals (ACTs), reducing the loading and unloading time of operation and improving the working efficiency and service level have become the key point. Taking into account the actual operation mode of loading and unloading in ACTs, a mixed integer programming model is adopted in this study to minimize the loading and unloading time of ships, which can optimize the integrated scheduling of the gantry cranes (QCs), automated guided vehicles (AGVs), and automated rail-mounted gantries (ARMGs) in automated terminals. Various basic metaheuristic and improved hybrid algorithms were developed to optimize the model, proving the effectiveness of the model to obtain an optimized scheduling scheme by numerical experiments and comparing the different performances of algorithms. The results show that the hybrid GA-PSO algorithm with adaptive autotuning approaches by fuzzy control is superior to other algorithms in terms of solution time and quality, which can effectively solve the problem of integrated scheduling of automated container terminals to improve efficiency.info:eu-repo/semantics/publishedVersio

    The Faculty Notebook, March & May 2006

    Full text link
    The Faculty Notebook is published periodically by the Office of the Provost at Gettysburg College to bring to the attention of the campus community accomplishments and activities of academic interest. Faculty are encouraged to submit materials for consideration for publication to the Associate Provost for Faculty Development. Copies of this publication are available at the Office of the Provost

    A Comprehensive Review of Bio-Inspired Optimization Algorithms Including Applications in Microelectronics and Nanophotonics

    Get PDF
    The application of artificial intelligence in everyday life is becoming all-pervasive and unavoidable. Within that vast field, a special place belongs to biomimetic/bio-inspired algorithms for multiparameter optimization, which find their use in a large number of areas. Novel methods and advances are being published at an accelerated pace. Because of that, in spite of the fact that there are a lot of surveys and reviews in the field, they quickly become dated. Thus, it is of importance to keep pace with the current developments. In this review, we first consider a possible classification of bio-inspired multiparameter optimization methods because papers dedicated to that area are relatively scarce and often contradictory. We proceed by describing in some detail some more prominent approaches, as well as those most recently published. Finally, we consider the use of biomimetic algorithms in two related wide fields, namely microelectronics (including circuit design optimization) and nanophotonics (including inverse design of structures such as photonic crystals, nanoplasmonic configurations and metamaterials). We attempted to keep this broad survey self-contained so it can be of use not only to scholars in the related fields, but also to all those interested in the latest developments in this attractive area

    Visual AI and Linguistic Intelligence Through Steerability and Composability

    Full text link
    This study explores the capabilities of multimodal large language models (LLMs) in handling challenging multistep tasks that integrate language and vision, focusing on model steerability, composability, and the application of long-term memory and context understanding. The problem addressed is the LLM's ability (Nov 2023 GPT-4 Vision Preview) to manage tasks that require synthesizing visual and textual information, especially where stepwise instructions and sequential logic are paramount. The research presents a series of 14 creatively and constructively diverse tasks, ranging from AI Lego Designing to AI Satellite Image Analysis, designed to test the limits of current LLMs in contexts that previously proved difficult without extensive memory and contextual understanding. Key findings from evaluating 800 guided dialogs include notable disparities in task completion difficulty. For instance, 'Image to Ingredient AI Bartender' (Low difficulty) contrasted sharply with 'AI Game Self-Player' (High difficulty), highlighting the LLM's varying proficiency in processing complex visual data and generating coherent instructions. Tasks such as 'AI Genetic Programmer' and 'AI Negotiator' showed high completion difficulty, emphasizing challenges in maintaining context over multiple steps. The results underscore the importance of developing LLMs that combine long-term memory and contextual awareness to mimic human-like thought processes in complex problem-solving scenarios

    Clustering in Recommendation Systems Using Swarm Intelligence

    Get PDF
    Ένα σύστημα συστάσεων είναι μία εφαρμογή που εκμεταλλεύεται πληροφορίες για να βοηθήσει τους χρήστες στη λήψη αποφάσεων προτείνοντας αντικείμενα που μπορεί να τους αρέσουν. Ένα σύστημα συστάσεων που βασίζεται στην τεχνική του συνεργατικού φιλτραρίσματος (collaborative filtering) δημιουργεί συστάσεις στους χρήστες με βάση τις προτιμήσεις παρόμοιων χρηστών. Ωστόσο, αυτός ο τύπος συστήματος συστάσεων δεν είναι τόσο αποτελεσματικός όταν τα δεδομένα αυξάνονται σε μεγάλο βαθμό (scalability) ή όταν δεν υπάρχει αρκετή πληροφορία (sparsity), καθώς δεν ομαδοποιούνται σωστά οι παρόμοιοι χρήστες. Αυτή η διπλωματική εργασία προτείνει τρείς υβριδικούς αλγορίθμους που ο καθένας συνδυάζει τον αλγόριθμο k-means με έναν αλγόριθμο ευφυΐας σμήνους για να βελτιώσει την ομαδοποίηση των χρηστών, και κατ’ επέκταση την ποιότητα των συστάσεων. Οι αλγόριθμοι ευφυΐας σμήνους που χρησιμοποιούνται είναι o αλγόριθμος τεχνητής κοινωνίας μελισσών (artificial bee colony), ο αλγόριθμος βελτιστοποίησης αναζήτησης κούκων (cuckoo search optimization) και ο αλγόριθμος βελτιστοποίησης γκρίζων λύκων (grey-wolf optimization). Οι προτεινόμενες μέθοδοι αξιολογήθηκαν χρησιμοποιώντας ένα σύνολο δεδομένων του MovieLens. Η αξιολόγηση δείχνει πως τα προτεινόμενα συστήματα συστάσεων αποδίδουν καλύτερα σε σύγκριση με τις ήδη υπάρχουσες τεχνικές όσον αφορά τις μετρικές του μέσου απόλυτου σφάλματος (mean absolute error - MAE), της ακρίβειας (precision), του αθροίσματος των τετραγωνικών σφαλμάτων (sum of squared errors - SSE) και της ανάκλησης (recall). Επιπλέον, τα αποτελέσματα της αξιολόγησης δείχνουν πως ο υβριδικός αλγόριθμος που χρησιμοποιεί την μέθοδο της τεχνητής κοινωνίας μελισσών αποδίδει ελαφρώς καλύτερα από τους άλλους δύο προτεινόμενους αλγορίθμους.A recommender system (RS) is an application that exploits information to help users in decision making by suggesting items they might like. A collaborative recommender system generates recommendations to users based on their similar neighbor’s preferences. However, this type of recommender system faces the data sparsity and scalability problems making the neighborhood selection a challenging task. This thesis proposes three hybrid collaborative recommender systems that each one combines the k-means algorithm with a different bio-inspired technique to enhance the clustering task, and therefore to improve the recommendation quality. The used bio-inspired techniques are artificial bee colony (ABC), cuckoo search optimization (CSO), and grey-wolf optimizer (GWO). The proposed approaches were evaluated over a MovieLens dataset. The evaluation shows that the proposed recommender systems perform better compared to already existing techniques in terms of mean absolute error (MAE), precision, sum of squared errors (SSE), and recall. Moreover, the experimental results indicate that the hybrid recommender system that uses the ABC method performs slightly better than the other two proposed hybrid algorithms

    Real time tracking using nature-inspired algorithms

    Get PDF
    This thesis investigates the core difficulties in the tracking field of computer vision. The aim is to develop a suitable tuning free optimisation strategy so that a real time tracking could be achieved. The population and multi-solution based approaches have been applied first to analyse the convergence behaviours in the evolutionary test cases. The aim is to identify the core misconceptions in the manner the search characteristics of particles are defined in the literature. A general perception in the scientific community is that the particle based methods are not suitable for the real time applications. This thesis improves the convergence properties of particles by a novel scale free correlation approach. By altering the fundamental definition of a particle and by avoiding the nostalgic operations the tracking was expedited to a rate of 250 FPS. There is a reasonable amount of similarity between the tracking landscapes and the ones generated by three dimensional evolutionary test cases. Several experimental studies are conducted that compares the performances of the novel optimisation to the ones observed with the swarming methods. It is therefore concluded that the modified particle behaviour outclassed the traditional approaches by huge margins in almost every test scenario

    A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

    Get PDF
    Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms
    corecore