Solving the multi‐objective bike routing problem by meta‐heuristic algorithms

DOI10.1111/itor.13114OpenAlexW4206614412MaRDI QIDQ6079858

No author found.

Publication date: 29 September 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13114

zbMATH Keywords

genetic algorithmsmeta-heuristicsmutation operatormulti-objective shortest pathbike routing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

A multi‐objective hybrid evolutionary search algorithm for parallel production line balancing problem including disassembly and assembly tasks ⋮ Learn to decompose multiobjective optimization models for large‐scale networks

Cites Work

• On a multicriteria shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• The bi-objective pollution-routing problem
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms
• Multi-objective vehicle routing problems
• A unified solution framework for multi-attribute vehicle routing problems
• An exact method for the biobjective shortest path problem for large-scale road networks
• Planning Algorithms

This page was built for publication: Solving the multi‐objective bike routing problem by meta‐heuristic algorithms