Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 62165

The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving


Skok, Minea; Škrlec, Davor; Krajcar, Slavko
The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving // Proceedings of the 4th International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies KES'2000
Brighton, Ujedinjeno Kraljevstvo, 2000. (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 62165 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving

Autori
Skok, Minea ; Škrlec, Davor ; Krajcar, Slavko

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the 4th International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies KES'2000 / - , 2000

Skup
KES'2000 4th International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies

Mjesto i datum
Brighton, Ujedinjeno Kraljevstvo, 30.08.2000. - 01.09.2000

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem; Genetic Algorithm

Sažetak
Many organizations face the problem of delivering goods from a certain number of warehouses to a number of retail sites using a fleet of vehicles. The Multiple Depot Capacitated Vehicle Routing Problem is mathematical model that closely approximates the problem faced by many of these organizations. In regard that the problem is NP-hard, requiring excessive time to be exactly solved, in this article we develop heuristic based on genetic algorithm that finds high quality solutions in a reasonable amount of computer time. Basic GA procedures adapted to a given problem are presented and six versions of crossover operators are compared. The test results reveal that the method is able to produce results of a kind not easily obtained before namely in terms of an amount of information about the solutions and the solution space.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika



POVEZANOST RADA


Projekti:
036016

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Minea Skok (autor)

Avatar Url Davor Škrlec (autor)

Avatar Url Slavko Krajcar (autor)


Citiraj ovu publikaciju:

Skok, Minea; Škrlec, Davor; Krajcar, Slavko
The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving // Proceedings of the 4th International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies KES'2000
Brighton, Ujedinjeno Kraljevstvo, 2000. (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Skok, M., Škrlec, D. & Krajcar, S. (2000) The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving. U: Proceedings of the 4th International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies KES'2000.
@article{article, author = {Skok, Minea and \v{S}krlec, Davor and Krajcar, Slavko}, year = {2000}, keywords = {Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem, Genetic Algorithm}, title = {The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving}, keyword = {Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem, Genetic Algorithm}, publisherplace = {Brighton, Ujedinjeno Kraljevstvo} }
@article{article, author = {Skok, Minea and \v{S}krlec, Davor and Krajcar, Slavko}, year = {2000}, keywords = {Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem, Genetic Algorithm}, title = {The Genetic Algorithm Method For Multiple Depot Capacitated Vehicle Routing Problem Solving}, keyword = {Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem, Genetic Algorithm}, publisherplace = {Brighton, Ujedinjeno Kraljevstvo} }




Contrast
Increase Font
Decrease Font
Dyslexic Font