Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem

DOI10.1016/J.AMC.2010.05.056MaRDI QIDQ708169zbMATH OpenOpenAlexFDO

Authors K. P. Anagnostopoulos, L. Kotsikas

Publication date 11 October 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2010.05.056

zbMATH Keywords

simulated annealingnumerical examplesalgorithmstatistical teststime-cost trade-offconfidence interval estimateextreme values statisticsheuristic evaluation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Recommendations

• New computational results on the discrete time/cost trade-off problem in project networks
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• The discrete time-cost tradeoff problem revisited
• Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
• The discrete time/cost trade-off problem: Extensions and heuristic procedures

Cites work

• scientific article; zbMATH DE number 3615762 (Why is no real title available?)
• scientific article; zbMATH DE number 1016767 (Why is no real title available?)
• scientific article; zbMATH DE number 1082102 (Why is no real title available?)
• A Random Activity Network Generator
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• A network flow computation for project cost curves
• An evaluation of the adequacy of project network generators with systematically sampled networks
• Bi-objective resource-constrained project scheduling with robustness and makespan criteria
• Critical Path Problems with Concave Cost-Time Curves
• Equation of state calculations by fast computing machines
• Experimental evaluation of heuristic optimization algorithms: A tutorial
• Hardness of approximation of the discrete time-cost tradeoff problem
• Interval estimation of a global optimum for large combinatorial problems
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• New computational results on the discrete time/cost trade-off problem in project networks
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by simulated annealing
• Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
• Project scheduling. A research handbook.
• The discrete time-cost tradeoff problem revisited

Cited in

(2)

• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
• A float-path theory and its application to the time-cost tradeoff problem

This page was built for publication: Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem

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