Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristi...
Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
This paper discusses the Time Capacitated Arc Routing Problem (TCARP) and introduces a heuristic and a metaheuristic algorithm for solving large-size instances of it. The TCARP is a realistic extension of the Capacitated Arc Routing Problem in which edge-servicing and edge-traversing costs, as well as vehicle capacities, are all time-based—
i.e....
Alternative Titles
Full title
Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_1993689683
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1993689683
Other Identifiers
ISSN
0254-5330
E-ISSN
1572-9338
DOI
10.1007/s10479-018-2777-3
