Skip to content
Research Article Open access CC BY 4.0

Future Trails for Integer Programming and Relations to Artificial Intelligence

Pavlo Romaniuk

Asian Journal of Research in Computer Science · pp. 1–10 · Published 2 Mar 2023

10.9734/ajrcos/2023/v15i2315

Abstract

Aims: A review of methods and approaches for solving linear integer problems is presented in this work. These problems are classified as NP-hard optimization algorithms in artificial intelligence. Study Design: we have used the Google scholar to collect the data resources from past 5 years to analysis the techniques and methods used in different algorithms in artificial intelligence. Methodology: Exact optimum solution for this class of challenges also need use of substantial computer resources. The current direction in which several researcher focuses their efforts to effectively address numerous difficult practical issues is the creation of efficient hybrid techniques that combine in an appropriate way the finest elements of multiple methods (precise or estimated). The approximation algorithms' core heuristic techniques might be classified as constructive algorithms and local-improvement algorithms. Results: We examined three artificial intelligence algorithms utilizing the linear integer programming approach. Algorithm based on population It has also been demonstrated that a population of a critical size is necessary for a population-based optimization method to be effective. The genetic algorithm is shown next. The goal value associated with this solution may be utilized to effectively reduce the search tree in bound and branch type integer programming methods. Finally, we analyze the particle swarm optimization (PSO) approach, which demonstrates that In most cases, PSO outperforms the Branch and Bound method in solving such issues quickly.  Conclusion: In actuality, integer optimization issues describe a wide spectrum of real-world difficulties. Their population and size are constantly growing. Although while accurate methods for integer issues have substantially improved in recent years, their long runtimes and memory needs make them unsuitable for actual medium and large-scale applications.

Linear integer programming artificial intelligence population based algorithm genetic algorithm PSO

References (20)

  1. 1 A review on genetic algorithm: past, present, and future [DOI]
  2. 2 Particle swarm optimization algorithm: an overview [DOI]
  3. 3 Machine learning for combinatorial optimization: A methodological tour d'horizon [DOI]
  4. 4 A compilation of UAV applications for precision agriculture [DOI]
  5. 5 Population size in Particle Swarm Optimization [DOI]
  6. 6 A survey of deep meta-learning [DOI]
  7. 7 Ensemble strategies for population-based optimization algorithms – A survey [DOI]
  8. 8 Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis [DOI]
  9. 9 A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization [DOI]
  10. 10 A hybrid meta-heuristic algorithm for scientific workflow scheduling in heterogeneous distributed computing systems [DOI]
  11. 11 Topology optimization via sequential integer programming and Canonical relaxation algorithm [DOI]
  12. 12 Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty [DOI]
  13. 13 Approximation Algorithms for Maximin Fair Division [DOI]
  14. 14 Scheduling multiple agile earth observation satellites with an edge computing framework and a constructive heuristic algorithm [DOI]
  15. 15 Effective heuristic for large-scale unrelated parallel machines scheduling problems [DOI]
  16. 16 A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem [DOI]
  17. 17 A hybrid genetic algorithm for a multilevel assembly replenishment planning problem with stochastic lead times [DOI]
  18. 18 AI framework with computational box counting and Integer programming removes quantization error in fractal dimension analysis of optical images [DOI]
  19. 19 Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search [DOI]
  20. 20 Improving Post Training Neural Quantization: Layer-wise Calibration and Integer Programming [DOI]

Cited by 0

No indexed citations yet.

Related research

Article metrics

Real usage data collected on this platform.

6

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.