**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**3422

# Search results for: GCS problem

##### 3422 Iterative Methods for An Inverse Problem

**Authors:**
Minghui Wang,
Shanrui Hu

**Abstract:**

An inverse problem of doubly center matrices is discussed. By translating the constrained problem into unconstrained problem, two iterative methods are proposed. A numerical example illustrate our algorithms.

**Keywords:**
doubly center matrix,
electric network theory,
iterative methods,
least-square problem.

##### 3421 Evolutionary Search Techniques to Solve Set Covering Problems

**Authors:**
Darwin Gouwanda,
S. G. Ponnambalam

**Abstract:**

**Keywords:**
Set covering problem,
genetic algorithm,
ant colony
optimization,
LINGO.

##### 3420 Bi-linear Complementarity Problem

**Authors:**
Chao Wang,
Ting-Zhu Huang Chen Jia

**Abstract:**

In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient.

**Keywords:**
Bi-linear complementarity problem,
Linear complementarity
problem,
Extended linear complementarity problem,
Error
estimation,
P-matrix,
M-matrix.

##### 3419 A Method for Solving a Bi-Objective Transportation Problem under Fuzzy Environment

**Authors:**
Sukhveer Singh,
Sandeep Singh

**Abstract:**

A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem.

**Keywords:**
Transportation problem,
efficient solution,
ranking function,
fuzzy transportation problem.

##### 3418 Bee Colony Optimization Applied to the Bin Packing Problem

**Authors:**
Kenza Aida Amara,
Bachir Djebbar

**Abstract:**

**Keywords:**
Bee colony optimization,
bin packing,
heuristic algorithm,
pretreatment.

##### 3417 Modeling Language for Machine Learning

**Authors:**
Tsuyoshi Okita,
Tatsuya Niwa

**Abstract:**

**Keywords:**
Formal language,
statistical inference problem,
reduction.

##### 3416 Transformation of Course Timetablinng Problem to RCPSP

**Authors:**
M. Ahmad,
M. Gourgand,
C. Caux

**Abstract:**

**Keywords:**
Course Timetabling,
Integer programming,
Combinatorial optimizations

##### 3415 How to Build and Evaluate a Solution Method: An Illustration for the Vehicle Routing Problem

**Authors:**
Nicolas Zufferey

**Abstract:**

The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its well-known difficulty, metaheuristics are the most appropriate methods to tackle large and realistic instances. The goal of this paper is to highlight the key ideas for designing VRP metaheuristics according to the following criteria: efficiency, speed, robustness, and ability to take advantage of the problem structure. Such elements can obviously be used to build solution methods for other combinatorial optimization problems, at least in the deterministic field.

**Keywords:**
Vehicle routing problem,
Metaheuristics,
Combinatorial optimization.

##### 3414 Seat Assignment Problem Optimization

**Authors:**
Mohammed Salem Alzahrani

**Abstract:**

**Keywords:**
Assignment Problem,
Hungarian Method,
Least Cost
Method,
Northwest Corner Method,
Seat Assignment Method
(SAM),
A Real Word Assignment Problem.

##### 3413 The Multi-scenario Knapsack Problem: An Adaptive Search Algorithm

**Authors:**
Mhand Hifi,
Hedi Mhalla,
Mustapha Michaphy

**Abstract:**

In this paper, we study the multi-scenario knapsack problem, a variant of the well-known NP-Hard single knapsack problem. We investigate the use of an adaptive algorithm for solving heuristically the problem. The used method combines two complementary phases: a size reduction phase and a dynamic 2- opt procedure one. First, the reduction phase applies a polynomial reduction strategy; that is used for reducing the size problem. Second, the adaptive search procedure is applied in order to attain a feasible solution Finally, the performances of two versions of the proposed algorithm are evaluated on a set of randomly generated instances.

**Keywords:**
combinatorial optimization,
max-min optimization,
knapsack,
heuristics,
problem reduction

##### 3412 A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes

**Authors:**
Zohreh O. Akbari

**Abstract:**

**Keywords:**
Clique problem,
Deterministic Polynomial-time
Algorithm,
Equality of P and NP Complexity Classes.

##### 3411 Optimization by Ant Colony Hybryde for the Bin-Packing Problem

**Authors:**
Ben Mohamed Ahemed Mohamed,
Yassine Adnan

**Abstract:**

The problem of bin-packing in two dimensions (2BP) consists in placing a given set of rectangular items in a minimum number of rectangular and identical containers, called bins. This article treats the case of objects with a free orientation of 90Ôùª. We propose an approach of resolution combining optimization by colony of ants (ACO) and the heuristic method IMA to resolve this NP-Hard problem.

**Keywords:**
Ant colony algorithm,
bin-packing problem,
heuristics methods.

##### 3410 Optimal Facility Layout Problem Solution Using Genetic Algorithm

**Authors:**
Maricar G. Misola,
Bryan B. Navarro

**Abstract:**

Facility Layout Problem (FLP) is one of the essential problems of several types of manufacturing and service sector. It is an optimization problem on which the main objective is to obtain the efficient locations, arrangement and order of the facilities. In the literature, there are numerous facility layout problem research presented and have used meta-heuristic approaches to achieve optimal facility layout design. This paper presented genetic algorithm to solve facility layout problem; to minimize total cost function. The performance of the proposed approach was verified and compared using problems in the literature.

**Keywords:**
Facility Layout Problem,
Genetic Algorithm,
Material Handling Cost,
Meta-heuristic Approach.

