An Exploration of Approximate Solution Strategies for Combinatorial Optimization Problems |
From inside the book
32 pages matching exchange improvement procedure in this book
Where's the rest of this book?
Results 1-3 of 32
Common terms and phrases
ACTIVITY LOCATION OBJECTIVE activity-location adjacent ANGELES THE UNIVERSITY applied Armour-Buffa ASSIGNED TO LOCATION average backtrack BEST ALTERNATE ASSIGNMENTS best solution better solutions calculated CALIFORN candidate set cluster analysis combinatorial optimization combinatorial optimization problems computation requirements considered constructive initial placement constructive procedure cost of assigning criteria D-matrix decision process decision tree distance efficient enumeration process et.al exchange improvement procedure expected value fixed cost floor plan layout flow dominance Graves-Whinston algorithm heuristic implemented implicit enumeration algorithm improved solution initial solution large scale problems limiting local optimum location modules LOCATION OBJECTIVE DIFFERENCE ment method minimize N30 problems NP-complete Nugent objective function options order exchange pair-wise exchange improvement partitioning problem partitioning scheme plant layout problem possible assignments potential quadratic assignment problem random starting solutions scheduling shaded square shown in Figure solu solution process solution quality solving Steinberg problem step sub-department modules sub-problems thesis tion traveling salesman problem UNIVERS UNIVERSITY LOS ANGELES Σ Σ