Solving the Multi-Depot Vehicle Routing Problem Using a Hybrid Genetic Algorithm
This study investigates the Multi-Depot Vehicle Routing Problem (MDVRP) with travel distance constraint (no refueling allowed). This problem is a critical challenge in the transportation industry, particularly in locomotive routing within railway networks. The research provides a comprehensive revie...
Saved in:
| Main Author: | Hengameh Shamsipoor |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Razi University
2024-12-01
|
| Series: | مدلسازی پیشرفته در مهندسی عمران |
| Subjects: | |
| Online Access: | https://amcen.razi.ac.ir/article_3402_2bd11aec313ea06ff11995da7d126d22.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A generalized multi-depot vehicle routing problem with replenishment based on LocalSolver
by: Ying Zhang, et al.
Published: (2015-01-01) -
A genetic algorithm approach to green vehicle routing: Optimizing vehicle allocation and route planning for perishable products
by: Hayati Mukti Asih, et al.
Published: (2025-05-01) -
Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window
by: A.M. Rahimi, et al.
Published: (2025-03-01) -
An Improved Genetic Algorithm for Solving the Semi-Soft Clustered Vehicle Routing Problem
by: Yihao Miao, et al.
Published: (2025-04-01) -
Decentralized message passing algorithm for heterogeneous multi-depot vehicle routing problems
by: Byeong-Min Jeong, et al.
Published: (2025-06-01)