Koceva Lazarova, Limonka and Stojkovic, Natasa and Stojanova, Aleksandra and Martinovska Bande, Cveta (2024) Metaheuristics methods for solving capacity vehicle routing problem an overview. In: XV International conference of information technology and development of education ITRO 2024, Zrenjanin.
![[thumbnail of METAHEURISTICS METHODS FOR SOLVING CAPACITY VEHICLE ROUTING.pdf]](https://eprints.ugd.edu.mk/style/images/fileicons/text.png "METAHEURISTICS METHODS FOR SOLVING CAPACITY VEHICLE ROUTING.pdf")
Text
METAHEURISTICS METHODS FOR SOLVING CAPACITY VEHICLE ROUTING.pdf - Published Version
Download (1MB)
Abstract
The Vehicle Routing Problem (VRP) plays a vital role in logistics, supply chain
management, and transportation planning. By providing effective solutions, VRP can significantly
reduce costs, lower fuel consumption, and improve customer satisfaction. This makes VRP a critical
focus for companies engaged in delivery services, public transit, and distribution networks. Given
the NP-hard complexity of the problem, using exact algorithms for large instances is often
impractical. As a result, this paper explains a variety of approaches, such as Genetic Algorithms,
Tabu Search, Ant System, and Hybrid Metaheuristics. This overview serves as a resource for
researchers and practitioners interested in applying metaheuristics to CVRP.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Natural sciences > Computer and information sciences Engineering and Technology > Electrical engineering, electronic engineering, information engineering Natural sciences > Matematics |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Aleksandra Stojanova Ilievska |
| Date Deposited: | 12 Mar 2025 08:04 |
| Last Modified: | 12 Mar 2025 08:04 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/35791 |
Actions (login required)
- View Item