Krstev, Dejan and Dimitrov, Sasko and Krstev, Aleksandar (2021) Vehicle Routing Problem with Distance Constraints aAnd Clustering Using MATLAB. In: ITRO 2021, 26 Nov 2021, Zrenjanin, Republic of Serbia.
![[thumbnail of ITRO 2021 naslovna.pdf]](/style/images/fileicons/text.png) |
Text
ITRO 2021 naslovna.pdf - Published Version Download (1MB) |
|
Text
ITRO trud 1.pdf - Published Version Download (900kB) |
Abstract
The problem of designing routes for vehicles that should supply different customers with defined locations and specific demand from a single or various depots is known as the vehicle routing problem. The main objective in this case is minimizing the total cost of delivery or maximizing the profit while taking into consideration some constraints that vary from a case to another. In this paper I am going to define this problem, present a mathematical model to describe it, talk about the existing solutions to solve it, and use different tools to solve a real VRP of a company in tangier.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Natural sciences > Computer and information sciences Natural sciences > Other natural sciences |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Aleksandar Krstev |
| Date Deposited: | 09 Nov 2022 09:30 |
| Last Modified: | 09 Nov 2022 09:30 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/30454 |
Actions (login required)
 |
View Item |