2022
DOI: 10.1111/itor.13114
|View full text |Cite
|
Sign up to set email alerts
|

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 preferences when choosing a route. We propose a new genetic approach to solve the MOBRP (NGA‐MOBRP) with a new mutation operator. To test the approach, we consider four conflicting criteria: safety, travel distance, travel time, and comfort. The well‐known Nondominated Sorting Genetic Algorithm II (NSGA‐II) is also implemented in the MOBRP context, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 40 publications
0
4
0
Order By: Relevance
“…Considering the multi‐objective optimization characteristic of the addressed parallel line balancing problem with mixed disassembly and assembly tasks, a multi‐objective optimization processing method based on the idea of Pareto optimal solution (Hacardiaux et al., 2022, Nunes et al., 2023) is introduced in the proposed multi‐objective HESA. Here, the concept of Pareto optimal solution is first illustrated by taking a multi‐objective minimization problem with m optimization objectives as an example.…”
Section: Multi‐objective Hesamentioning
confidence: 99%
“…Considering the multi‐objective optimization characteristic of the addressed parallel line balancing problem with mixed disassembly and assembly tasks, a multi‐objective optimization processing method based on the idea of Pareto optimal solution (Hacardiaux et al., 2022, Nunes et al., 2023) is introduced in the proposed multi‐objective HESA. Here, the concept of Pareto optimal solution is first illustrated by taking a multi‐objective minimization problem with m optimization objectives as an example.…”
Section: Multi‐objective Hesamentioning
confidence: 99%
“…There are three solution methods to solve multiobjective problems: a priori, interactive, and a posteriori. In the a priori approach, the decision maker provides preferences for objective function; in interactive approaches, the preferences are made during the search process; while in a posteriori approaches, a set of potential nondominated solutions is generated, and the decision makers have the flexibility to select the most desired solution (Nunes et al, 2023). Evolutionary multiobjective optimization has been shown to be an efficient a posteriori method to preserve a balance between convergence and diversity in the provided solutions (Zhang and Li, 2007).…”
Section: Moea/d Algorithmmentioning
confidence: 99%
“…Many applications in real life often contain multiple objectives to be optimized simultaneously such as in the fields of intelligent manufacture systems, environment energy systems, financial and management science, and so forth, which are termed multiobjective optimization problems (MOPs) (Liu et al, 2022; Ma et al, 2023; Morteza et al, 2023; Nunes et al, 2023; Yazdani et al, 2023). For example, the portfolio optimization problem is to minimize the risk and maximize the return (Morteza et al, 2023).…”
Section: Introductionmentioning
confidence: 99%
“…For example, the portfolio optimization problem is to minimize the risk and maximize the return (Morteza et al, 2023). In the routing planning problem, along with the goal of shortest route distance, it is also vital to consider cost, safety, and risk (Nunes et al, 2023). Frequently, multiple objectives in MOPs are contradictory to each other.…”
Section: Introductionmentioning
confidence: 99%