Parametric ghost image processes for fixed-charge problems: A study of transportation networks

Journal of Heuristics

Volumn 11, Issue 4, 2005, Pages 307-336

  Glover, Fred ^a   Amini, Mehdi ^b   Kochenberger, Gary ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF MEMPHIS   (United States)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Fixed charge problems; Generalized networks; Ghost image processes; Networks; Tabu search

Indexed keywords

FIXED-CHARGE PROBLEMS; GENERALIZED NETWORKS; GHOST IMAGE PROCESSES; TABU SEARCH;

COMPUTATIONAL METHODS; COMPUTER APPLICATIONS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SEARCH ENGINES;

IMAGE PROCESSING;

EID: 24344508111     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-005-2135-x     Document Type: Review

References (58)

1. Adlakha, V. and K. Kowalski. (2003). "A Simple Heuristic for Solving Small Fixed-Charge Transportation Problems." Omega 31, 205-211.
2. Balas, E. and M.W. Padberg. (1976). "Set Partitioning: A Survey." SIAM Review 18, 710-760.
3. Balinski, M.L. (1961). "Fixed Cost Transportation Problem." Naval Research Logistics Quarterly 8, 41-54.
4. Barr, R.S., F. Glover, and D. Klingman. D. (1981). "A New Optimization Method for Large Scale Fixed Charge Transportation Problems." Operations Research 29, 443-463.
5. Bell, G.J., B.W Lamar, and C.A. Wallace. (1999). "Capacity Improvement, Penalties, and the Fixed Charge Transportation Problem." Naval Research Logistics Quarterly 46, 341-355.
6. Cabot, A.V. and S.S Erenguc. (1984). "Some Branch and Bound Procedures for Fixed Charge Transportation Problems," Naval Research Logistics Quarterly 31, 145-154.
7. Cabot, A.V. and S.S. Erenguc. (1986). "Improved Penalties for Fixed Cost Transportation Problems." Naval Research Logistics Quarterly 31, 856-869.
8. Cooper, L. (1975). "The Fixed Charge Problem-1: A New Heuristic." Computers and Mathematics with applications 1(1), 89-96.
9. Cooper, L. and C. Drebes. (1967). "An Approximation Algorithm for the Fixed Charge Problem." Naval Research Logistics Quarterly 14, 89-96.
10. Cornuejols, G., L. Fisher, and G.L. Nemhauser. (1977). "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms." Management Science 23, 789-810.
11. Crainic, T.G., A. Frangioni, and B. Gendron. (2001). "Bundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design." Discrete Applied Mathematics 112, 73-99.
12. Crainic, T.G., B. Gendron, and G. Hernu. 2004. A slope scaling/Lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics 10(5), 525-545.
13. Denzler, D.R. (1964). "An Approximate Algorithm for the Fixed Charge Problem." Naval Research Logistics Quarterly 16, 411-416.
14. Diaby, M. (1991). "Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problem." Journal of Operation Research Society 42, 991-1001.
15. Dongarra, J.J. (2002). "Performance of Various Computers Using Standard Linear Equations Software." Research working paper CS-89-85, University of Tennessee, Knoxville, TN 37996.
16. Dwyer, P.S. (1966). "Use of Completely Reduced Numbers in Solving Transportation Problems with Fixed Charge." Naval Research Logistics Quarterly 13(3), 289-313.
17. Fisk, J. and P.G. McKeown. (1979). "The Pure Fixed Charge Transportation Problem." Naval Research Logistics Quarterly 26, 631-641.
18. Gendron, B., J.Y. Potvin, and P. Sorian. (2003a). "A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements." Annals of Operations Research 122, 193-217.
19. Gendron, B., J. Y. Potvin, and P. Sorian. (2003b). "A Parallel Hybrid Heuristic for the Multicommodity Capacitated Location Problem with Balancing Requirements. Parallel Computing 29, 592-606.
20. Glover, F. (1994). "Optimization by Ghost Image Processes in Neural Networks." Computers and Operations Research 21(8) 801-822.
21. Glover, F. 1996. GN2PC: An MS DOS Based Network Optimizing System.
22. Glover, F., M.M. Amini, and G. Kochenberger. (2003). "Discrete Optimization via Netform Representations and a New Dynamic Branch and Bound Method." Working research paper, University of Colorado-Boulder, CO.
23. Glover, F., D. Klingman, and N. Phillips. (1992). Network Models in Optimization and their Applications in Practice. New York:Wiley.
24. Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers. Hingham, MA.
25. Gottlieb, J. and C. Eckert. (2002). "A Comparison of Two Representations for the Fixed Charge Transportation Problem." In J.J. Merelo et al. (eds.), Parallel Problem Solving From Nature - PP3NVII, Lecture Notes in Computer Science Vol. 2439. Springer Publishing Company, pp. 77-87.
26. Gray, P. (1971). "Exact Solution of the Fixed Charge Transportation Problem." Operations Research 19, 1529-1538.
27. Hirsch, W.M. and G.B. Dantzig. (1968). "The Fixed Charge Problem." Naval Research Logistics Quarterly 15, 413-424.
28. Kennington, J.L. (1976). "The Fixed Charge Transportation Problem: A Computational Study with a Branch and Bound Code."AIIE Transaction 8, 241-247.
29. Kennington, J.L. and E. Unger. (1976). "A New Branch and Bound Algorithm for the Fixed Charge Transportation Problem." Management Science 22, 1116-1126.
30. Khang, D.B. and O. Fujiwara. (1991). "Approximation Solution of Capacitated Fixed-Charge Minimum Cost Network Flow Problems." Networks 21, 689-704.
31. Kim, D. and P.M. Pardalos. (1999). "Ä Solution Approach to the Fixed-Charge Network Flow Problem Using a Dynamic Slope Scaling Procedure." Operations Research Letters 24, 195-203.
32. Kim, D. and P.M. Pardalos. (2000). "Dynamic Slope Scaling and Trust Interval Techniques for Solving Concave Piecewise Linear Network Flow Problems." Networks 35, 216-222.
33. Klingman, D., A. Napier, and J. Stutz. (1974). "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Network Problems." Management Science 5, 814-821.
34. Kuhn, H.W. and W.J Baumol. (1961). "An Approximate Algorithm for the Fixed Charge Transportation Problem." Naval Research Logistics Quarterly 9(1), 1-16.
35. Lamar, B.W. and C.A. Wallace. (1997). "Revised Modified Penalties for Fixed Charge Transportation Problems." Management Science 43, 1431-1436.
36. Luna, H.P.L., N. Ziviani, and R.M.B. Cabral. (1987). "The Telephonic Switching Center Network Problem: Formalization and Computational Experience." Discrete and Applied Mathematics 18, 199-210.
37. McKeown, P.G. (1975). A Vertex Ranking Procedure for Solving the Linear Fixed Charge Problem." Operations Research 23, 1183-1191.
38. McKeown, P.G. (1981). "A Branch-and-Bound Algorithm for Solving Fixed Charge Problems." Naval Research Logistics Quarterly 28, 607-617.
39. McKeown, P.G. and C.T. Ragsdale. (1990). "A Computational Study of Using Preprocessing and Stronger Formulations to Solve General Fixed Charge Problem." Operations Research 17, 9-16.
40. McKeown, P.G. and P. Sinha. (1980). "An Easy Solution to Special Class of Fixed Charge Problems." Naval Research Logistics Quarterly 2, 621-624.
41. Mirzain, A. (1985). "Lagrangian Relaxation for the Star-Star Concentrator Location Problem: Approximation Algorithm and Bounds." Networks 15, 1-20.
42. Murty, K.G. (1968). "Solving the Fixed Charge Problem by Ranking Extreme Points." Operations Research 16, 268-279.
43. Nozick, L. and M. Turnquist. (1998a). "Two-Echelon Inventory Allocation and Distribution Center Location Analysis." In Proceedings of Tristan III (Transportation Science Section of INFORMS), San Juan, Puerto Rico.
44. Nozick, L. and M. Turnquist. (1998b). "Integrating Inventory Impacts into a Fixed Charge Model for Locating Distribution Centers." Transportation Research Part E 31 E (3), 173-186.
45. Ortega, F. and L.A. Wolsey. (2003). "A Branch-and-Cut Algorithm for the Single-Commodity, Uncapacitated, Fixed-Charge Network Flow Problem." Networks 41, 143-158.
46. Palekar, U.S., M.K. Karwan, and S. Zionts. (1990). "A Branch and Bound Method for the Fixed Charge Transportation Problem." Management Science 36, 1092-1105.
47. Rothfarb, B., H. Frank, D.M. Rosembaun, and K. Steiglitz. (1970). "Optimal Design of Offshore Natural-Gas Pipeline Systems." Operations Research 18, 992-1020.
48. Rousseau, J.M. (1973). "A Cutting Plane Method for the Fixed Cost Problem." Doctoral dissertation Massachusetts Institute of Technology. Cambridge, MA.
49. Schaffer, J.E. (1989). "Use of Penalties in the Branch-and-Bound Procedure for the Fixed Charge Transportation Problem." European Journal of Operations Research 43, 305-312.
50. Shetty, U.S. (1990). "A Relaxation Decomposition Algorithm for the Fixed Charge Network Problem." Naval Research Logistics Quarterly 32(2), 327-340.
51. Steinberg, D.I. (1970). "The Fixed Charge Problem." Naval Research Logistics Quarterly 7(2), 217-236.
52. Steinberg, D.I. (1977). "Designing a Heuristic for the Fixed Charge Transportation Problem." Reprints in Mathematics and the Mathematical Sciences. Southern Illinois University at Edwardsville, Edwardsville. IL
53. Sun, M., J.E. Aronson, P.G. McKeown, and D. Drinka. (1998). "A Tabu Search Heuristic Procedure for the Fixed Charge Transportation Problem." European Journal of Operational Research 106, 441-456.
54. Sun, M. and P.G. McKeown. (1993). Tabu Search Applied to the General Fixed Charge Problems." Annals of Operations Research 41(1-4), 405-420.
55. Walker, W.E. (1976). "A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem." Management Science 22(3), 587-596.
56. Woodruff, D. (1995). "Ghost Image Processing for Minimum Covariance Determinant Estimators." ORSA Journal on Computing 7, 468-473.
57. Wright, D. and C. Haehling von Lanzenauer. (1989). "Solving the Fixed Charge Problem with Lagrangian Relaxation and Cost Allocation Heuristics." European Journal of Operations Research 42, 304-312.
58. Wright, D. and C. Haehling von Lanzenauer. (1991). "COLE: A New Heuristic Approach for Fixed Charge Problem Computational Results." European Journal of Operations Research 52, 235-246.