IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v348y2019icp84-101.html
   My bibliography  Save this article

Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization

Author

Listed:
  • Palubeckis, Gintaras
  • Tomkevičius, Arūnas
  • Ostreika, Armantas

Abstract

Given a bipartite graph, the problem we address, called the bipartite graph crossing minimization problem (BGCMP), is to find an embedding the parts of the graph along two parallel lines so that the number of edge crossings is minimized. It is assumed that each edge is drawn as a straight line segment and edges sharing an end vertex do not cross. We propose an approach for the BGCMP, which combines a simulated annealing (SA) method with a variable neighborhood search (VNS) scheme. These two algorithms are executed iteratively. At each iteration, the solution produced by SA is submitted as input to the VNS component of the approach. Our VNS algorithm uses a local search technique which is based on a fast insertion neighborhood exploration procedure. We show that the time complexity of this procedure is O(n2), where n is the order of the graph. Another fast procedure is proposed for computing the gain in the objective function value obtained by swapping positions of two vertices. We experimentally compare our algorithm (called SA-VNS) against the tabu search algorithm as well as GRASP approach from the literature. Computational results are reported on four sets of bipartite graphs. The results demonstrate the superiority of SA-VNS over the state-of-the-art methods. The source code implementing SA-VNS is made publicly available as a benchmark for future comparisons.

Suggested Citation

  • Palubeckis, Gintaras & Tomkevičius, Arūnas & Ostreika, Armantas, 2019. "Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 84-101.
  • Handle: RePEc:eee:apmaco:v:348:y:2019:i:c:p:84-101
    DOI: 10.1016/j.amc.2018.11.051
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318310257
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2018.11.051?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. Mladenovic, Nenad & Urosevic, Dragan & Pérez-Brito, Dionisio & García-González, Carlos G., 2010. "Variable neighbourhood search for bandwidth reduction," European Journal of Operational Research, Elsevier, vol. 200(1), pages 14-27, January.
    2. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    3. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    4. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    5. Christoph Buchheim & Angelika Wiegele & Lanbo Zheng, 2010. "Exact Algorithms for the Quadratic Linear Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 168-177, February.
    6. Manuel Laguna & Rafael Marti, 1999. "GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 44-52, February.
    7. Valls, Vicente & Marti, Rafael & Lino, Pilar, 1996. "A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs," European Journal of Operational Research, Elsevier, vol. 90(2), pages 303-319, April.
    8. Jesús Sánchez-Oro & Anna Martínez-Gavara & Manuel Laguna & Rafael Martí & Abraham Duarte, 2017. "Variable neighborhood scatter search for the incremental graph drawing problem," Computational Optimization and Applications, Springer, vol. 68(3), pages 775-797, December.
    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. Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende, 2019. "Hybrid algorithms for placement of virtual machines across geo-separated data centers," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 748-793, October.
    2. Irawan, Chandra Ade & Salhi, Said & Scaparra, Maria Paola, 2014. "An adaptive multiphase approach for large unconditional and conditional p-median problems," European Journal of Operational Research, Elsevier, vol. 237(2), pages 590-605.
    3. Zhang, Ying & Snyder, Lawrence V. & Ralphs, Ted K. & Xue, Zhaojie, 2016. "The competitive facility location problem under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 453-473.
    4. Mesut Yavuz & Ismail Çapar, 2017. "Alternative-Fuel Vehicle Adoption in Service Fleets: Impact Evaluation Through Optimization Modeling," Transportation Science, INFORMS, vol. 51(2), pages 480-493, May.
    5. Martín Barragán, Belén & Liu, Ling & Prieto Fernández, Francisco Javier, 2016. "A Partial parametric path algorithm for multiclass classification," DES - Working Papers. Statistics and Econometrics. WS 22390, Universidad Carlos III de Madrid. Departamento de Estadística.
    6. Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.
    7. Napoletano, Antonio & Martínez-Gavara, Anna & Festa, Paola & Pastore, Tommaso & Martí, Rafael, 2019. "Heuristics for the Constrained Incremental Graph Drawing Problem," European Journal of Operational Research, Elsevier, vol. 274(2), pages 710-729.
    8. Gahm, Christian & Brabänder, Christian & Tuma, Axel, 2017. "Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 192-216.
    9. Irawan, Chandra Ade & Song, Xiang & Jones, Dylan & Akbari, Negar, 2017. "Layout optimisation for an installation port of an offshore wind farm," European Journal of Operational Research, Elsevier, vol. 259(1), pages 67-83.
    10. Alexander Biele & Lars Mönch, 2018. "Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing," Journal of Heuristics, Springer, vol. 24(1), pages 49-81, February.
    11. Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu, 2012. "Transshipment service through crossdocks with both soft and hard time windows," Annals of Operations Research, Springer, vol. 192(1), pages 21-47, January.
    12. H-Y Lin & C-J Liao & C-T Tseng, 2011. "An application of variable neighbourhood search to hospital call scheduling of infant formula promotion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 949-959, June.
    13. Dolinskaya, Irina & Shi, Zhenyu (Edwin) & Smilowitz, Karen, 2018. "Adaptive orienteering problem with stochastic travel times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 1-19.
    14. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    15. Ana Anokić & Zorica Stanimirović & Đorđe Stakić & Tatjana Davidović, 0. "Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation," Operational Research, Springer, vol. 0, pages 1-33.
    16. Neng Fan & Panos M. Pardalos, 2011. "A rearrangement of adjacency matrix based approach for solving the crossing minimization problem," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 747-762, November.
    17. Santi, Éverton & Aloise, Daniel & Blanchard, Simon J., 2016. "A model for clustering data from heterogeneous dissimilarities," European Journal of Operational Research, Elsevier, vol. 253(3), pages 659-672.
    18. Elshaikh, Abdalla & Salhi, Said & Nagy, Gábor, 2015. "The continuous p-centre problem: An investigation into variable neighbourhood search with memory," European Journal of Operational Research, Elsevier, vol. 241(3), pages 606-621.
    19. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    20. Marinakis, Yannis & Migdalas, Athanasios & Sifaleras, Angelo, 2017. "A hybrid Particle Swarm Optimization – Variable Neighborhood Search algorithm for Constrained Shortest Path problems," European Journal of Operational Research, Elsevier, vol. 261(3), pages 819-834.

    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:apmaco:v:348:y:2019:i:c:p:84-101. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: . General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.