IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v31y2025i3d10.1007_s10732-025-09565-2.html
   My bibliography  Save this article

Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances

Author

Listed:
  • Arnab Kole

    (The Heritage Academy)

  • Anindya Jyoti Pal

    (The University of Burdwan)

Abstract

Graph coloring problem is a well-known NP-complete combinatorial optimization problem where the goal is to assign colors to the vertices of a graph such that no adjacent vertices share the same color. Despite extensive research, no known polynomial-time algorithm exists for finding the optimal coloring for all the benchmark graph instances. This paper presents a time-efficient effective hybridization of ant colony optimization and quantum annealing algorithms in a single framework to solve graph coloring. The algorithm has been tested on 100 standard DIMACS benchmark graph instances of varying size and complexity. The experimental result shows that quantum annealing outperforms the performances of ant colony optimization in terms of obtaining the optimal/best-known chromatic number. However, the runtime of quantum annealing is too high for some simple graph instances of larger size. On the other hand, ant colony optimization gives faster result than quantum annealing for the simple graphs, but the performance is not satisfactory for some complex benchmark instances. The hybridization approach gives optimal/best-known results for the complex graphs and takes less time for the large-sized instances. By conducting a performance comparison among the individual algorithms with the hybridization using Friedman Test and Nemenyi Post-hoc analysis, the worthiness of the proposed hybrid algorithm is explained, establishing its promising nature.

Suggested Citation

  • Arnab Kole & Anindya Jyoti Pal, 2025. "Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances," Journal of Heuristics, Springer, vol. 31(3), pages 1-44, September.
    • Handle: RePEc:spr:joheur:v:31:y:2025:i:3:d:10.1007_s10732-025-09565-2
    DOI: 10.1007/s10732-025-09565-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-025-09565-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-025-09565-2?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Laurent Moalic & Alexandre Gondran, 2018. "Variations on memetic algorithms for graph coloring problems," Journal of Heuristics, Springer, vol. 24(1), pages 1-24, February.
    2. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    3. L M Gambardella & É D Taillard & M Dorigo, 1999. "Ant colonies for the quadratic assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 167-176, February.
    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. Omkar Bihani & Janez Žerovnik, 2025. "A Heuristic for Graph Coloring Based on the Ising Model," Mathematics, MDPI, vol. 13(18), pages 1-20, September.

    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. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    2. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    3. Alfonsas Misevičius & Aleksandras Andrejevas & Armantas Ostreika & Dovilė Verenė & Gintarė Žekienė, 2024. "An Improved Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem," Mathematics, MDPI, vol. 12(23), pages 1-25, November.
    4. K A Dowsland & J M Thompson, 2005. "Ant colony optimization for the examination scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 426-438, April.
    5. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    6. C Gagné & M Gravel & S Morin & W L Price, 2008. "Impact of the pheromone trail on the performance of ACO algorithms for solving the car-sequencing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1077-1090, August.
    7. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    8. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    9. Lin, B.M.T. & Lu, C.Y. & Shyu, S.J. & Tsai, C.Y., 2008. "Development of new features of ant colony optimization for flowshop scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 742-755, April.
    10. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
    11. Yu-Hsin Chen, Gary, 2013. "A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems," International Journal of Production Economics, Elsevier, vol. 142(2), pages 362-371.
    12. Sharma Vikas K. & Agarwal Manju & Sen Kanwar, 2010. "Optimal Structure in Heterogeneous Multi-state Series-parallel Reliability Systems," Stochastics and Quality Control, De Gruyter, vol. 25(1), pages 127-150, January.
    13. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    14. J Levine & F Ducatelle, 2004. "Ant colony optimization and local search for bin packing and cutting stock problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 705-716, July.
    15. Nahas, Nabil & Nourelfath, Mustapha & Ait-Kadi, Daoud, 2007. "Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 92(2), pages 211-222.
    16. Jean-François Cordeau & Manlio Gaudioso & Gilbert Laporte & Luigi Moccia, 2006. "A Memetic Heuristic for the Generalized Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 433-443, November.
    17. Solnon, Christine, 2008. "Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1043-1055, December.
    18. Mario Inostroza-Ponta & Regina Berretta & Pablo Moscato, 2011. "QAPgrid: A Two Level QAP-Based Approach for Large-Scale Data Analysis and Visualization," PLOS ONE, Public Library of Science, vol. 6(1), pages 1-18, January.
    19. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    20. Zhou, Yangming & Wang, Gezi & Hao, Jin-Kao & Geng, Na & Jiang, Zhibin, 2023. "A fast tri-individual memetic search approach for the distance-based critical node problem," European Journal of Operational Research, Elsevier, vol. 308(2), pages 540-554.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:joheur:v:31:y:2025:i:3:d:10.1007_s10732-025-09565-2. 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.