Research Article
Hybrid Optimization-Based Approach for Multiple Intelligent Vehicles Requests Allocation
Algorithm 1
Proposed hybrid optimization-based algorithm.
| Input: Requests list , Vehicles list , Distances matrix | | Output: Best allocation | | for to do | | generateValidSolution(, , ) | | end | | minimumOf() | | for to do | | if 25% of then | | = 20% | | else if 25% of AND 50% of then | | = 30% | | else if 50% of AND 75% of then | | = 40% | | else | | = 50% | | end | | crossover(least 20% of ) | | mutation(top 80% of ) | | minimum of | | minimum of | | for to of do | | generateValidSolution(, , ) | | getAllocationCost() | | | | while do | | for to do | | generateNeighborSolution() | | getAllocationCost() | | if then | | | | | | if then | | | | | | end | | else | | Generate: random number | | = | | if then | | | | | | end | | end | | end | | = | | end | | | | end | | if minimumOf() then | | minimumOf() | | end | | | | end | | |
|