Solving Operations Research Problems with Neural Networks

Author(s):  
Clark Jeffries
2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Muhammad Akram ◽  
N. O. Alshehri

Connectivity has an important role in neural networks, computer network, and clustering. In the design of a network, it is important to analyze connections by the levels. The structural properties of intuitionistic fuzzy graphs provide a tool that allows for the solution of operations research problems. In this paper, we introduce various types of intuitionistic fuzzy bridges, intuitionistic fuzzy cut vertices, intuitionistic fuzzy cycles, and intuitionistic fuzzy trees in intuitionistic fuzzy graphs and investigate some of their interesting properties. Most of these various types are defined in terms of levels. We also describe comparison of these types.


Author(s):  
Mehmet Anil Sahin ◽  
Gulfem Tuzkaya

Maintenance routing is one of the most complicated problems of operations research applications for airline industry. In this study, airline industry operations' main applications and subjects are basically mentioned and literature is briefly reviewed. This study is conducted under the headings of; Fleet Assignment, Aircraft Routing, Maintenance Routing and Crew Scheduling. Additionally, network models are explained basically on an example flight program. This study's purpose is to be a guide for the new researchers of this area through operations research applications for airline industry and to introduce maintenance routing problem literature.


Author(s):  
Raúl Poler ◽  
Josefa Mula ◽  
Manuel Díaz-Madroñero

1992 ◽  
Vol 19 (3-4) ◽  
pp. 179-189 ◽  
Author(s):  
Laura I. Burke ◽  
James P. Ignizio

Omega ◽  
1994 ◽  
Vol 22 (1) ◽  
pp. 41-56 ◽  
Author(s):  
C KOULAMAS ◽  
S ANTONY ◽  
R JAEN

2017 ◽  
Vol 25 (3) ◽  
pp. 473-501 ◽  
Author(s):  
Ahmed Kheiri ◽  
Ed Keedwell

Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints. In this article, a new sequence-based selection hyper-heuristic is presented that produces excellent results on a suite of high school timetabling problems. In this study, we present an easy-to-implement, easy-to-maintain, and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world instances collected from different countries. We show that with sequence-based methods, it is possible to discover new best known solutions for a number of the problems in the timetabling domain. Through this investigation, the usefulness of sequence-based selection hyper-heuristics has been demonstrated and the capability of these methods has been shown to exceed the state of the art.


Author(s):  
Josef Holoubek ◽  
Petr Zach

When solving operations research problems, one can use either specialised computer programs such as Lingo, Lindo, Storm or more universal programs such Excel, Matlab, and R. To obtain the input data, one can use either a program’s own editor or other programs commonly available such as Excel. While the problem-solving methods, being part of various programs, are the subjects of numerous publications (such as Gros, 2003; Jablonský, 2002; Plevný – Žižka, 2007; Stevenson – Ozgur, 2009), the way the input data are obtained, recorded, and processed receives far less attention although this part of problem-solving requires considerable effort and, if the method for data recording is inadequate, may cause subsequent difficulties in their further processing. A problem known as “the travelling salesman problem” (TSP) may serve as an example. Here, the input data form a “square matrix of distances”. This paper is concerned with some Excel tools that can be used to obtain and subsequently modify such a square matrix. Given a square m × m matrix, an ordinary user might want to reduce it to an i × i square matrix (where i < m) without having to copy data from the matrix, skip some of its rows and/or columns or write a program to implement such a reduction.In her degree project, Kourková, 2009 was looking for an efficient method of reducing an Excel matrix. She had found no relevant papers on this subject concluding that the authors of the commercial program had not considered this. Therefore, she offered her own solution unconventionally using the contingency table menu option. Although this had resulted in the desired submatrix, some of its parts were superfluous and even baffling for the user.For this reason, the authors analyse the method of representing an m × m matrix and the way of its reduction. Finally, a better option is offered to achieve the desired objective as well as other methods of obtaining the required submatrix that even users without sufficient programming skills can use.


Author(s):  
Bisera Andrić Gušavac ◽  
Gordana Savić

Research Question: This paper aims at specifying the contribution of operations research (OR) methods and techniques to agricultural land processing. Motivation: Agricultural production is performed on an agricultural land, which has to be exploited in the best possible way, given the increasing human population and the limited availability of the land. Considering the importance of this issue, a large number of research studies dealing with problems in agriculture can be found in the literature, and many of these problems are solved by OR methods and techniques. However, to our knowledge, there are no review papers that deal with this specific area, so the main motivation is to provide a detailed review of selected OR methods application in the agricultural land processing area. Idea: The core idea behind this research is to perceive a real impact of OR methods and techniques implementation in the agricultural land processing. The research is based on detailed literature review for the period 2014-2019 and performed statistics involving publication by year, publication by journal and statistics involving keywords in articles. Data: The review was conducted using online repositories of the papers published in SCI and SCIe journals with impact factors in the period from 2014-2019. Tools: Analyzed papers are divided into three groups according to the OR method applied: linear optimization problems, DEA method and other OR methods (non linear, multicriteria, mixed integer programming, dynamic programming). Papers within the groups are analyzed according to the type of problems solved. Statistical analyses of all collected data were used to get a good insight into the applications of operations research problems and data envelopment analysis in agricultural land processing. Findings: The number of published papers in this specific area has a growing trend over the observed years (with some minor decrease in 2016 and 2019 in comparison with the previous year). All of the articles are related to specific application of the given methods to solving problems in the agricultural land processing, and this is the reason for many different keywords appearing in the articles. Some very important keywords such as “operations research” or “OR” does not appear in any article as a keyword. Inclusion of such common keywords may result in a faster search in repositories of all articles. Contribution: The primary contribution of this paper is a detailed review of application of linear optimization, data envelopment analysis and other OR methods in agricultural land processing in the period 2014-2019.


Author(s):  
Quentin Cappart ◽  
Didier Chételat ◽  
Elias B. Khalil ◽  
Andrea Lodi ◽  
Christopher Morris ◽  
...  

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have mostly focused on solving problem instances in isolation, ignoring the fact that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning, especially graph neural networks, as a key building block for combinatorial tasks, either directly as solvers or by enhancing the former. This paper presents a conceptual review of recent key advancements in this emerging field, aiming at researchers in both optimization and machine learning.


Author(s):  
Mehmet Anil Sahin ◽  
Gulfem Tuzkaya

Maintenance routing is one of the most complicated problems of operations research applications for airline industry. In this study, airline industry operations' main applications and subjects are basically mentioned and literature is briefly reviewed. This study is conducted under the headings of; Fleet Assignment, Aircraft Routing, Maintenance Routing and Crew Scheduling. Additionally, network models are explained basically on an example flight program. This study's purpose is to be a guide for the new researchers of this area through operations research applications for airline industry and to introduce maintenance routing problem literature.


Sign in / Sign up

Export Citation Format

Share Document