Repeated matching heuristic for the single-source capacitated facility location problem

European Journal of Operational Research

Volumn 116, Issue 1, 1999, Pages 51-68

  Rönnqvist, Mikael ^a   Tragantalerngsak, Suda ^b   Holt, John ^b  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FACILITIES; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LOCATION; MATHEMATICAL MODELS; OPTIMIZATION;

REPEATED MATCHING HEURISTIC; SINGLE SOURCE CAPACITATED FACILITY LOCATION;

HEURISTIC METHODS;

EID: 0344771667     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00045-9     Document Type: Article

References (23)

1. Altinkemer, K., Gavish, B., 1991. Parallel savings based heuristics for the delivery problem. Operations Research 39, 456-469.
2. Barcelo, J., Casanovas, J., 1984. A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research 15, 212-226.
3. Beasley, J.E., 1993. Lagrangean heuristic for location problem. European Journal of Operational Research 65, 383-399.
4. Darby-Dowman, K., Lewis, H.S., 1988. Lagrangian relaxation and single source capacitated facility location problem. Journal of the Operational Research Society 39, 1035-1040.
5. Derigs, U., 1981. A shortest augmenting path method for solving minimal perfect matching problems. Networks 11, 379-390.
6. Derigs, U., Metz, A., 1986. On the use of optimal fractional matchings for solving the (integer) matching problem. Computing 36, 263-270.
7. Desrochers, M., Verhoog, T.W., 1991. A new heuristic for the fleet size and mix vehicle routing problem. Computers & Operations Research 18, 263-274.
8. Fisk, J., 1978. A solution procedure for a special type of capacitated warehouse location problem. The Logistics and Transportation Review 13, 305-320.
9. Erlenkotter, D., 1978. A dual-based procedure for uncapacitated facility location. Operations Research 26, 992-1009.
10. Forbes, M.A., Holt, J.N., Kilby, P.J., Watts, A.M., 1991. A matching algorithm with application to bus operations. Australasian Journal of Combinatorics 4, 71-85.
11. Forbes, M.A., 1992. Vehicle and Crew Scheduling in Public Transport. Ph.D. Dissertation, Department of Mathematics, University of Queensland, Brisbane.
12. Klincewicz, J.G., Luss, H., 1986. A Lagrangian relaxation heuristic for capacitated facility location with single source constraints. Journal of the Operational Research Society 37, 495-500.
13. Klincewicz, J.G., Luss, H., Pilches, M.G., 1990. Fleet size planning when outside carrier services are available. Transportation Science 24, 169-182.
14. Martello, S., Toth, P., 1990. Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York.
15. Neebe, A.W., Rao, M.R., 1983. An algorithm for the fixed-charge assigning users to sources problem. Journal of the Operational Research Society 34, 1107-1113.
16. Pirkul, H., 1987. Efficient algorithm for the capacitated concentrator location problem. Computers & Operations Research 14, 197-208.
17. Ryan, D.M., 1980. ZIP - A zero-one integer programming package for scheduling. Department of Theoretical and Applied Mechanics, University of Auckland.
18. Solomon, M., 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35, 254-265.
19. Sridharan, R., 1986. A heuristic Lagrangian algorithm for the capacitated plant location problem - A comment. European Journal of Operational Research 23, 264-265.
20. Sridharan, R., 1993. A Lagrangian heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research 66, 305-312.
21. Teitz, M.B., Bart, P., 1968. Heuristic method for estimating the general vertex median of weighted graph. Operations Research 16, 955-961.
22. Wark, P., Holt, J., 1994. A repeated matching heuristic for the vehicle routing problem. Journal of the Operational Research Society 45, 1156-1167.
23. Wark, P., Holt, J., Rönnqvist, M., Ryan, D., 1997. Aircrew schedule generation using repeated matching. European Journal of Operational Research 102, 21-35.