#combinatorial optimization

Combinatorial optimization is the process of searching for maxima (or minima) of an objective function F whose domain is a discrete but large configuration space. The space of possible solutions is typically too large to search exhaustively using pure brute force. In some cases, problems can be solved exactly using Branch and Bound techniques. However, in other cases no exact algorithms are…

All GPS navigation systems propose two options when it comes to route planning: the fastest and the shortest. The first one obviously targets minimum travel time, the second minimizes the distance travelled. With real time traffic information the fastest option will change based on traffic conditions. However, in general GPS navigators are not very intelligent when it comes to route planning…

Combinatorial optimization is the process of searching for maxima (or minima) of an objective function F whose domain is a discrete but large configuration space. The space of possible solutions is typically too large to search exhaustively using pure brute force. In some cases, problems can be solved exactly using Branch and Bound techniques. However, in other cases no exact algorithms are…

DEVELOPMENT OF A SMELL AGENT OPTIMIZATION ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS

DEVELOPMENT OF A SMELL AGENT OPTIMIZATION ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS

Abstract:

This thesis presents the development of smell agent optimization (SAO) algorithm. The developed algorithm consists of three modes (sniffing, trailing and random modes). The evaporation of smell molecules from the smell source is modelled into sniffing mode using the concept of the hydrostatic…