Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
type: Item
instance of: scholarly article
title: Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
zbMATH Open document ID: 1200.65043
author: K. P. Anagnostopoulos
author: L. Kotsikas
published in: Applied Mathematics and Computation
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5798105
zbMATH Keywords: heuristic evaluation
zbMATH Keywords: extreme values statistics
zbMATH Keywords: simulated annealing
zbMATH Keywords: statistical tests
zbMATH Keywords: time-cost trade-off
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithm
zbMATH Keywords: confidence interval estimate
MaRDI profile type: Publication
full work available at URL: j.amc.2010.05.056
OpenAlex ID: W1974296411
cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial
cites work: Q4338964
cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
cites work: Interval estimation of a global optimum for large combinatorial problems
cites work: The discrete time-cost tradeoff problem revisited
cites work: Project scheduling. A research handbook.
cites work: Optimal procedures for the discrete time/cost trade-off problem in project networks
cites work: A network flow computation for project cost curves
cites work: Critical Path Problems with Concave Cost-Time Curves
cites work: Hardness of approximation of the discrete time-cost tradeoff problem
cites work: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
cites work: New computational results on the discrete time/cost trade-off problem in project networks
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q4365129
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
cites work: Bi-objective resource-constrained project scheduling with robustness and makespan criteria
cites work: A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
cites work: A Random Activity Network Generator
cites work: An evaluation of the adequacy of project network generators with systematically sampled networks
cites work: Q4179721
DOI: 10.1016/J.AMC.2010.05.056
description: scientific article; zbMATH DE number 5798105