Introduction to Metaheuristics (2/9). Combinatorial Optimization problems

Classes for the Degree of Industrial Management Engineering at the University of Burgos.

[portiseremacunix]

Thanks! It is the only series of videos about metaheuristics on youtube!

[hanserj]

Such a clear and motivating content! Thanks!

[Snowmanver]

Thank you for the lecture, it is very useful and interesting!

[SaraH-kghx]

Great video thank u sir sir what are the methaheuristic methods that we could use to solve the shortest path problem I have already used ACO

[rafiqbodalal]

Hi Luis,
I'm currently studying the problem of weight optimization of truss structures where the link cross-sectional areas are considered design variables and subjected to a penalized cost function that incorporates structural weight with stress and displacement constraints. Since the design variables operate in the continuous domain and are selected from a predefined subset from R (0.1~35), I was wondering if my problem is classified as a combinatorial one, since the main goal of the problem is to find the "right" area of each link which reduces weight all the while not compromising structural integrity. As an example, the optimized areas of a 10 bar structure (solution vector) is: [23.522, 0.1, 25.364, 14.503, 0.1, 1.97, 12.418, 12.971, 20.050, 0.1]. Do the design variables have to be discrete so that they are an combinatorial problem or do they also extend to continuous domains? Thanks

[alexanderbarlse]

Hi Luis,
Great video, thank you!
I have a question.
I'm confused as to how linear programming (LP) is related to combinatorial optimization. Does LP belong to discrete or continuous optimization? After all LP problems use continuous variables, but serval places I have seen LP used to solve combinatorial problems, e.g., using LP-relaxation to solve an (mixed) integer problem. Can combinatorial problems be modeled as LP?
In advance, thank you!