Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering

Theses/Dissertations

2012

Metaheuristics

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Solving Combinatorial Optimization Problems Using Genetic Algorithms And Ant Colony Optimization, Gautham Puttur Rajappa Aug 2012

Solving Combinatorial Optimization Problems Using Genetic Algorithms And Ant Colony Optimization, Gautham Puttur Rajappa

Doctoral Dissertations

This dissertation presents metaheuristic approaches in the areas of genetic algorithms and ant colony optimization to combinatorial optimization problems.

Ant colony optimization for the split delivery vehicle routing problem

An Ant Colony Optimization (ACO) based approach is presented to solve the Split Delivery Vehicle Routing Problem (SDVRP). SDVRP is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) wherein a customer can be visited by more than one vehicle. The proposed ACO based algorithm is tested on benchmark problems previously published in the literature. The results indicate that the ACO based approach is competitive in both solution quality and solution …


Incorporating Memory And Learning Mechanisms Into Meta-Raps, Arif Arin Jul 2012

Incorporating Memory And Learning Mechanisms Into Meta-Raps, Arif Arin

Engineering Management & Systems Engineering Theses & Dissertations

Due to the rapid increase of dimensions and complexity of real life problems, it has become more difficult to find optimal solutions using only exact mathematical methods. The need to find near-optimal solutions in an acceptable amount of time is a challenge when developing more sophisticated approaches. A proper answer to this challenge can be through the implementation of metaheuristic approaches. However, a more powerful answer might be reached by incorporating intelligence into metaheuristics.

Meta-RaPS (Metaheuristic for Randomized Priority Search) is a metaheuristic that creates high quality solutions for discrete optimization problems. It is proposed that incorporating memory and learning …