Search

Browse

• Communities
• Authors
• Year
• Titles
• Subjects

My Space

• Login

Αλγόριθμος βελτιστοποίησης σμήνους μελισσών για πρόβλημα δρομολόγησης οχημάτων εφοδιαστικής

Papadopoulos dimitrios

Full record

---

Summary

The problem of routing vehicles results from delivering products to customers, starting from a given warehouse through a given transportation network.Due to existing limiting factors (vehicle’s capacity, length of trip), all customerscannot be serviced in one route, so it becomes necessary to define a number of routes (cyclical routes), where each starts and ends at the warehouse.The goal for solving this problem is minimizing the overall cost of producttransportation, namely minimizing the total distance covered and the total time necessary. The bee swarm algorithm is based on the synergy of a group of bees, in order to find an overall solution to the complex problems of combinatorial optimization. Each bee produces (ends up with) a solution to the problem. The algorithm has two stages.In the first stage, each bee with a given number of movements tries to optimize the solution to the problem, producing a new solution every time. Having figured out a part of the solution, it returns to the hive and the second stage begins, where all bees share their solutions. In this second stage, the bee either tries to convince the others to follow her to herdestination, or abandons her destination to follow another bee.In nature bees communicate through dancing movements informing the swarm for the quantity and the distance of food.In the algorithm the solution’s quality appears through an objective function (the function of total covered distance and time).

Available Files

Services