CFP last date
20 December 2024
Reseach Article

Neural Network Implementation for Integer Linear Programming Problem

by G.M. Nasira, S. Ashok kumar, T.S.S. Balaji
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 18
Year of Publication: 2010
Authors: G.M. Nasira, S. Ashok kumar, T.S.S. Balaji
10.5120/375-560

G.M. Nasira, S. Ashok kumar, T.S.S. Balaji . Neural Network Implementation for Integer Linear Programming Problem. International Journal of Computer Applications. 1, 18 ( February 2010), 93-97. DOI=10.5120/375-560

@article{ 10.5120/375-560,
author = { G.M. Nasira, S. Ashok kumar, T.S.S. Balaji },
title = { Neural Network Implementation for Integer Linear Programming Problem },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 18 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 93-97 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number18/375-560/ },
doi = { 10.5120/375-560 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:46:48.061168+05:30
%A G.M. Nasira
%A S. Ashok kumar
%A T.S.S. Balaji
%T Neural Network Implementation for Integer Linear Programming Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 18
%P 93-97
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Integer Linear Programming Problem (ILPP) is a special case of Linear Programming Problem (LPP) in which a few or all the decision variables are required to be non-negative integers. For solving ILPP, normally Gomory cutting plane or Branch and Bound technique is used. In this paper, for implementation of the problem in neural network we have taken a new and simple hybrid (primal-dual) algorithm which finds the optimal solution for a class of integer linear programming problems. Normally for solving ILPP Gomory method or Branch and Bound technique is used. This new algorithm does not use the simplex method unlike Gomory cutting plane method and Branch and Bound techniques. The algorithm was considered for implementation with Artificial Neural Network (ANN) and the result shows a great improvement in prediction of results. Literature shows that ILPP occurs most frequently in transportation problems, assignment problems, traveling salesman problems, sequencing problems, routing decisions etc. Thus the implementation of the neural network on the new algorithm will provide comprehensive results when applied with any of the said problems.

References
  1. Kartalopoulous, Stamatios V. “Under- standing neural networks and fuzzy logic”, Prentice hall 2003.
  2. K. Karthikeyan, V.S. Sampath kumar. “A Study on a Class of Linear Integer Programming Problems”, ICOREM 2009. pp. 1196-1210.
  3. Gupta.A. K., Sharma. J.K. “Integer Quadratic Programming. Journal of the Institution of Engineers”, Part Pr: Production Engineering Division Vol. 70, (2). pp. 43 – 47.
  4. M. Ida, K. Kobuchi, and R. ChangYun Lee. “Knowledge-Based Intelligent Electronic Systems”, 1998 Proceedings KES Second International Conference on Vol. 2. Issue, 21-23.
  5. S.Cavalieri. “Solving linear integer programming problems by a novel neural model”. Institute of Informatic and Tele- communications, Italy
  6. Meera Gandhi, S.K. Srivatsa. “Improving IDS Performance Using Neural Network (NN) For Anomalous Behavior Detection”, Karpagam JCS. Vol. 3. Issue 2. Jan-Feb 2009.
  7. Foo Yoon-Pin Simon Takefuji. T. “Integer linear programming neural networks for job-shop scheduling”, IEEE International Conference on Neural Networks1988. pp. 341-348 Vol. 2.
  8. Haixiang Shi. “A mixed branch-and-bound and neural network approach for the broadcast scheduling problem”, 2003. ISBN:1-58603-394-8 pp. 42-49.
  9. “Branch and bound algorithm for a facility location problem with concave site dependent costs”, International Journal of Production Economics, Volume 112, Issue 1, March 2008, Pages 245-254.
  10. H. J. Zimmermann, Angelo Monfroglio. “Linear programs for constraint satisfaction problems”. European Journal of Operational Research, Vol. 97, Issue 1, pp. 105-123.
Index Terms

Computer Science
Information Sciences

Keywords

Artificial Neural Network (ANN) Gomory Cutting Plane Integer Linear Programming Problem (ILPP) Linear Programming Problem (LPP) Branch and Bound technique Primal-Dual