On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem

Networks

Volumn 53, Issue 1, 2009, Pages 6-18

  Lewis, Mark W ^a  

^a MISSOURI WESTERN STATE UNIVERSITY   (United States)

Author keywords

Experimental design; Multicommodity flow problems; Network design

Indexed keywords

CAPACITATED NETWORK DESIGNS; CRITICAL EDGES; DECISION VARIABLES; EXPERIMENTAL DESIGN; FIXED CHARGES; GUIDED DESIGN SEARCHES; HIGH-QUALITY SOLUTIONS; MULTI COMMODITIES; MULTI-COMMODITY NETWORKS; MULTICOMMODITY FLOW PROBLEMS; NETWORK DESIGN; PREPROCESSING TECHNIQUES; SOLUTION SPACES;

CAPILLARY FLOW; COMMUNICATION CHANNELS (INFORMATION THEORY); STATISTICS; SUBMARINE GEOPHYSICS;

DESIGN OF EXPERIMENTS;

EID: 61349144214     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20255     Document Type: Article

References (37)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart, Designing and reporting on computational experiments with heuristic methods, J Heuristics 1 (1995), 19-32.
3. P.D. Berger and R.E. Maurer, Experimental design with applications in management, engineering and the sciences, Duxbury/Thompson Learning, Belmont, CA, 2002.
4. G.E.P Box and R.D. Meyer, An analysis for unreplicated fractional factorials, Technometrics 28 (1986), 11-18.
5. J.W. Chinneck and E.W. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA J Comput 3 (1991), 157-168.
6. G. Cornuejols and M. Dawande, A class of hard small 0-1 programs, INFORMS J Comput 11 (1999), 205-210.
7. T. Craniac, M. Gendreau, and J.M. Farvolden, A simplexbased Tabu search method for capacitated network design, INFORMS J Comput 12 (2000), 223-236.
8. G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS J Comput 10(1998), 1-11.
9. R. DeVor, T. Chang, and J. Sutherland, Statistical quality design and control: Contemporary concepts and methods, MacMillan Publishing Company, New York, NY, 1992.
10. J. Doucette and W. Grover, Comparison of mesh protection and restoration schemes and the dependency on graph connectivity, 3rd Int Workshop DRCN, Budapest, Hungary, 2001.
11. J. Doucette, W. Grover, and T. Bach, Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs, OSA Optical Fiber Comm Conf, Anaheim, California, 2001.
12. D. Dunn, W. Grover, and M. Macgregor, Comparison of k-shortest paths and maximum flow routing for network facility restoration, IEEE J Sel Areas Commun 12 (1994), 88-99.
13. M. Fischetti, C. Polo, and M. Scantamburio, A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem, Networks 44 (2004), 61-72.
14. G.T. Bailey and J. Moore, Optimality analysis of facility location problems using response surface methodology, Int J Phys Distribution Logist Management 31 (2001), 38-52.
15. J.W. Herrmann, G. Ioannou, I. Minis, and J.M. Proth, A dual ascent approach to the fixed-charge capacitated network design problem, Inst Syst Res 94 (1994), 1-30.
16. A. Holder, Designing radiotherapy plans with elastic constraints and interior point methods, Health Care Management Sci 6 (2000), 5-16.
17. K. Holmberg and J. Hellstrand, Solving the uncapacitated network design problem by a lagrangian heuristic and branchand-bound, Oper Res 46 (1998), 247-259.
18. K. Holmberg and D. Yuan, A lagrangian heuristic based branch-and-bound for the capacitated network design problem, Oper Res 48 (2000), 461-481.
19. K. Holmberg and D. Yuan, Optimization of internet protocol network design and routing, Networks 43 (2004), 39-53.
20. D. Hoskins, R. Turban, and C. Colbourn, Experimental designs in software engineering: D-Optimal designs and covering arrays, Proc 2004 ACM Workshop on Interdisciplinary Software Engineering Research, ACM, New York, NY, pp. 55-66.
21. R. Iraschko, M. MacGregor, and W. Grover, Optimal capacity placement for path restoration in STM or ATM mesh survivable networks, IEEE/ACM Trans Networking 6 (1998), 325-336.
22. R. Iraschko and W. Grover, A highly efficient pathrestoration protocol for management of optical network transport integrity, IEEE J Selected Areas Commun 18 (2000), 779-794.
23. T. Ivanova, L. Malone, and M. Mollaghasemi, Comparison of a two-stage group-screening design to a standard 2k-P design for a whole-line semiconductor manufacturing simulation model, Proc 1999 Winter Simulation Conf, vol. 1, P. Farrington, H. Nembhard, D. Sturrock, G. Evans (Editors), WSC, Phoenix, AZ, 1999, pp. 640-646.
24. D.R. Karger, Random sampling in cut, flow and network design problems, Math Oper Res 24 (1999), 383-413.
25. J. Kennington and K. Lewis, Generalized networks: The theory of preprocessing and an empirical analysis, INFORMS J Comput 16 (2004), 0162-0173.
26. J. Kennington and M. Lewis, The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms and an empirical analysis, INFORMS J Comput 13 (2001), 181-190.
27. M. Lewis, G. Kochenberger, and B. Alidaee, Using xQx to model and solve the uncapacitated task allocation problem, Oper Res Lett 33 (2005), 176-182.
28. M. Lewis, The effects of network characteristics on joint capacity optimization, Int J Oper Quant Management 10 (2004), 235-253.
29. M. Lewis, K. Lewis, and B. White, Guided design search in the interval bounded sailor assignment problem, Comput Oper Res 33 (2006), 1664-1680.
30. J.T Linderoth and M.W.P Savelsbergh, A computational study of search strategies for mixed integer programming, INFORMS J Comput 11 (1999), 173-187.
31. H. Luss, Operations research and capacity expansion problems: A survey, Oper Res 30 (1982), 907-947.
32. T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transport Sci 18 (1986), 1-55.
33. R. Mason, R. Gunst, and J. Hess, Statistical design and analysis of experiments, Wiley, New York, NY, 1989.
34. C. Mauro and D. Smith, Factor screening in simulation: evaluation of two strategies based on random balance sampling, Management Sci 30 (1984), 209-221.
35. D.C. Montgomery, Design and analysis of experiments, Wiley, New York, NY, 1984.
36. R. Ramaswami, Optical fiber communication: From transmission to networking, IEEE Commun Mag 40 (2002), 138-147.
37. G. Taguchi, A. Elsayed, and T. Hsiang, Quality engineering in production systems, McGraw-Hill, New York, 1989.