[HTML][HTML] GRASP with evolutionary path-relinking for the capacitated arc routing problem

FL Usberti, PM França, ALM França - Computers & Operations Research, 2013 - Elsevier
Abstract The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard
combinatorial optimization problem where, given an undirected graph, the objective is to find
a minimum cost set of tours servicing a subset of required edges under vehicle capacity
constraints. There are numerous applications for the CARP, such as street sweeping,
garbage collection, mail delivery, school bus routing, and meter reading. A Greedy
Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed …

GRASP with evolutionary path-relinking for the capacitated arc routing problem

F Luiz Usberti, P Morelato França… - … and Operations Research, 2013 - dl.acm.org
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial
optimization problem where, given an undirected graph, the objective is to find a minimum
cost set of tours servicing a subset of required edges under vehicle capacity constraints.
There are numerous applications for the CARP, such as street sweeping, garbage
collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized
Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared …
以上显示的是最相近的搜索结果。 查看全部搜索结果

Google学术搜索按钮

example.edu/paper.pdf
搜索
获取 PDF 文件
引用
References