A hybrid clustering and greedy routing approach to solve a two-level location allocation and a static dial-a-ride problem
- 23 August 2025
- journal article
- research article
- Published by Springer Nature in OPSEARCH
- p. 1-24
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Comparison of anticipatory algorithms for a dial-a-ride problemEuropean Journal of Operational Research, 2022
- Location-allocation problem for resource distribution under uncertainty in disaster relief operationsSocio-Economic Planning Sciences, 2022
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problemComputers & Operations Research, 2021
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejectsOptimization Letters, 2021
- Robust, multi-objective optimization for the military medical evacuation location-allocation problemOmega, 2020
- Multiple criteria decision-making for hospital location-allocation based on improved genetic algorithmApplied Geomatics, 2020
- Studying Road Transportation Demand in the Spanish Industrial Sector Through k-Means Clustering2018
- A survey of dial-a-ride problems: Literature review and recent developmentsTransportation Research Part B: Methodological, 2018
- Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solutionJournal of Computational Science, 2017
- Algorithms for hierarchical clustering: an overviewWIREs Data Mining and Knowledge Discovery, 2011