IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i4d10.1023_a1011624708694.html
   My bibliography  Save this article

Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows

Author

Listed:
  • J. Macgregor Smith

    (University of Massachusetts)

  • Wu-Ji Li

    (ATT Solutions)

Abstract

One of the most notorious network design problems is the Quadratic Assignment Problem (QAP). We develop an heuristic algorithm for QAPs along with an M/G/C/C state dependent queueing model for capturing congestion in the traffic system interconnecting the nodes in the network. Computational results are also presented.

Suggested Citation

  • J. Macgregor Smith & Wu-Ji Li, 2001. "Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 421-443, December.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:4:d:10.1023_a:1011624708694
    DOI: 10.1023/A:1011624708694
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011624708694
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011624708694?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Rajat Jain & J. Macgregor Smith, 1997. "Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models," Transportation Science, INFORMS, vol. 31(4), pages 324-336, November.
    2. Chhajed, Dilip & Montreuil, Benoit & Lowe, Timothy J., 1992. "Flow network design for manufacturing systems layout," European Journal of Operational Research, Elsevier, vol. 57(2), pages 145-161, March.
    3. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.
    4. Kusiak, Andrew & Heragu, Sunderesh S., 1987. "The facility layout problem," European Journal of Operational Research, Elsevier, vol. 29(3), pages 229-251, June.
    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. W. Hager, 2009. "COAP 2008 best paper award: Paper of P.M. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu," Computational Optimization and Applications, Springer, vol. 44(3), pages 525-530, December.
    2. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    3. Min Zhang & Rajan Batta & Rakesh Nagi, 2009. "Modeling of Workflow Congestion and Optimization of Flow Routing in a Manufacturing/Warehouse Facility," Management Science, INFORMS, vol. 55(2), pages 267-280, February.
    4. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.

    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. Lin, Jin-Ling & Foote, Bobbie & Pulat, Simin & Chang, Chir-Ho & Cheung, John Y., 1996. "Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes," European Journal of Operational Research, Elsevier, vol. 89(1), pages 135-146, February.
    2. Ioannou, George, 2006. "Time-phased creation of hybrid manufacturing systems," International Journal of Production Economics, Elsevier, vol. 102(2), pages 183-198, August.
    3. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2020. "A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 615-640, March.
    4. Zhongwei Zhang & Lihui Wu & Zhaoyun Wu & Wenqiang Zhang & Shun Jia & Tao Peng, 2022. "Energy-Saving Oriented Manufacturing Workshop Facility Layout: A Solution Approach Using Multi-Objective Particle Swarm Optimization," Sustainability, MDPI, vol. 14(5), pages 1-28, February.
    5. Pedro Cesar Lopes Gerum & Andrew Reed Benton & Melike Baykal-Gürsoy, 2019. "Traffic density on corridors subject to incidents: models for long-term congestion management," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 795-831, December.
    6. Amir Rastpour & Armann Ingolfsson & Bora Kolfal, 2020. "Modeling Yellow and Red Alert Durations for Ambulance Systems," Production and Operations Management, Production and Operations Management Society, vol. 29(8), pages 1972-1991, August.
    7. Gomez, A. & Fernandez, Q. I. & De la Fuente Garcia, D. & Garcia, P. J., 2003. "Using genetic algorithms to resolve layout problems in facilities where there are aisles," International Journal of Production Economics, Elsevier, vol. 84(3), pages 271-282, June.
    8. Bazargan-Lari, Massoud, 1999. "Layout designs in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 112(2), pages 258-272, January.
    9. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
    10. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    11. Jerzy Grobelny & Rafal Michalski, 2016. "Experimental examination of facilities layout problems in logistics systems including objects with diverse sizes and shapes," WORking papers in Management Science (WORMS) WORMS/16/12, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    12. Jerzy Grobelny & Rafal Michalski, 2018. "Simulated annealing based on linguistic patterns: experimental examination of properties for various types of logistic problems," WORking papers in Management Science (WORMS) WORMS/18/09, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    13. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    14. Jeffrey P. Kharoufeh & Natarajan Gautam, 2004. "Deriving Link Travel-Time Distributions via Stochastic Speed Processes," Transportation Science, INFORMS, vol. 38(1), pages 97-106, February.
    15. Stefan Helber & Daniel Böhme & Farid Oucherif & Svenja Lagershausen & Steffen Kasper, 2016. "A hierarchical facility layout planning approach for large and complex hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 5-29, June.
    16. Philip A. Ernst & Søren Asmussen & John J. Hasenbein, 2018. "Stability and busy periods in a multiclass queue with state-dependent arrival rates," Queueing Systems: Theory and Applications, Springer, vol. 90(3), pages 207-224, December.
    17. Xiao, Jianli & Wang, Zhonghao, 2018. "Traffic speed cloud maps: A new method for analyzing macroscopic traffic flow," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 367-375.
    18. MacGregor Smith, J. & Cruz, F.R.B., 2014. "M/G/c/c state dependent travel time models and properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 560-579.
    19. Arjang Assad & Weixuan Xu, 1992. "The quadratic minimum spanning tree problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 399-417, April.
    20. Junqi Liu & Zeqiang Zhang & Feng Chen & Silu Liu & Lixia Zhu, 2022. "A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 953-972, April.

    More about this item

    Keywords

    quadratic assignment; stochastic networks;

    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:spr:jcomop:v:5:y:2001:i:4:d:10.1023_a:1011624708694. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.