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

DOI10.1016/S0377-2217(97)00381-0MaRDI QIDQ1806891zbMATH OpenOpenAlexFDO

Authors Taichi Kaji, Azuma Ohuchi

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 annealingdirected acyclic graphgraph partitioningtabu searchneighbourhood structurecompound moveminimum cost partition

Mathematics Subject Classification ID

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

Recommendations

• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• scientific article; zbMATH DE number 4064384
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• A parallel simulated annealing algorithm

Cites work

• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Optimal Sequential Partitions of Graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(2)

• scientific article; zbMATH DE number 7234705 (Why is no real title available?)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

This page was built for publication: A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

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