Search

Browse

• Communities
• Authors
• Year
• Titles
• Subjects

My Space

• Login

Cuckoo search algorithm for the green location routing problem

Pappas Anastasios

Full record

---

Summary

This thesis explores the application of the Cuckoo Search algorithm to the Location Routing Problem, a complex optimization challenge in logistics. The Location Routing Problem involves determining the optimal placement of facilities, such as warehouses or distribution centers, and designing the most efficient routes for capacitated vehicles to serve customers. The goal is to minimize operational costs, including the fixed costs of facility locations and the variable costs. The Cuckoo Search algorithm, inspired by the brood parasitism behavior of cuckoo birds, is a metaheuristic optimization technique known for efficiently exploring large and complex search spaces. In the context of the Location Routing Problem, the algorithm generates and iteratively improves candidate solutions by mimicking the natural process of laying eggs in the nests of other birds, allowing for a robust search for optimal solutions. This research implements the Cuckoo Search algorithm across 18 different datasets, each representing a unique logistics scenario, to demonstrate its effectiveness in solving the Location Routing Problem. This thesis provides insights into how the Cuckoo Search algorithm can be applied to optimize logistics operations.

Available Files

Services