IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v169y2006i2p533-547.html
   My bibliography  Save this article

A scatter search heuristic for the capacitated clustering problem

Author

Listed:
  • Scheuerer, Stephan
  • Wendolsky, Rolf

Abstract

No abstract is available for this item.

Suggested Citation

  • Scheuerer, Stephan & Wendolsky, Rolf, 2006. "A scatter search heuristic for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 533-547, March.
    • Handle: RePEc:eee:ejores:v:169:y:2006:i:2:p:533-547
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00553-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    2. Koskosidis, Yiannis A. & Powell, Warren B., 1992. "Clustering algorithms for consolidation of customer orders into vehicle shipments," Transportation Research Part B: Methodological, Elsevier, vol. 26(5), pages 365-379, October.
    3. Mulvey, John M. & Beck, Michael P., 1984. "Solving capacitated clustering problems," European Journal of Operational Research, Elsevier, vol. 18(3), pages 339-348, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Albareda-Sambola, Maria & Díaz, Juan A. & Fernández, Elena, 2010. "Lagrangean duals and exact solution to the capacitated p-center problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 71-81, February.
    2. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    3. Juan A. Díaz & Dolores E. Luna, 2017. "Primal and dual bounds for the vertex p-median problem with balance constraints," Annals of Operations Research, Springer, vol. 258(2), pages 613-638, November.
    4. Mai, Feng & Fry, Michael J. & Ohlmann, Jeffrey W., 2018. "Model-based capacitated clustering with posterior regularization," European Journal of Operational Research, Elsevier, vol. 271(2), pages 594-605.
    5. Raka Jovanovic & Abdelkader Bousselham & Stefan Voß, 2015. "A heuristic method for solving the problem of partitioning graphs with supply and demand," Annals of Operations Research, Springer, vol. 235(1), pages 371-393, December.
    6. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
    7. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    2. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 0. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    3. A I Jarrah & J F Bard, 2011. "Pickup and delivery network segmentation using contiguous geographic clustering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(10), pages 1827-1843, October.
    4. Belarmino Adenso-Díaz & Mónica González & Emérita García, 1998. "A Hierarchical Approach to Managing Dairy Routing," Interfaces, INFORMS, vol. 28(2), pages 21-31, April.
    5. Wooseung Jang & Huay H. Lim & Thomas J. Crowe & Gail Raskin & Thomas E. Perkins, 2006. "The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance," Interfaces, INFORMS, vol. 36(4), pages 302-313, August.
    6. Mai, Feng & Fry, Michael J. & Ohlmann, Jeffrey W., 2018. "Model-based capacitated clustering with posterior regularization," European Journal of Operational Research, Elsevier, vol. 271(2), pages 594-605.
    7. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2022. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1812-1823, October.
    8. I H Osman & S Ahmadi, 2007. "Guided construction search metaheuristics for the capacitated p-median problem with single source constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 100-114, January.
    9. Ahmadi, Samad & Osman, Ibrahim H., 2005. "Greedy random adaptive memory programming search for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 30-44, April.
    10. Zhou, Qing & Benlic, Una & Wu, Qinghua & Hao, Jin-Kao, 2019. "Heuristic search to the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 464-487.
    11. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    12. Ivorra, Benjamin & Mohammadi, Bijan & Manuel Ramos, Angel, 2015. "A multi-layer line search method to improve the initialization of optimization algorithms," European Journal of Operational Research, Elsevier, vol. 247(3), pages 711-720.
    13. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    14. Rodrigo Rebolledo & Ana Ulloa & Óscar Cornejo & Carlos Obreque & Felipe Baesler, 2024. "Optimizing Districting and Seat Allocation for Enhanced Representativeness in Chile’s Chamber of Deputies," Mathematics, MDPI, vol. 12(24), pages 1-14, December.
    15. Rui Fragoso & Conceição Rego & Vladimir Bushenkov, 2016. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 14(2), pages 179-198, December.
    16. Xin Tang & Ameur Soukhal & Vincent T’kindt, 2014. "Preprocessing for a map sectorization problem by means of mathematical programming," Annals of Operations Research, Springer, vol. 222(1), pages 551-569, November.
    17. Kijmanawat, Kerati & Ieda, Hitoshi, 2005. "Development and Application of CM-GATS Algorithms in Solving Large Multilevel Hierarchical Network Design Problems," Research in Transportation Economics, Elsevier, vol. 13(1), pages 121-142, January.
    18. Steiner, Maria Teresinha Arns & Datta, Dilip & Steiner Neto, Pedro José & Scarpin, Cassius Tadeu & Rui Figueira, José, 2015. "Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil," Omega, Elsevier, vol. 52(C), pages 53-64.
    19. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    20. Jörg Kalcsics & Stefan Nickel & Michael Schröder, 2005. "Towards a unified territorial design approach — Applications, algorithms and GIS integration," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(1), pages 1-56, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:169:y:2006:i:2:p:533-547. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.