Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
From MaRDI portal
Publication:708169
DOI10.1016/j.amc.2010.05.056zbMath1200.65043OpenAlexW1974296411MaRDI QIDQ708169
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
algorithmnumerical examplessimulated annealingstatistical teststime-cost trade-offconfidence interval estimateextreme values statisticsheuristic evaluation
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Bi-objective resource-constrained project scheduling with robustness and makespan criteria
- The discrete time-cost tradeoff problem revisited
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Project scheduling. A research handbook.
- Hardness of approximation of the discrete time-cost tradeoff problem
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- An evaluation of the adequacy of project network generators with systematically sampled networks
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- A Network Flow Computation for Project Cost Curves
- New computational results on the discrete time/cost trade-off problem in project networks
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
- Interval estimation of a global optimum for large combinatorial problems
- A Random Activity Network Generator
- Equation of State Calculations by Fast Computing Machines
- Critical Path Problems with Concave Cost-Time Curves
- Experimental evaluation of heuristic optimization algorithms: A tutorial
This page was built for publication: Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
