Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems
Open Access
- 1 November 2017
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 60, 241-255
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling ProblemComputers & Operations Research, 2016
- Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospectsJournal of Global Optimization, 2015
- Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic AlgorithmIEEE Access, 2015
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windowsComputers & Operations Research, 2014
- Ant colony optimisation for vehicle traffic systems: applications and challengesInternational Journal of Bio-Inspired Computation, 2014
- A survey on optimization metaheuristicsInformation Sciences, 2013
- Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithmsGenetic Programming and Evolvable Machines, 2013
- Ant colony optimization-based algorithm for airline crew scheduling problemExpert Systems with Applications, 2011
- Event-based MILP models for resource-constrained project scheduling problemsComputers & Operations Research, 2011
- Solving partial constraint satisfaction problems with tree decompositionNetworks, 2002