Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window
Efficient transportation of goods is crucial for cost reduction, improved delivery time, and enhanced service quality. Advanced logistics systems analyze data to find the most efficient routes. This minimizes fuel consumption and decreases transportation costs. The Vehicle Routing Problem with Time...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Sharif University of Technology
2025-03-01
|
| Series: | مهندسی عمران شریف |
| Subjects: | |
| Online Access: | https://sjce.journals.sharif.edu/article_23565_f29de805fc8a8938175bb05731e139df.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850052195746054144 |
|---|---|
| author | A.M. Rahimi B. Yadegari M. Aboutalebi Esfahani |
| author_facet | A.M. Rahimi B. Yadegari M. Aboutalebi Esfahani |
| author_sort | A.M. Rahimi |
| collection | DOAJ |
| description | Efficient transportation of goods is crucial for cost reduction, improved delivery time, and enhanced service quality. Advanced logistics systems analyze data to find the most efficient routes. This minimizes fuel consumption and decreases transportation costs. The Vehicle Routing Problem with Time Window Constraints (VRPTW) is a classic optimization problem in the field of operations research and logistics. It is a challenging optimization problem in logistics, classified as NP-hard. Hybrid approaches combine multiple optimization techniques to improve the quality and efficiency of solutions. This paper presents a hybrid cat-swarming algorithm that utilizes genetic operators to effectively address the VRPTW problem. The goal is to determine the optimal routes for the vehicles, considering both the vehicle capacity constraints and the time window constraints at each customer location. In this paper the objective function of the algorithm aims to minimize both the total distance traveled and the number of vehicles utilized, ensuring efficient and cost-effective routing. The hybrid cat swarming algorithm proposed in this study offers a novel approach to tackle the challenges posed by the VRPTW problem. By integrating genetic operators such as crossover and mutation, the algorithm enhances performance and improves the quality of solutions. Its primary objective of minimizing total distance and vehicle usage guarantees efficient and economically viable routing strategies. To evaluate the effectiveness of the algorithm, it was tested using a simulated dataset of salmon samples as a benchmark. For samples comprising 50 customers, an improvement of up to 48 to 59 percent in previous response rates has been achieved. For samples comprising 100 customers, optimal global responses, as obtained from previous articles, have been observed in several instances. The proposed algorithm is suitable for transportation and logistics systems with limited customers and leads to cost reduction, improved delivery times, and increased service quality. |
| format | Article |
| id | doaj-art-29779656875b4c7588b42e488c36f720 |
| institution | DOAJ |
| issn | 2676-4768 2676-4776 |
| language | fas |
| publishDate | 2025-03-01 |
| publisher | Sharif University of Technology |
| record_format | Article |
| series | مهندسی عمران شریف |
| spelling | doaj-art-29779656875b4c7588b42e488c36f7202025-08-20T02:52:55ZfasSharif University of Technologyمهندسی عمران شریف2676-47682676-47762025-03-01404859510.24200/j30.2024.63335.326823565Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time WindowA.M. Rahimi0B. Yadegari1M. Aboutalebi Esfahani2Associate Professor, Civil Engineering Department, Faculty of Engineering, University of Zanjan, Zanjan, IranMSc. Graduated of Transportation Planning, Faculty of Civil Engineering and Transportation, University of Isfahan, Isfahan, Iran.Associate Professor, Department of Railway Engineering and Transportation Planning, Faculty of Civil Engineering and Transportation, University of Isfahan, Isfahan, Iran.Efficient transportation of goods is crucial for cost reduction, improved delivery time, and enhanced service quality. Advanced logistics systems analyze data to find the most efficient routes. This minimizes fuel consumption and decreases transportation costs. The Vehicle Routing Problem with Time Window Constraints (VRPTW) is a classic optimization problem in the field of operations research and logistics. It is a challenging optimization problem in logistics, classified as NP-hard. Hybrid approaches combine multiple optimization techniques to improve the quality and efficiency of solutions. This paper presents a hybrid cat-swarming algorithm that utilizes genetic operators to effectively address the VRPTW problem. The goal is to determine the optimal routes for the vehicles, considering both the vehicle capacity constraints and the time window constraints at each customer location. In this paper the objective function of the algorithm aims to minimize both the total distance traveled and the number of vehicles utilized, ensuring efficient and cost-effective routing. The hybrid cat swarming algorithm proposed in this study offers a novel approach to tackle the challenges posed by the VRPTW problem. By integrating genetic operators such as crossover and mutation, the algorithm enhances performance and improves the quality of solutions. Its primary objective of minimizing total distance and vehicle usage guarantees efficient and economically viable routing strategies. To evaluate the effectiveness of the algorithm, it was tested using a simulated dataset of salmon samples as a benchmark. For samples comprising 50 customers, an improvement of up to 48 to 59 percent in previous response rates has been achieved. For samples comprising 100 customers, optimal global responses, as obtained from previous articles, have been observed in several instances. The proposed algorithm is suitable for transportation and logistics systems with limited customers and leads to cost reduction, improved delivery times, and increased service quality.https://sjce.journals.sharif.edu/article_23565_f29de805fc8a8938175bb05731e139df.pdfhybrid optimization vehicle routing-schedulingvehicle routing problemtime windowcat swarm optimizationgenetic algorithm |
| spellingShingle | A.M. Rahimi B. Yadegari M. Aboutalebi Esfahani Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window مهندسی عمران شریف hybrid optimization vehicle routing-scheduling vehicle routing problem time window cat swarm optimization genetic algorithm |
| title | Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window |
| title_full | Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window |
| title_fullStr | Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window |
| title_full_unstemmed | Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window |
| title_short | Innovative Hybrid Algorithm for Solving Vehicle Routing Problem with Time Window |
| title_sort | innovative hybrid algorithm for solving vehicle routing problem with time window |
| topic | hybrid optimization vehicle routing-scheduling vehicle routing problem time window cat swarm optimization genetic algorithm |
| url | https://sjce.journals.sharif.edu/article_23565_f29de805fc8a8938175bb05731e139df.pdf |
| work_keys_str_mv | AT amrahimi innovativehybridalgorithmforsolvingvehicleroutingproblemwithtimewindow AT byadegari innovativehybridalgorithmforsolvingvehicleroutingproblemwithtimewindow AT maboutalebiesfahani innovativehybridalgorithmforsolvingvehicleroutingproblemwithtimewindow |