ResearchProject

ResearchProject - Applications Add priorities to the...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
Project in Operations Research
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Project Souces Many departments across campus Bioinformatics Engineering Business Business school courses BMGT332: Operation Research for Management Decisions
Background image of page 2
Operations Management Essential business functions Cost-competitive businesses need efficient operations Walmart/Big box retailers Banks Operations deal with optimization Routes Technology Labor
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Premise Variant of a traveling salesman problem Given list of cities and distances between them Objective is to create a best path Visit all nodes exactly once Least cost path to do so
Background image of page 4
Premise Complex problem Computationally intensive to find optimal NP-hard Developing a heuristic to find a good answer Efficient Polynomial time Works on large problems
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Applications Add priorities to the cities/nodes Additional constraints on order of delivery Emergency delivery of cargo to retailers Delivery of vaccines/treatments Delivery of troops in warzone Previous Work N-opt procedures Usually done with 2-opt or 3-opt Switch N paths at a time Check whether improvement was made Repeat until no changes remain Example Lin-Kernighan Swap pair of subtours Expanding upon n-opt procedures Among best used in practice Steps Develop framing application Written in Java Visually represent problem Devise base heuristic Base on specific case with known solution Optimize for specific case Generalize Questions?...
View Full Document

Page1 / 9

ResearchProject - Applications Add priorities to the...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online