The 1st International Electronic Conference on Algorithms

This book presents 22 of the accepted presentations at the 1st International Electronic Conference on Algorithms which was held completely online from September 27 to October 10, 2021. It contains 16 proceeding papers as well as 6 extended abstracts. The works presented in the book cover a wide range of fields dealing with the development of algorithms. Many of contributions are related to machine learning, in particular deep learning. Another main focus among the contributions is on problems dealing with graphs and networks, e.g., in connection with evacuation planning problems

Selecting and scheduling of improvements in urban transportation networks using metaheuristics

Deciding which projects, alternatives and/or investments should be implemented is a complex and important topic not only in transportation engineering, but in management, operations research, and economics. If the project’s benefits or costs depend on which other project is realized, then the projects are interrelated. The evaluation method computes the costs of network flows determined with the Frank-Wolfe algorithm, which is modified to consider intersection flows and delays. Intersections are modelled with pseudo-links. The methods used for choosing the optimal schedule of project improvements are: Ant Colony Optimization, Simulated Annealing and Tabu Search. The heuristic that yields the best most quickly solution is Ant Colony Optimization and it is chosen for the sensitivity analysis. The results of the sensitivity analysis show how the changes in ACO parameters and the model parameters influence the behavior of the model and the algorithm

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

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

Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications

abstract: Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). Previous research has made a number of important contributions to the challenging pickup and delivery problem along different formulation or solution approaches. However, there are a number of modeling and algorithmic challenges for a large-scale deployment of a vehicle routing and scheduling algorithm, especially for regional networks with various road capacity and traffic delay constraints on freeway bottlenecks and signal timing on urban streets. The main thrust of this research is constructing hyper-networks to implicitly impose complicated constraints of a vehicle routing problem (VRP) into the model within the network construction. This research introduces a new methodology based on hyper-networks to solve the very important vehicle routing problem for the case of generic ride-sharing problem. Then, the idea of hyper-networks is applied for (1) solving the pickup and delivery problem with synchronized transfers, (2) computing resource hyper-prisms for sustainable transportation planning in the field of time-geography, and (3) providing an integrated framework that fully captures the interactions between supply and demand dimensions of travel to model the implications of advanced technologies and mobility services on traveler behavior.Dissertation/ThesisDoctoral Dissertation Civil, Environmental and Sustainable Engineering 201

Sequence-Based Simulation-Optimization Framework With Application to Port Operations at Multimodal Container Terminals

It is evident in previous works that operations research and mathematical algorithms can provide optimal or near-optimal solutions, whereas simulation models can aid in predicting and studying the behavior of systems over time and monitor performance under stochastic and uncertain circumstances. Given the intensive computational effort that simulation optimization methods impose, especially for large and complex systems like container terminals, a favorable approach is to reduce the search space to decrease the amount of computation. A maritime port can consist of multiple terminals with specific functionalities and specialized equipment. A container terminal is one of several facilities in a port that involves numerous resources and entities. It is also where containers are stored and transported, making the container terminal a complex system. Problems such as berth allocation, quay and yard crane scheduling and assignment, storage yard layout configuration, container re-handling, customs and security, and risk analysis become particularly challenging. Discrete-event simulation (DES) models are typically developed for complex and stochastic systems such as container terminals to study their behavior under different scenarios and circumstances. Simulation-optimization methods have emerged as an approach to find optimal values for input variables that maximize certain output metric(s) of the simulation. Various traditional and nontraditional approaches of simulation-optimization continue to be used to aid in decision making. In this dissertation, a novel framework for simulation-optimization is developed, implemented, and validated to study the influence of using a sequence (ordering) of decision variables (resource levels) for simulation-based optimization in resource allocation problems. This approach aims to reduce the computational effort of optimizing large simulations by breaking the simulation-optimization problem into stages. Since container terminals are complex stochastic systems consisting of different areas with detailed and critical functions that may affect the output, a platform that accurately simulates such a system can be of significant analytical benefit. To implement and validate the developed framework, a large-scale complex container terminal discrete-event simulation model was developed and validated based on a real system and then used as a testing platform for various hypothesized algorithms studied in this work

Zone-based public transport route optimisation in an urban network

The majority of academic studies on the optimisation of public transport routes consider passenger trips to be fixed between pairs of stop points. This can lead to barriers in the use of the developed algorithms in real-world planning processes, as these usually utilise a zone-based trip representation. This study demonstrates the adaptation of a node-based optimisation procedure to work with zone-to-zone trips. A core element of this process is a hybrid approach to calculate zone-to-zone journey times through the use of node-based concepts. The resulting algorithm is applied to a input dataset generated from real-world data, with results showing significant improvements over the existing route network. The dataset is made publicly available to serve as a potential benchmark dataset for future research

Método Computacional para a Otimização do Projeto da Malha Viária de Florianópolis-SC

A frota de veículos terrestres cresceu mais de 70% no Brasil. Em contraste, investimentos públicos no setor de infraestrutura de transporte rodoviário não cresceram na mesma proporção. Como resultado, há uma demanda urgente na melhoria de fluxo na malha viária dos grandes centros brasileiros. A região da grande Florianópolis é uma das regiões que sofrem com o alto fluxo de veículos, por ser um centro importante da administração pública catarinense, ter uma alta densidade de empresas e por suas características geográficas. Para auxiliar na tomada de decisão do planejamento rodoviário, diversos trabalhos na área de algoritmos e otimização vem reportando e avaliando métodos computacionais. Nesse contexto, a pesquisa desenvolveu um método computacional para auxiliar o planejamento da malha viária do município de Florianópolis - SC inspirado no modelo/método de Salman-Alaswad. Para isso: (i) estudou-se a malha viária de Florianópolis e suas demandas; (ii) levantou-se métodos computacionais para resolver problemas de planejamento de malhas viárias terrestres na literatura; (iii) foi desenvolvido o método computacional com base no método de Salman-Alaswad. O projeto contou com apoio de um bolsista do edital PIBIC 2019-2020. O método computacional desenvolvido está publicado no GITHUB (em modo público) e apresentou melhoria na malha viária experimentada. Como trabalhos futuros, pretende-se ampliar os experimentos para compreender a escalabilidade dos parâmetros do método e potencial publicação em veículos de comunicação científica. Uma continuação natural do projeto já foi aprovada pelo departamento e pretende-se reforçar as contribuições estabelecidas para melhorar a visibilidade dos resultados.Contou com uma bolsa do “Programa Institucional de Iniciação Científica e Tecnológica – PIICT, Bolsas PI- BIC/CNPq” 2019/202

A comprehensive survey on cultural algorithms

Peer reviewedPostprin

Management: A continuing bibliography with indexes

This biliography lists 919 reports, articles, and other documents introduced into the NASA scientific and technical information system in 1981