Course Hero Logo

Combinatorial Optimization.pdf - Combinatorial optimization...

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 4 out of 16 pages.

So far, we mostly looked atnumerical optimization with floating point decision variables.These are more generic irrespective of the fields the problem is arising from.There are alsodiscrete optimization problemswhere the decision variables take integervalues. There are two types: Integer programming and combinatorial problems.Integer Programming:Integer decision variablesNumerical optimization withround/floor/ceiling.Combinatorial Problems:Traveling SalesmanSchedulingTimetablingRoutingPacking/Cuttingand manymore …Several problem specific objectives, constraints, etc.requiring problem specific solutionproceduresCombinatorial optimization Problems1
Traveling Salesman Problem2The most famous combinatorial optimization problem is theTraveling Salesman Problem(TSP).Given a list ofncities and distances between each pair of cities,the objective of the TSP is to construct a closed tourVisiting each city just once with minimum total distance.The TSP is an example of anNP-completehardcombinatorial problemOnline resources available for TSP, e.g., software, etc.There are numerous TSP variants …NP: Non-deterministic Polynomial-time.Complexity of solving theseproblems increases much faster than polynomial (i.e., exponential) withincreasing size of the problem.
Cutting Stock Problem3TheCutting Stock Problemis an NP-complete optimization problem that arises inmany applications in industry.The classicone-dimensionalcutting stock problem is to determine how to cut rolls ofpaper of fixed-width into customer orders for smaller widths so as to minimize waste.Many variants of this problem exist…Packing ProblemPacking Problem(complementary to cutting problems) is to fill a larger space withspecified smaller shapes in the most economical (profitable) way.There aregeometric packing problemsin one dimension (1D), 2D and 3D,3D packing are those arise in filling delivery trucks or shipping containers.

Upload your study docs or become a

Course Hero member to access this document

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 16 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
N/A
Tags
Operations Research, Travelling salesman problem, NP complete, Combinatorial optimization, Cutting stock problem

Newly uploaded documents

Show More

Newly uploaded documents

Show More

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture