Solving the Problem of Vehicle Routing Problem With Time Window via Dual Adaptive Genetic Algorithm
To address the Vehicle Routing Problem with Time Windows (VRPTW), this paper presents a novel Dual Adaptive Genetic Algorithm (DAGA). While numerous metaheuristic algorithms have been proposed to solve VRPTW, most existing approaches either rely on fixed cost functions or incorporate local search he...
Saved in:
| Main Author: | Chunge Hua |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11020644/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving the Multi-Depot Vehicle Routing Problem Using a Hybrid Genetic Algorithm
by: Hengameh Shamsipoor
Published: (2024-12-01) -
Optimizing Vehicle Routing for Perishable Products with Time Window Constraints:
by: Rifqi Fauzi, et al.
Published: (2025-01-01) -
An adaptive genetic algorithm with double populations for solving traveling salesman problems
by: Taishan Yan, et al.
Published: (2025-07-01) -
Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm
by: Alireza Salamatbakhsh, et al.
Published: (2021-02-01) -
Power supply vehicle routing problem: formulation and solution
by: Lizhe You, et al.
Published: (2025-07-01)