scientific article; zbMATH DE number 232390

zbMATH Open0787.90102MaRDI QIDQ5287166FDOQ5287166

Authors Ryuichi Hirabayashi, Yasufumi Saruwatari, Naonori Nishida

Publication date 19 May 1994

zbMATH Keywords

matchingexact algorithmbranch and boundcapacitated arc routingtravelling salesmannode duplication lower bounding

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)

Recommendations

• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• The Capacitated Arc Routing Problem: Lower bounds
• Approximate solutions for the capacitated arc routing problem
• New lower bounds for the Capacitated Arc Routing Problem

Cited in

(17)

• An efficient transformation of the generalized vehicle routing problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Evolutionary algorithms for periodic arc routing problems
• A guided local search heuristic for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• The capacitated arc routing problem: exact algorithms
• The open capacitated arc routing problem
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• A decade of capacitated arc routing
• 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
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• A cutting plane algorithm 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 Q5287166)