##### 3409 Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm

**Authors:**
Aldy Gunawan,
Kien Ming Ng,
Kim Leng Poh

**Abstract:**

This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works.

**Keywords:**
Timetabling problem,
mathematical programming
model,
hybrid algorithm,
simulated annealing.

##### 3408 Stochastic Programming Model for Power Generation

**Authors:**
Takayuki Shiina

**Abstract:**

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

##### 3407 On Optimum Stratification

**Authors:**
M. G. M. Khan,
V. D. Prasad,
D. K. Rao

**Abstract:**

In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique.

**Keywords:**
Auxiliary variable,
Dynamic programming technique,
Nonlinear programming problem,
Optimum stratification,
Uniform distribution.

##### 3406 Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)

**Authors:**
Buthainah Fahran Al-Dulaimi,
Hamza A. Ali

**Abstract:**

The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.

**Keywords:**
Genetic algorithms,
traveling salesman problem solving,
optimization.

##### 3405 Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations

**Authors:**
Liudmyla Koliechkina,
Olena Dvirna

**Abstract:**

**Keywords:**
Discrete set,
linear combinatorial optimization,
multi-objective optimization,
multipermutation,
Pareto solutions,
partial permutation set,
permutation,
structural graph.

##### 3404 P-ACO Approach to Assignment Problem in FMSs

**Authors:**
I. Mahdavi,
A. Jazayeri,
M. Jahromi,
R. Jafari,
H. Iranmanesh

**Abstract:**

One of the most important problems in production planning of flexible manufacturing system (FMS) is machine tool selection and operation allocation problem that directly influences the production costs and times .In this paper minimizing machining cost, set-up cost and material handling cost as a multi-objective problem in flexible manufacturing systems environment are considered. We present a 0-1 integer linear programming model for the multiobjective machine tool selection and operation allocation problem and due to the large scale nature of the problem, solving the problem to obtain optimal solution in a reasonable time is infeasible, Paretoant colony optimization (P-ACO) approach for solving the multiobjective problem in reasonable time is developed. Experimental results indicate effectiveness of the proposed algorithm for solving the problem.

**Keywords:**
Flexible manufacturing system,
Production planning,
Machine tool selection,
Operation allocation,
Multiobjective optimization,
Metaheuristic.

##### 3403 A Comparison of Exact and Heuristic Approaches to Capital Budgeting

**Authors:**
Jindřiška Šedová,
Miloš Šeda

**Abstract:**

**Keywords:**
Capital budgeting,
knapsack problem,
GAMS,
heuristic method,
genetic algorithm.

##### 3402 Optimization Using Simulation of the Vehicle Routing Problem

**Authors:**
Nayera E. El-Gharably,
Khaled S. El-Kilany,
Aziz E. El-Sayed

**Abstract:**

**Keywords:**
Discrete event system simulation,
optimization using simulation,
vehicle routing problem.

##### 3401 Tabu Search to Draw Evacuation Plans in Emergency Situations

**Authors:**
S. Nasri,
H. Bouziri

**Abstract:**

Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes.

**Keywords:**
Dynamic network flow,
Load dependent transit time,
Evacuation strategy,
Earliest arrival flow problem.

##### 3400 Avoiding Pin Ball Routing Problem in Network Mobility Hand-Off Management

**Authors:**
M. Dinakaran,
P. Balasubramanie

**Abstract:**

**Keywords:**
Mobile IP,
Pinball routing problem,
NEMO

##### 3399 Optimal Capacitor Placement in Distribution Feeders

**Authors:**
N. Rugthaicharoencheep,
S. Auchariyamet

**Abstract:**

**Keywords:**
Capacitor Placement,
Distribution Systems,
Optimization Techniques

##### 3398 Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing

**Authors:**
Divyesh Patel,
Tanuja Srivastava

**Abstract:**

This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.

**Keywords:**
Discrete Tomography,
exactly-1-4-adjacency,
simulated annealing.

##### 3397 Vibration Base Identification of Impact Force Using Genetic Algorithm

**Authors:**
R. Hashemi,
M.H.Kargarnovin

**Abstract:**

**Keywords:**
Genetic Algorithm,
Inverse problem,
Optimization,
Vibration.

##### 3396 Solving the Set Covering Problem Using the Binary Cat Swarm Optimization Metaheuristic

**Authors:**
Broderick Crawford,
Ricardo Soto,
Natalia Berrios,
Eduardo Olguin

**Abstract:**

**Keywords:**
Binary cat swarm optimization,
set covering problem,
metaheuristic,
binarization methods.

##### 3395 An Effective Algorithm for Minimum Weighted Vertex Cover Problem

**Authors:**
S. Balaji,
V. Swaminathan,
K. Kannan

**Abstract:**

The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.

**Keywords:**
Weighted vertex cover,
vertex support,
approximation algorithms,
NP-complete problem.

##### 3394 Creative Thinking Skill Approach Through Problem-Based Learning: Pedagogy and Practice in the Engineering Classroom

**Authors:**
Halizah Awang,
Ishak Ramly

**Abstract:**

**Keywords:**
Creative Thinking Skills,
Problem-based Learning,
Problem Solving.

##### 3393 Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms

**Authors:**
Fatma A. Karkory,
Ali A. Abudalmola

**Abstract:**

The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 –city, and 229–city. The computation results validate the performance of the proposed algorithm.

**Keywords:**
Heuristics,
minimum spanning tree algorithm,
Nearest Neighbor,
Travelling Salesman Problem (TSP).