49,133 research outputs found

    An Improved Differential Evolution Algorithm for Maritime Collision Avoidance Route Planning

    Get PDF
    High accuracy navigation and surveillance systems are pivotal to ensure efficient ship route planning and marine safety. Based on existing ship navigation and maritime collision prevention rules, an improved approach for collision avoidance route planning using a differential evolution algorithm was developed. Simulation results show that the algorithm is capable of significantly enhancing the optimized route over current methods. It has the potential to be used as a tool to generate optimal vessel routing in the presence of conflicts

    Heuristic algorithms for the min-max edge 2-coloring problem

    Full text link
    In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named \emph{maximum edge qq-coloring} and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the \emph{min-max edge qq-coloring}. The above mentioned graph problems, namely the maximum edge qq-coloring and the min-max edge qq-coloring are studied mainly from the theoretical perspective. In this paper, we study the min-max edge 2-coloring problem from a practical perspective. More precisely, we introduce, implement and test four heuristic approximation algorithms for the min-max edge 22-coloring problem. These algorithms are based on a \emph{Breadth First Search} (BFS)-based heuristic and on \emph{local search} methods like basic \emph{hill climbing}, \emph{simulated annealing} and \emph{tabu search} techniques, respectively. Although several algorithms for particular graph classes were proposed by Larjomaa and Popa (e.g., trees, planar graphs, cliques, bi-cliques, hypergraphs), we design the first algorithms for general graphs. We study and compare the running data for all algorithms on Unit Disk Graphs, as well as some graphs from the DIMACS vertex coloring benchmark dataset.Comment: This is a post-peer-review, pre-copyedit version of an article published in International Computing and Combinatorics Conference (COCOON'18). The final authenticated version is available online at: http://www.doi.org/10.1007/978-3-319-94776-1_5

    Time-dependent universal conductance fluctuations in mesoscopic Au wires: implications

    Full text link
    In cold, mesoscopic conductors, two-level fluctuators lead to time-dependent universal conductance fluctuations (TDUCF) manifested as 1/f1/f noise. In Au nanowires, we measure the magnetic field dependence of TDUCF, weak localization (WL), and magnetic field-driven (MF) UCF before and after treatments that alter magnetic scattering and passivate surface fluctuators. Inconsistencies between LĎ•WLL_{\phi}^{\rm WL} and LĎ•TDUCFL_{\phi}^{\rm TDUCF} strongly suggest either that the theory of these mesoscopic phenomena in weakly disordered, highly pure Au is incomplete, or that the assumption that the TDUCF frequency dependence remains 1/f1/f to very high frequencies is incorrect. In the latter case, TDUCF in excess of 1/f1/f expectations may have implications for decoherence in solid-state qubits.Comment: 8 pages, 9 figures, accepted to PR
    • …
    corecore