scientific article; zbMATH DE number 1054960

MaRDI QIDQ4350080zbMATH OpenFDO

Authors Leon Li, Richard Eglese

Publication date 11 December 1997

zbMATH Keywords

heuristictabu searcharc routing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06)

Recommendations

• A deterministic tabu search algorithm for the capacitated arc routing problem
• The capacitated arc routing problem. A heuristic algorithm
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• scientific article; zbMATH DE number 1568943

Cited in

(14)

• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• Combinatorial optimization and green logistics
• On matchings, T‐joins, and arc routing in road networks
• A deterministic tabu search algorithm for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Metaheuristics: A bibliography
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The open capacitated arc routing problem
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
• A scatter search for the periodic capacitated arc routing problem
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• Combinatorial optimization and green logistics
• GRASP with evolutionary path-relinking for the capacitated arc routing problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350080)