Two-phased approach to the supply network reconfiguration problem

European Journal of Operational Research

Volumn 122, Issue 1, 2000, Pages 18-30

  Ross, Anthony D ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; DECISION MAKING; DECISION THEORY; HEURISTIC METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; RESOURCE ALLOCATION; SIMULATED ANNEALING; STRATEGIC PLANNING;

SUPPLY NETWORK RECONFIGURATION SYSTEMS;

DISTRIBUTION OF GOODS;

EID: 0033874166     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00063-6     Document Type: Article

References (23)

1. Abramson D. Constructing school timetables using simulated annealing: Sequential and parallel algorithms. Management Science. 37(1):1991;98-113.
2. Aiken C.H. Facility location models for distribution planning. European Journal of Operational Research. 22:1985;263-279.
3. E. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, Chicester, 1989.
4. CONDOR, Operations research: The next decade. Operations Research 36 (1988) 619-637.
5. CONDOR, Heuristic methods of location-allocation problems. SIAM Review 6(1) (1964) 37-53.
6. Eglese R. Simulated annealing: A tool for operational research. European Journal of Operational Research. 46:1990;271-281.
7. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research. 26(4):1978;992-1009.
8. Feterolf P., Anandanlingham G. Optimizing interconnections of local area networks: An approach using simulated annealing. ORSA Journal on Computing. 3(4):1991;275-287.
9. Gao L., Robinson E. A Dual-Based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Research Logistics. 39(2):1992;191-212.
10. Golden B., Skiscim C. Using simulated annealing to solve routing and location problems. Naval Research Logistics Quarterly. 33:1986;261-279.
11. Kelly J., Golden B., Assad A. Using simulated annealing to solve controlled rounding problems. ORSA Journal on Computing. 2(2):1990;174-185.
12. Kirkpatrick S., Gelatt C., Vecchi M. Optimization by simulated annealing. Science. 220:1983;671-680.
13. Klincewicz J., Luss H. A dual-based algorithm for multiproduct uncapacitated facility location. Transportation Science. 21:1987;198-206.
14. Lockwood C., Moore T. Harvest Scheduling with spatial constraints: A simulated annealing approach. Canadian Journal of Forest Research. 23:1993;468-478.
15. Marin A., Salmeron J. Tactical design of rail freight networks. Part II: Local search methods with statistical analysis. European Journal of Operational Research. 94(1):1996;43-53.
16. Metropolis N., Rosenbluth A., Rosenbluth A., Teller M., Teller E. Equation of state calculations by fast computing machines. Journal of Chemical Physics. 21:1953;1087-1092.
17. Murray A., Church R. Heuristic solution approaches to operational forest planning problems. OR Spektrum. 17:1995;193-203.
18. Pirlot M. General local search methods. European Journal of Operational Research. 92(3):1996;493-511.
19. A. Ross, M. Venkataramanan, K. Ernstberger, Reconfiguring the supply network using current performance data, Decisions Sciences, forthcoming.
20. Sear T.N. Logistics planning in the downstream oil industry. Journal of the Operational Research Society. 44(1):1993;9-17.
21. Simon H. Two heads are better than one: The collaboration between AI and OR. Interfaces. 17:1987;8-15.
22. Vernekar A., Anandalingham G., Dorny C. Optimization of resource locations in hierarchical computer networks. Computers & Operations Research. 17(4):1990;375-388.
23. R.L. Winkler, William L. Hays, Statistics, 2nd. ed., Holt, Rinehart and Winston, New York, 1975.