Now showing items 1-3 of 3
Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems
Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and industrial domains. The goal of these problems is to find a feasible assignment for a group ...
Nature-inspired heuristics for the multiple-vehicle selective pickup and delivery problem under maximum profit and incentive fairness criteria
This work focuses on wide-scale freight transportation logistics motivated by the sharp increase of on-line shopping stores and the upsurge of Internet as the most frequently utilized selling channel during the last decade. ...
Quantitative Analysis and Performance Study of Ant Colony Optimization Models Applied to Multi-Mode Resource Constraint Project Scheduling Problem
Constraint Satisfaction Problems (CSP) belongs to this kind of traditional NP-hard problems with a high impact in both, research and industrial domains. However, due to the complexity that CSP problems exhibit, researchers ...