A Variable Neighbourhood Search-Based Algorithm for the Transit Route Network Design Problem
The transit route network design problem (TRNDP) has long attracted research attention, with many metaheuristic approaches proposed for its solution. So far, and despite the promising performance of Variable Neighbourhood Search (VNS) variants for vehicle routing problems, the performance of the alg...
Main Authors: | Christina Iliopoulou, Ioannis Tassopoulos, Grigorios Beligiannis |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-10-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/12/20/10232 |
Similar Items
-
Solving the Urban Transit Routing Problem Using a Cat Swarm Optimization-Based Algorithm
by: Iosif V. Katsaragakis, et al.
Published: (2020-09-01) -
Variable neighborhood search algorithm for the green vehicle routing problem
by: Mannoubia Affi, et al.
Published: (2017-07-01) -
An Improved Particle Swarm Optimization Algorithm for the Urban Transit Routing Problem
by: Vasileios Kourepinis, et al.
Published: (2023-08-01) -
Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows
by: Mehmet Anıl Akbay, et al.
Published: (2022-01-01) -
A Variable Neighborhood Search Method with a Tabu List and Local Search for Optimizing Routing in Trucks in Maritime Ports
by: Luka Matijević, et al.
Published: (2023-08-01)