Solving the multi‐objective bike routing problem by meta‐heuristic algorithms
Abstract The Multi‐Objective Bike Routing Problem (MOBRP) addressed in this paper
consists in finding a set of good solutions that represents the trade‐off between cyclist …
consists in finding a set of good solutions that represents the trade‐off between cyclist …
A simulated annealing algorithm to solve the multi-objective bike routing problem
P Nunes, A Moura, JP Santos… - … on Computer Science …, 2021 - ieeexplore.ieee.org
With the increasing concern about sustainable means of transport, the use of bicycle is
earning popularity. However, for cyclists, it may be a challenge to use this mean of …
earning popularity. However, for cyclists, it may be a challenge to use this mean of …
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
R Lewis, P Corcoran - Journal of Heuristics, 2022 - Springer
This paper proposes two heuristic algorithms for finding fixed-length circuits and cycles in
undirected edge-weighted graphs. It focusses particularly on a largely unresearched …
undirected edge-weighted graphs. It focusses particularly on a largely unresearched …
Fast algorithms for computing fixed-length round trips in real-world street networks
R Lewis, P Corcoran - SN Computer Science, 2024 - Springer
This paper proposes and evaluates algorithms for calculating round trips of a prescribed
length on directed street networks. This problem has several real-world applications, such …
length on directed street networks. This problem has several real-world applications, such …