A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

DOI10.1016/S0377-2217(97)00381-0zbMath0948.90143OpenAlexW1971435380MaRDI QIDQ1806891

Azuma Ohuchi, Taichi Kaji

Publication date: 20 December 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00381-0

zbMATH Keywords

simulated annealingtabu searchdirected acyclic graphgraph partitioningneighbourhood structurecompound moveminimum cost partition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Optimal Sequential Partitions of Graphs