No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Optimization of the set head path for SMD mounting apparatus
Abstract
In this paper a method of set head path optimization while SMD mounting based on modeling of this path search as a transit transportation problem and realization of appropriate spreadsheet model MS Excel Solver is presented.
ResearchGate has not been able to resolve any citations for this publication.
The travelling salesman problem (TSP) is a well-known business problem, and variants like the maximum benefit TSP or the price collecting TSP may have numerous economic applications. We are looking at several different variants of TSP; all solved in spreadsheets, not using tailored solvers for TSP. As these problems are NP hard, solving those using standard LP/MIP solvers has been regarded feasible only for very small sized problems. However, a careful consideration of the spreadsheet layout may facilitate efficient software utilisation. For real world problems this can have considerable effects, and with the recent advancements in solver engines, problems previously regarded as big are now easily solvable in spreadsheets. This paper shows you how; and how the flexibility of spreadsheets makes it a convenient tool solving many variants of TSP, where tailored solvers simply would not fit.
Comparison of Optimization Techniques in Large Scale Transportation Problems
- T Kumar