Solving of Capacited Arc Routing Problem - heuristics approach
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F11%3A39892778" target="_blank" >RIV/00216275:25510/11:39892778 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving of Capacited Arc Routing Problem - heuristics approach
Original language description
Practical application of Capacited Arc Routing Problem in the urban environment. The Capacitated Arc Routing Problem is the problem of servicing a set of edges with demand using a fleet of capacitated vehicles, such that the vehicle capacities are respected, and the total routing cost is minimized.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Úlohy diskrétní optimalizace v dopravní praxi 2011: současný stav a perspektivy
ISBN
978-80-7395-439-0
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
71-75
Publisher name
Univerzita Pardubice
Place of publication
Pardubice
Event location
Pardubice
Event date
Apr 28, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—