Guided construction search metaheuristics for the capacitated p-median problem with single source constraint

Journal of the Operational Research Society

Volumn 58, Issue 1, 2007, Pages 100-114

  Osman, I H ^a   Ahmadi, S ^b  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

^b DE MONTFORT UNIVERSITY   (United Kingdom)

Author keywords

Data structures; Facility location; Greedy random adaptive search procedure; Periodic

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATA STRUCTURES; LOCATION; METADATA; PROBLEM SOLVING; SET THEORY;

FACILITY LOCATION; GREEDY RANDOM ADAPTIVE SEARCH PROCEDURE; SEARCH METAHEURISTIC FRAMEWORK; SINGLE SOURCE CONSTRAINT;

HEURISTIC METHODS;

EID: 33845534241     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602135     Document Type: Article

References (52)

1. Ahmadi S and Osman IH (2004). Density based problem space search for the capacitated clustering p-median problem. Ann Opl Res 131: 21-43.
2. Ahmadi S and Osman IH (2005). Greedy random adaptive memory programming search for the capacitated clustering problem. Eur J Opl Res 162: 30-44.
3. Baldacci R, Hadjiconstantinou E, Maniezzo V and Mingozzi A (2002). A new method for solving capacitated location problems based on a set partitioning approach. Comput Opl Res 29: 365-386.
4. Beck MP and Mulvey JM (1982). Constructing optimal index funds Technical report, Report No. EES-82-1, Princeton University.
5. Bellman RE (1957). Dynamic Programming. Princeton University Press: Princeton, New Jersey.
6. Breedam AV (2001). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Opl Res 28: 289-315.
7. Brücker P (1977). On the complexity of clustering problems. In: Henn R, Korte B, Oettli W (eds). Optimization and Operations Research: Proceedings of a Workshop held at the University of Bonn, October 2-8. Springer-Verlag, Heidelberg, pp 45-54.
8. Chhajed D, Francis RL and Lowe TJ (1993). Contributions of operations research to location analysis. Location Sci 1: 263-287.
9. Chiang WC and Russell R A (1997). A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J Comput 9: 417-430.
10. Diaz JA and Fernandez E (2004). Hybrid scatter search and path relinking for the capacitated p-median problem. Eur J Opl Res (in press); Available online, accessed 21 November 2004.
11. Dongarra J (2005). Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, Available at http://www.netlib.org/ benchmark/performance.ps.
12. Festa P and Resende M (2002). GRASP: An annotated bibliography. In: Ribeiro C and Hansen P (eds). Essays and Surveys on Metaheuristics. Kluwer Academic Publishers, Boston, pp 325-367.
13. Franca PM, Sosa NG and Pureza VM (1999). An adaptive tabu search approach for the capacitated clustering problem. Int Transac Opl Res 6: 665-678.
14. Gendreau M, Hertz A and Laporte G (1992). New insertion and postoptimization procedures for the traveling salesman problem. Opl Res 40: 1086-1094.
15. Glover F (1997). Tabu search and adaptive memory programmingadvances, applications and challenges. In: Barr R, Helgason and Kennington (eds). Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies. Kluwer, Boston, MA, pp 1-75.
16. Hansen P and Jaumard B (1997). Cluster analysis and mathematical programming. Math Program 79: 191-215.
17. Hansen P, Jaumard B and Sanlaville E (1993). Weight constrained minimum sum-of-stars clustering, Technical report, Gerad Technical Report G-93-38.
18. Hansen P and Mladenovic N (2001). Variable neighborhood search: Principles and applications. Eur J Opl Res 130: 449-467.
19. Hansen P, Mladenovic N and Perez-Britos D (2001). Variable neighborhood decomposition search. J Heuristics 7: 335-350.
20. Hansen P, Pedrosa ED and Ribeiro CC (1994). Modelling location and sizing of offshore platforms. Eur J Opl Res 72: 602-606.
21. Hasan M and Osman IH (1995). Local search algorithms for the maximal planar layout problem. Int Transac Opl Res 2: 89-106.
22. Karimi J (1986). An automated software design methodology using capo. J Mngt Inform Syst 3: 71-100.
23. Klein K and Aronson JE (1991). Optimal clustering: a model and method. Naval Res Logistics 38: 447-461.
24. Koskosidis YA and Powell WB (1992). Clustering algorithms for consolidation of customer orders into vehicle shipments. Transport Res 26B: 365-379.
25. Lorena LAN and Senne ELF (2004). A column generation approach to capacitated p-median problems. Comput Opl Res 31: 863-876.
26. Maniezzo V, Mingozzi A and Baldacci R (1998). A bionomic approach to the capacitated p-median problem. J Heuristics 4: 263-280.
27. Mirzaian A (1985). Lagrangian relaxation for the start-star concentrator location problem: approximation algorithms and bounds. Networks 15: 1-20.
28. Mulvey JM and Beck MP (1984). Solving capacitated clustering problems. Eur J Opl Res 18: 339-348.
29. Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Opl Res 41: 421.
30. Osman IH (1995a). Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches. OR Spektrum 17: 211-225.
31. Osman IH (1995b). An introduction to metaheuristics. In: Lawrence M and Wilsdon C (eds). Operational Research Tutorial Papers. Operational Research Society Press, Birmingham, pp 92-122.
32. Osman IH (2003a). Focused issue on applied meta-heuristics. Comput Indust Eng 44: 205-207.
33. Osman IH (2003b). Metaheuristics: models, analysis and directions. A tutorial paper presented at the joint EURO/INFORMS meeting, Instanbul, Turkey, July 6-10.
34. Osman IH (2004). Metaheuristics: models, design and analysis. In: Kozan E (ed). Proceedings of the Fifth Asia-Pacific Industrial Engineering and Management Systems Conference & the Seventh Asia-Pacific division meeting of the International Foundation of Production Research, December 12-15, 2004. ANA Hotel, Gold Coast, Australia: Queensland University of Technology, Brisbane, Australia, pp 1-16.
35. Osman IH (2006). A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem. Comput Opl Res 33: 2526-2546.
36. Osman IH and Al-Ayoubi B (2005). MIC analysis for comparing meta-heuristics. In: Proceedings of the 6th Metaheuristics International Conference. University of Vienna, Vienna, Austria, pp 725-732.
37. Osman IH, Al Ayoubi B and Barake M (2003). A greedy random adaptive search procedure for the weighted maximal planar graph problem. Comput Industl Eng 45: 635-651.
38. Osman IH and Christofides N (1994). Capacitated clustering problems by hybrid simulated annealing and tabu search. Int Transac Opl Res 1: 317-336.
39. Osman IH and Kelly JP (1996a). Metaheuristics: an overview. In: Osman IH and Kelly JP (eds). Metaheuristics, Theory and Applications, Kluwer Academic Publishers, Boston, pp 1-21.
40. Osman IH and Kelly JP (1996b). Metaheuristics, Theory and Applications. Kluwer Academic Publishers: Boston.
41. Osman IH and Laporte G (1996). Metaheuristics: a bibliography. Ann Opl Res 63: 513-623.
42. Osman IH and Wassan NA (2002). A reactive tabu search metaheuristic for the vehicle routing problem with backhauls. J Scheduling 5: 265-285.
43. Pitsoulis L and Resende M (2002). Greedy randomized adaptive search procedures. In: Pardalos P and Resende M (eds). Handbook of Applied Optimization. Oxford University Press, Oxford, UK, pp 168-183.
44. Ribeiro C and Hansen P (2001). Essays and Surveys on Metaheuristics. Kluwer Academic Publishers: Boston, USA.
45. Russell RA (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transport Sci 29: 156.
46. Scheuerer S and Wendolsky R (2004). A scatter search heuristic for the capacitated clustering problem. Eur J Opl Res 169: 533-547.
47. Steiglitz K and Weiner P (1968). Some improved algorithms for computer solution of the traveling salesman problem. In: Chien RT and Trick TN (eds). Proceedings of the 6th Annual Allerton Conference on Circuit Theory, Urbana, Illinois, pp 814-821.
48. Taillard ED et al (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31: 170-186.
49. Thangiah SR, Osman IH, Vinayagamoorthy R and Sung T (1993). Algorithms for the vehicle routing with time deadline. Am J Math M Sci 13: 323-355.
50. Vakharia A and Mahajan J (2000). Clustering of objects and attributes for manufacturing and marketing applications. Euro J Opl Res 123: 640-651.
51. Voss S, Martello S, Osman IH and Roucairol C (1998). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers: Boston, USA.
52. Wassan NA and Osman IH (2002). Tabu search variants for the mix fleet vehicle routing problem. J Opl Res Soc 53: 768-782.