32
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Integrated ANN-HMH Approach for Nonlinear Time-Cost Tradeoff Problem

&
Pages 456-471 | Received 11 May 2012, Accepted 30 Dec 2013, Published online: 06 Feb 2014

References

  • M. Ehrgott, and X. Gandibleux, “A survey and annotated bibliography of multiobjective combinatorial optimization,” OR Spectrum,22, 425–460 (2000).
  • K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, 6, 182–197 (2002).
  • J.H. Holland, “Adaptation in natural selection and artificial systems,” Univ of Mechigan: Press Ann Arbor Mich, (1975).
  • D. E. Goldberg, “Genetic algorithms in search optimization and machine learning,” Reading MA: Addison-Wesley,(1989).
  • R. Sivaraj, and T. Ravichandran, “A review of selection methods in genetic algorithm,” International Journal of Engineering Science and Technology, 3(5), 3792–3797 (2011).
  • C.-W. Feng, L. Liu, and S. A. Burns, “Using genetic algorithms to solve construction time-cost trade-off problems,” Journal of Computing in Civil Engineering, 11, 184–189 (1997).
  • B. K. Pathak and S. Srivastava, “MOGA based time-cost tradeoffs: responsiveness for project uncertainties,” Proc. IEEE Congress on Evolutionary Computation, CEC2007, 3085–3092 (2007).
  • B. K. Pathak, H. K. Singh, and S. Srivastava, “Multi-resource-constrained discrete time-cost tradeoff with MOGA based hybrid method,” Proc. IEEE Congress on Evolutionary Computation, CEC2007, 4425–4432 (2007).
  • B. K. Pathak, S. Srivastava, and K. Srivastava, “Neural network embedded multiobjective genetic algorithm to solve non-linear time-cost tradeoff problems of project scheduling,” Journal of Science and Industrial Research, 67(2), 124–131 (2008).
  • D. Xundi, L. Heng, Z. Saixing, W. Vivian, and G. Hongling, “A pareto multi-objective optimization approach for solving time-cost-quality tradeoff problems,” Technological and Economic Development of Economy, 17(1), 22–41 (2011).
  • B. Zahraie and M. Tavakolan, “Stochastic time-costresource utilization optimization using non-dominated sorting genetic algorithm and discrete fuzzy sets,” Journal of Construction Engineering and Management, 135(11), 1162–1173 (2009).
  • S. T. Ng and Y. Zhang, “Optimizing construction time and cost using ant colony optimization approach,” Journal of Construction Engineering and Management, 134(9), 721–728 (2008).
  • D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource- constrained project scheduling,” IEEE Journal of Transportations on Evolutionary Computation, 6(4), 333–346 (2002).
  • S. Christodoulou, “Scheduling resource-constrained Projects with ant colony optimization artificial agents,” Journal of Computing in Civil Engineering, 24(1), 45–55 (2010).
  • M. Vanhoucke, “New computational results for the discrete time/cost trade-off problem with time-switch constraints,” European Journal of Operational Research, 165, 359–374 (2005).
  • B. K. Pathak and S. Srivastava, “An Intelligent approach for resource-constrained nonlinear multi-objective time-cost tradeoff,” DEI Journal of Science and Engineering Research,14(1&2), 153–163 (2007).
  • P. De, E. D. James, B. Ghosh, and E. Wells, “The discrete time-cost tradeoff problem revisited,” European Journal of Operational Research, 81, 225–238 (1995).
  • S. Srivastava, B. K. Pathak, and K. Srivastava, “Project scheduling: time-cost tradeoff problems,” Computational Intelligence in Optimization, Springer-Verlag Berlin Heidelberg (Y Tenne and C-K Goh ed), 7, 325–357 (2010).
  • K. Deb, “Multi-objective optimization using evolutionary algorithms,” NewYork: JohnWiley and Sons, (2001).
  • C. M. Fonseca and P. J. Fleming, “Genetic algorithm for multiobjective optimization: formulation discussion and generalization,” Proc. of fourth International Conference on Genetic Algorithms, 416–423 (1993).
  • S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, 220, 671–680 (1983).
  • L. Fausett, “Fundamentals of neural networks,” NJ: Prentice Hall Englewood Cliffs, (1994).
  • K. H. Raj, R. S. Sharma, S. Srivastava, and C. Patvardhan, “Modelling of manufacturing process with ANNs for intelligent manufacturing,” International Journal of Machine Tools and Manufacture, 40, 851–868 (1999).
  • S. Srivastava, K. Srivastava, R. S. Sharma, K. H. Raj, and S. N. Dwivedi, “Multi-objective process optimization of hot closed die forging for intelligent manufacturing,” International Journal of Agile Manufacturing, 1, 61–69 (2004).
  • S. Srivastava, K. Srivastava, R. S. Sharma, and K. H. Raj, “Modelling of hot closed die forging of an automotive piston with ANN for intelligent manufacturing,” Journal of Science and Industrial Research, 63, 997–1005 (2004).
  • M. V. Arias and C.A.C. Coello, “Asymptotic convergence of metaheurisitcs for multiobjective optimization problems,” Soft Computing, 10, 1001–1005 (2005).
  • K. Srivastava, S. Srivastava, B. K. Pathak, and K. Deb, “Discrete time-cost tradeoff with a novel hybrid meta heuristics,” Lecture Notes in Economics and Mathematical System, Springer Publication, 634, 177–188 (2010).
  • L. Liu, S. Burns, and C. Feng, “Construction time-cost trade-off analysis using LP/IP hybrid method,” Journal of construction engineering and management, 121(4), 446–454 (1995).
  • B. K. Pathak, “Project scheduling using meta-heuristics,” Ph. D. Thesis, Dayalbagh Educational Institute, Dayalbagh, Agra, (2007).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.