A heuristic procedure for path location with multisource demand

INFOR

Volumn 41, Issue 2, 2003, Pages 165-177

  Fernández, Pascual ^a   Marín, Alfredo ^a  

^a Facultad de Matemáticas   (Spain)

Author keywords

Lagrangian relaxation; Multisource; Path location; Subgradient optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; OPTIMIZATION; RELAXATION PROCESSES;

LAGRANGIAN RELAXATION; PATH LOCATION; SUBGRADIENT OPTIMIZATION;

MOTION PLANNING;

EID: 0345015318     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.2003.11732674     Document Type: Article

References (20)

1. Balakrishnan A., Magnanti T.L. and Wong R.T. (1989), A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37 (5), 716-740.
2. Beasley J.E. (1989), OR-Library: Distributing Test Problems by Electronic Mail. European Journal of Operational Research, 43, 197-205.
3. Berman O. (1997), Deterministic flow-demand location problems. Journal of the Operational Research Society, 48, 75-81.
4. Caprara A. and Salazar Gonzalez J.J. (1996), A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem. Top, 4 (1), 135-164.
5. Cornuejols, G. and Thizy, J.M. (1982), Some facets for the Simple Plant Location polytope. Mathematical Programming, 23, 50-74.
6. Current J. and Marsh M. (1993), Multiobjective transportation network design and routing problems: Taxonomy and annotation. European Journal of Operational Research, 65, 4-19.
7. Current J. and Pirkul H. (1991), The hierarchical network design problem with transshipment facilities. European Journal of Operational Research, 52, 338-347.
8. Current J., Pirkul H. and Rolland E. (1994), Efficient algorithms for solving the shortest covering path problem. Transportation Science, 28 (4), 317-327.
9. Current J.R., ReVelle C.S. and Cohon J.L. (1984), The shortest covering path problem: an application of locational constraints to network design. Journal of Regional Science, 24 (2), 161-183.
10. Current J.R., ReVelle C.S. and Cohon J.L. (1985), The maximum covering/shortest path problem: A multiobjective network design and routing formulation. European Journal of Operational Research, 21, 189-199.
11. Current J.R., ReVelle C.S. and Cohon J.L. (1986), The hierarchical network design problem. European Journal of Operational Research, 27, 57-66.
12. Current J. and Schilling D.A. (1994), The median tour and maximal covering tour problems: formulations and heuristics. European Journal of Operational Research, 73, 114-126.
13. Duin C. and Volgenant A. (1989), Reducing the hierarchical network design problem. European Journal of Operational Research, 39, 332-344.
14. Finkelstein S., Schkolnick M. and Tiberio P. (1988), Physical database design for relational databases. ACM Transactions on Database Systems, 13, 91-128.
15. Garey M.R. and Johnson D.S. (1979) Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Co., New York.
16. Hellstrand J., Larsson T. and Migdalas A. (1992), A characterization of the uncapacitated network design polytope. Operations Research Letters, 12, 159-163.
17. Herrmann J.W., Ioannon G., Minis I. and Proth J.M. (1996), A dual ascent approach to the fixed-charge capacitated network design problem. European Journal of Operational Research, 95, 476-490.
18. Pirkul H., Current J. and Nagarajan V. (1991), The hierarchical network design problem: A new formulation and solution procedures. Transportation Science, 25 (3), 175-182.
19. ReVelle C.S. and Laporte G. (1996), The plant location problem: new models and research prospects. Operations Research, 44 (6), 864-874.
20. Sancho N.G.F. (1996), The hierarchical network design problem with multiple primary paths. European Journal of Operational Research, 96, 323-328.