Simulated annealing applied to the process allocation problem

DOI10.1016/0377-2217(92)90084-MzbMath0760.90080OpenAlexW1976541984MaRDI QIDQ1199515

Stella Sofianopoulou

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90084-m

zbMATH Keywords

heuristicssimulated annealingnetwork of processorsprocess allocationreal world telecommunications

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Metaheuristics: A bibliography ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ An algorithm for the generalized quadratic assignment problem ⋮ Formulating and solving production planning problems ⋮ Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows ⋮ Simulated annealing and genetic algorithms for scheduling products with multi-level product structure

Cites Work

• Optimization by Simulated Annealing
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Simulated annealing: A tool for operational research
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimum Allocation of Processes in a Distributed Environment: A Process-to-Process Approach
• Convergence of an annealing algorithm
• Using simulated annealing to solve routing and location problems
• Cooling Schedules for Optimal Annealing
• Simulated Annealing – An Annotated Bibliography
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Simulated annealing applied to the process allocation problem