scientific article; zbMATH DE number 232390
From MaRDI portal
Publication:5287166
zbMath0787.90102MaRDI QIDQ5287166
R. Hirabayashi, Yasufumi Saruwatari, Naonori Nishida
Publication date: 19 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matchingbranch and boundtravelling salesmanexact algorithmcapacitated arc routingnode duplication lower bounding
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (max. 100)
A guided local search heuristic for the capacitated arc routing problem ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ An efficient transformation of the generalized vehicle routing problem ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ A Decade of Capacitated Arc Routing ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ An improved heuristic for the capacitated arc routing problem ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands ⋮ 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 ⋮ A cutting plane algorithm for the capacitated arc routing problem
This page was built for publication:
