IDEAS home Printed from https://ideas.repec.org/a/pab/rmcpee/v1y2006i1p25-37.html
   My bibliography  Save this article

Algoritmo Tabú para un problema de distribución de espacios = Tabu Search Algorithm for a Room Allocation Problem

Author

Listed:
  • G. Hernández-Díaz, Alfredo

    (Department of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide)

  • Guerrero Casas, Flor M.

    (Department of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide)

  • Caballero Fernández, Rafael

    (Departmento de Economía Aplicada (Matemáticas), Universidad de Málaga)

  • Molina Luque, Julián

    (Departmento de Economía Aplicada (Matemáticas), Universidad de Málaga)

Abstract

La distribución de espacios es un problema que habitualmente se presenta en situaciones reales cuando se deben asignar simultáneamente diferentes conjuntos de espacios (despachos, habitaciones, salas, etc.) distribuidos entre edificios y/o plantas entre varios grupos de personas de tal forma que se minimicen las distancias entre los espacios asignados a cada grupo y la sede de dicho grupo. Esta situación da lugar a un problema combinatorio con una función objetivo cuadrática, lo cual complica enormemente su resolución mediante un método exacto. Por este motivo, proponemos para su resolución un metaheurístico basado en Búsqueda Tabú con dos grupos de movimientos claramente diferenciados: intercambio de despachos y reasignación de sedes. Finalmente, aplicamos dicho algoritmo a un caso real en la Universidad Pablo de Olavide de Sevilla (España). = The distribution of spaces is a usual real problem presented when we have to assign simultaneously different sets of spaces (offices, rooms, halls, etc.). These spaces are distributed in buildings and/or floors and have to be assigned among several groups of people. The aim is to minimize the total distance among the spaces assigned to each group and its head office. This situation drives us to a quadratic combinatorial problem, so difficult to solve with exact methods. This is the reason to propose a metaheuristic method to solve it, a Tabu Search algorithm with two types of movements: the swapping of two offices and further assignment of head offices. The performance of the algorithm is demonstrated on a problem related with the Pablo de Olavide University in Seville (Spain)

Suggested Citation

  • G. Hernández-Díaz, Alfredo & Guerrero Casas, Flor M. & Caballero Fernández, Rafael & Molina Luque, Julián, 2006. "Algoritmo Tabú para un problema de distribución de espacios = Tabu Search Algorithm for a Room Allocation Problem," Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration, vol. 1(1), pages 25-37, June.
    • Handle: RePEc:pab:rmcpee:v:1:y:2006:i:1:p:25-37
    as

    Download full text from publisher

    File URL: http://www.upo.es/RevMetCuant/art2.pdf
    Download Restriction: no
    File URL: http://www.upo.es/RevMetCuant/art2.txt
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    2. Osorio, Maria A. & Laguna, Manuel, 2003. "Logic cuts for multilevel generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 151(1), pages 238-246, November.
    Full references (including those not matched with items on IDEAS)

    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. Alberto Ceselli & Giovanni Righini, 2006. "A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem," Operations Research, INFORMS, vol. 54(6), pages 1172-1184, December.
    2. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    3. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    4. Samir A. Abass, 2012. "0-1 integer interval number programming approach for the multilevel generalized assignment problem," E3 Journal of Business Management and Economics., E3 Journals, vol. 3(9), pages 326-329.
    5. Malichan Thongkham & Sasitorn Kaewman, 2018. "Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service," Administrative Sciences, MDPI, vol. 9(1), pages 1-21, December.
    6. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    7. Lorenzo Ros-McDonnell & Norina Szander & María Victoria de-la-Fuente-Aragón & Robert Vodopivec, 2019. "Scheduling Sustainable Homecare with Urban Transport and Different Skilled Nurses Using an Approximate Algorithm," Sustainability, MDPI, vol. 11(22), pages 1-14, November.
    8. Lorenzo Ros-McDonnell & M. de-la-Fuente-Aragon & Marija Bogataj, 2012. "An approximate algorithm for optimal logistics of heavy and variable size items," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 1-17, March.
    9. Zäpfel, Günther & Bögl, Michael, 2012. "Two heuristic solution concepts for the vehicle selection problem in line haul transports," European Journal of Operational Research, Elsevier, vol. 217(2), pages 448-458.
    10. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    11. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
    12. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    13. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    14. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    15. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
    16. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    17. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
    18. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
    19. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    20. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.

    More about this item

    Keywords

    búsqueda tabú; problemas de asignación; tabu search; room allocation problems;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    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:pab:rmcpee:v:1:y:2006:i:1:p:25-37. 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: Publicación Digital - UPO (email available below). General contact details of provider: https://edirc.repec.org/data/dmupoes.html .

    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.