Zobrazit minimální záznam

dc.contributor.authorRežnar, Tomáš
dc.contributor.authorMartinovič, Jan
dc.contributor.authorSlaninová, Kateřina
dc.contributor.authorGrakova, Ekaterina
dc.contributor.authorVondrák, Vít
dc.date.accessioned2017-09-11T08:46:13Z
dc.date.available2017-09-11T08:46:13Z
dc.date.issued2017
dc.identifier.citationCentral European Journal of Operations Research. 2017, vol. 25, issue 3, p. 545-560.cs
dc.identifier.issn1435-246X
dc.identifier.issn1613-9178
dc.identifier.urihttp://hdl.handle.net/10084/120215
dc.description.abstractThe probabilistic time-dependent vehicle routing problem is presented in this paper. It is a novel variant of the vehicle routing problem. The variant is a problem of finding optimal routes for a fleet of vehicles visiting customers in order to proceed delivery or pick-up. All customers must be visited in designated times with given probabilities and services must begin within the given time windows. Each vehicle has a given capacity, which must not be exceeded. The travel time between each two locations is dependent on a vehicle departure time. The paper also contains examples and solution results of testing data sets using the adaptive large neighbourhood search algorithm.cs
dc.language.isoencs
dc.publisherSpringercs
dc.relation.ispartofseriesCentral European Journal of Operations Researchcs
dc.relation.urihttp://dx.doi.org/10.1007/s10100-016-0459-2cs
dc.rights© Springer-Verlag Berlin Heidelberg 2016cs
dc.subjectvehicle routingcs
dc.subjectprobabilistic time-dependent vehicle routing problemcs
dc.subjectprobability of arrivalcs
dc.titleProbabilistic time-dependent vehicle routing problemcs
dc.typearticlecs
dc.identifier.doi10.1007/s10100-016-0459-2
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume25cs
dc.description.issue3cs
dc.description.lastpage560cs
dc.description.firstpage545cs
dc.identifier.wos000407369000003


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam