**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**1444

# Search results for: simple integer recourse

##### 1444 Dynamic Slope Scaling Procedure for Stochastic Integer Programming Problem

**Authors:**
Takayuki Shiina

**Abstract:**

**Keywords:**
stochastic programming problem with recourse,
simple
integer recourse,
dynamic slope scaling procedure

##### 1443 Stochastic Programming Model for Power Generation

**Authors:**
Takayuki Shiina

**Abstract:**

**Keywords:**
electric power capacity expansion problem,
integerprogramming,
L-shaped method,
stochastic programming

##### 1442 Robot Path Planning in 3D Space Using Binary Integer Programming

**Authors:**
Ellips Masehian,
Golnaz Habibi

**Abstract:**

**Keywords:**
3D C-space,
Binary Integer Programming (BIP),
Delaunay Tessellation,
Robot Motion Planning.

##### 1441 On the Integer Solutions of the Pell Equation x2 - dy2 = 2t

**Authors:**
Ahmet Tekcan,
Betül Gezer,
Osman Bizim

**Abstract:**

Let k ≥ 1 and t ≥ 0 be two integers and let d = k2 + k be a positive non-square integer. In this paper, we consider the integer solutions of Pell equation x2 - dy2 = 2t. Further we derive a recurrence relation on the solutions of this equation.

**Keywords:**
Pell equation,
Diophantine equation.

##### 1440 The Pell Equation x2 − Py2 = Q

**Authors:**
Ahmet Tekcan,
Arzu Özkoç,
Canan Kocapınar,
Hatice Alkan

**Abstract:**

**Keywords:**
Pell equation,
solutions of Pell equation.

##### 1439 Accelerating Integer Neural Networks On Low Cost DSPs

**Authors:**
Thomas Behan,
Zaiyi Liao,
Lian Zhao,
Chunting Yang

**Abstract:**

**Keywords:**
Digital Signal Processor (DSP),
Integer Neural Network(INN),
Low Cost Neural Network,
Integer Neural Network DSPImplementation.

##### 1438 Efficient Secured Lossless Coding of Medical Images– Using Modified Runlength Coding for Character Representation

**Authors:**
S. Annadurai,
P. Geetha

**Abstract:**

**Keywords:**
EZW algorithm,
lifting scheme,
losslesscompression,
reversible integer wavelet transform,
securetransmission,
selective bit scrambling,
modified runlength coding .

##### 1437 Modern Method for Solving Pure Integer Programming Models

**Authors:**
G. Shojatalab

**Abstract:**

**Keywords:**
Integer,
Programming,
Operation Research,
Variables of decision.

##### 1436 Comparative Study on Recent Integer DCTs

**Authors:**
Sakol Udomsiri,
Masahiro Iwahashi

**Abstract:**

**Keywords:**
DCT,
sensitivity,
lossless,
wordlength.

##### 1435 A Special Algorithm to Approximate the Square Root of Positive Integer

**Authors:**
Hsian Ming Goo

**Abstract:**

The paper concerns a special approximate algorithm of the square root of the specific positive integer, which is built by the use of the property of positive integer solution of the Pell’s equation, together with using some elementary theorems of matrices, and then takes it to compare with general used the Newton’s method and give a practical numerical example and error analysis; it is unexpected to find its special property: the significant figure of the approximation value of the square root of positive integer will increase one digit by one. It is well useful in some occasions.

**Keywords:**
Special approximate algorithm,
square root,
Pell’s
equation,
Newton’s method,
error analysis.

##### 1434 The Spanning Laceability of k-ary n-cubes when k is Even

**Authors:**
Yuan-Kang Shih,
Shu-Li Chang,
Shin-Shin Kao

**Abstract:**

**Keywords:**
container,
Hamiltonian,
k-ary n-cube,
m*-connected.

##### 1433 Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem

**Authors:**
Vijaya K. Srivastava,
Davide Spinello

**Abstract:**

This paper presents established 3** ^{n}** enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method.

**Keywords:**
Integer programming,
mixed integer programming,
multi-objective optimization,
reliability redundancy allocation.

##### 1432 A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times

**Authors:**
Jinghao Sun,
Guozhen Tan,
Guangjian Hou

**Abstract:**

**Keywords:**
Chinese Postman Problem,
Time Dependent,
Integer Programming,
Upper Bound Analysis.

##### 1431 Generic Model for Timetabling Problems by Integer Linear Programming Approach

**Authors:**
N. A. H. Aizam,
V. Uvaraja

**Abstract:**

The agenda of showing the scheduled time for performing certain tasks is known as timetabling. It is widely used in many departments such as transportation, education, and production. Some difficulties arise to ensure all tasks happen in the time and place allocated. Therefore, many researchers invented various programming models to solve the scheduling problems from several fields. However, the studies in developing the general integer programming model for many timetabling problems are still questionable. Meanwhile, this thesis describes about creating a general model which solves different types of timetabling problems by considering the basic constraints. Initially, the common basic constraints from five different fields are selected and analyzed. A general basic integer programming model was created and then verified by using the medium set of data obtained randomly which is much similar to realistic data. The mathematical software, AIMMS with CPLEX as a solver has been used to solve the model. The model obtained is significant in solving many timetabling problems easily since it is modifiable to all types of scheduling problems which have same basic constraints.

**Keywords:**
AIMMS mathematical software,
integer linear
programming,
scheduling problems,
timetabling.

##### 1430 Factoring a Polynomial with Multiple-Roots

**Authors:**
Feng Cheng Chang

**Abstract:**

**Keywords:**
Polynomial roots,
greatest common divisor,
Longhand polynomial division,
Euclidean GCD Algorithm.

##### 1429 Lower Bounds of Some Small Ramsey Numbers

**Authors:**
Decha Samana,
Vites Longani

**Abstract:**

**Keywords:**
Lower bound,
Ramsey numbers,
Graphs,
Distance line.

##### 1428 Modified Diffie-Hellman Protocol By Extend The Theory of The Congruence

**Authors:**
Rand Alfaris,
Mohamed Rushdan MD Said,
Mohamed Othman,
Fudziah Ismail

**Abstract:**

**Keywords:**
Extended theory of the congruence,
modified Diffie-
Hellman protocol.

##### 1427 Airport Check-In Optimization by IP and Simulation in Combination

**Authors:**
Ahmad Thanyan Al-Sultan

**Abstract:**

The check-in area of airport terminal is one of the busiest sections at airports at certain periods. The passengers are subjected to queues and delays during the check-in process. These delays and queues are due to constraints in the capacity of service facilities. In this project, the airport terminal is decomposed into several check-in areas. The airport check-in scheduling problem requires both a deterministic (integer programming) and stochastic (simulation) approach. Integer programming formulations are provided to minimize the total number of counters in each check-in area under the realistic constraint that counters for one and the same flight should be adjacent and the desired number of counters remaining in each area should be fixed during check-in operations. By using simulation, the airport system can be modeled to study the effects of various parameters such as number of passengers on a flight and check-in counter opening and closing time.

**Keywords:**
Airport terminal,
Integer programming,
Scheduling,
Simulation.

##### 1426 The Pell Equation x2 − (k2 − k)y2 = 2t

**Authors:**
Ahmet Tekcan

**Abstract:**

**Keywords:**
Pell equation,
solutions of Pell equation.

##### 1425 Modeling Hybrid Systems with MLD Approach and Analysis of the Model Size and Complexity

**Authors:**
H. Mahboubi,
B. Moshiri,
A. Khaki Seddigh

**Abstract:**

**Keywords:**
Hybrid systems,
mixed-integer inequalities,
mixed
logical dynamical systems,
multi-tank system.

##### 1424 A Novel Estimation Method for Integer Frequency Offset in Wireless OFDM Systems

**Authors:**
Taeung Yoon,
Youngpo Lee,
Chonghan Song,
Na Young Ha,
Seokho Yoon

**Abstract:**

**Keywords:**
Orthogonal frequency division multiplexing,
integer frequency offset,
estimation,
training symbol

##### 1423 Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing

**Authors:**
Taehan Lee

**Abstract:**

**Keywords:**
Integer programming,
multicommodity network
design,
routing,
shortest path.

##### 1422 K-best Night Vision Devices by Multi-Criteria Mixed-Integer Optimization Modeling

**Authors:**
Daniela I. Borissova,
Ivan C. Mustakerov

**Abstract:**

The paper describes an approach for defining of k-best night vision devices based on multi-criteria mixed-integer optimization modeling. The parameters of night vision devices are considered as criteria that have to be optimized. Using different user preferences for the relative importance between parameters different choice of k-best devices can be defined. An ideal device with all of its parameters at their optimum is used to determine how far the particular device from the ideal one is. A procedure for evaluation of deviation between ideal solution and k-best solutions is presented. The applicability of the proposed approach is numerically illustrated using real night vision devices data. The proposed approach contributes to quality of decisions about choice of night vision devices by making the decision making process more certain, rational and efficient.

**Keywords:**
K-best devices,
mixed-integer model,
multi-criteria problem,
night vision devices.

##### 1421 A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem

**Authors:**
Mohsen Ziaee

**Abstract:**

**Keywords:**
Scheduling,
flexible job shop,
makespan,
mixed integer linear programming.

##### 1420 Timetabling Communities’ Demands for an Effective Examination Timetabling Using Integer Linear Programming

**Authors:**
N. F. Jamaluddin,
N. A. H. Aizam

**Abstract:**

This paper explains the educational timetabling problem, a type of scheduling problem that is considered as one of the most challenging problem in optimization and operational research. The university examination timetabling problem (UETP), which involves assigning a set number of exams into a set number of timeslots whilst fulfilling all required conditions, has been widely investigated. The limitation of available timeslots and resources with the increasing number of examinations are the main reasons in the difficulty of solving this problem. Dynamical change in the examination scheduling system adds up the complication particularly in coping up with the demand and new requirements by the communities. Our objective is to investigate these demands and requirements with subjects taken from Universiti Malaysia Terengganu (UMT), through questionnaires. Integer linear programming model which reflects the preferences obtained to produce an effective examination timetabling was formed.

**Keywords:**
Demands,
educational timetabling,
integer linear programming,
scheduling,
university examination timetabling problem.

##### 1419 Minimizing Energy Consumption in Wireless Sensor Networks using Binary Integer Linear Programming

**Authors:**
Chompunut Jantarasorn,
Chutima Prommak

**Abstract:**

The important issue considered in the widespread deployment of Wireless Sensor Networks (WSNs) is an efficiency of the energy consumption. In this paper, we present a study of the optimal relay station planning problems using Binary Integer Linear Programming (BILP) model to minimize the energy consumption in WSNs. Our key contribution is that the proposed model not only ensures the required network lifetime but also guarantees the radio connectivity at high level of communication quality. Specially, we take into account effects of noise, signal quality limitation and bit error rate characteristics. Numerical experiments were conducted in various network scenarios. We analyzed the effects of different sensor node densities and distribution on the energy consumption.

**Keywords:**
Binary Integer Linear Programming,
BILP,
Energy
consumption,
Optimal node placement and Wireless sensor networks.

##### 1418 A Genetic Based Algorithm to Generate Random Simple Polygons Using a New Polygon Merge Algorithm

**Authors:**
Ali Nourollah,
Mohsen Movahedinejad

**Abstract:**

In this paper a new algorithm to generate random simple polygons from a given set of points in a two dimensional plane is designed. The proposed algorithm uses a genetic algorithm to generate polygons with few vertices. A new merge algorithm is presented which converts any two polygons into a simple polygon. This algorithm at first changes two polygons into a polygonal chain and then the polygonal chain is converted into a simple polygon. The process of converting a polygonal chain into a simple polygon is based on the removal of intersecting edges. The experiments results show that the proposed algorithm has the ability to generate a great number of different simple polygons and has better performance in comparison to celebrated algorithms such as space partitioning and steady growth.

**Keywords:**
Divide and conquer,
genetic algorithm,
merge
polygons,
Random simple polygon generation.

##### 1417 Development of a Comprehensive Electricity Generation Simulation Model Using a Mixed Integer Programming Approach

**Authors:**
Erik Delarue,
David Bekaert,
Ronnie Belmans,
William D'haeseleer

**Abstract:**

This paper presents the development of an electricity simulation model taking into account electrical network constraints, applied on the Belgian power system. The base of the model is optimizing an extensive Unit Commitment (UC) problem through the use of Mixed Integer Linear Programming (MILP). Electrical constraints are incorporated through the implementation of a DC load flow. The model encloses the Belgian power system in a 220 – 380 kV high voltage network (i.e., 93 power plants and 106 nodes). The model features the use of pumping storage facilities as well as the inclusion of spinning reserves in a single optimization process. Solution times of the model stay below reasonable values.

**Keywords:**
Electricity generation modeling,
Unit Commitment(UC),
Mixed Integer Linear Programming (MILP),
DC load flow.

##### 1416 Efficiency of Robust Heuristic Gradient Based Enumerative and Tunneling Algorithms for Constrained Integer Programming Problems

**Authors:**
Vijaya K. Srivastava,
Davide Spinello

**Abstract:**

This paper presents performance of two robust gradient-based heuristic optimization procedures based on 3^{n} enumeration and tunneling approach to seek global optimum of constrained integer problems. Both these procedures consist of two distinct phases for locating the global optimum of integer problems with a linear or non-linear objective function subject to linear or non-linear constraints. In both procedures, in the first phase, a local minimum of the function is found using the gradient approach coupled with hemstitching moves when a constraint is violated in order to return the search to the feasible region. In the second phase, in one optimization procedure, the second sub-procedure examines 3^{n} integer combinations on the boundary and within hypercube volume encompassing the result neighboring the result from the first phase and in the second optimization procedure a tunneling function is constructed at the local minimum of the first phase so as to find another point on the other side of the barrier where the function value is approximately the same. In the next cycle, the search for the global optimum commences in both optimization procedures again using this new-found point as the starting vector. The search continues and repeated for various step sizes along the function gradient as well as that along the vector normal to the violated constraints until no improvement in optimum value is found. The results from both these proposed optimization methods are presented and compared with one provided by popular MS Excel solver that is provided within MS Office suite and other published results.

**Keywords:**
Constrained integer problems,
enumerative search algorithm,
Heuristic algorithm,
tunneling algorithm.

##### 1415 Optimal Production Planning in Aromatic Coconuts Supply Chain Based On Mixed-Integer Linear Programming

**Authors:**
Chaimongkol Limpianchob

**Abstract:**

This work addresses the problem of production planning that arises in the production of aromatic coconuts from Samudsakhorn province in Thailand. The planning involves the forwarding of aromatic coconuts from the harvest areas to the factory, which is classified into two groups; self-owned areas and contracted areas, the decisions of aromatic coconuts flow in the plant, and addressing a question of which warehouse will be in use. The problem is formulated as a mixed-integer linear programming model within supply chain management framework. The objective function seeks to minimize the total cost including the harvesting, labor and inventory costs. Constraints on the system include the production activities in the company and demand requirements. Numerical results are presented to demonstrate the feasibility of coconuts supply chain model compared with base case.

**Keywords:**
Aromatic coconut,
supply chain management,
production planning,
mixed-integer linear programming.