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

DOI10.1016/J.AMC.2010.05.056zbMATH Open1200.65043OpenAlexW1974296411MaRDI QIDQ708169FDOQ708169

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

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

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)