Contour Line Tracing Algorithm for Digital Topographic MapsCSCJournals
Topographic maps contain information related to roads, contours, landmarks land covers and rivers etc. For any Remote sensing and GIS based project, creating a database using digitization techniques is a tedious and time consuming process especially for contour tracing. Contour line is very important information that these maps provide. They are mainly used for determining slope of the landforms or rivers. These contour lines are also used for generating Digital Elevation Model (DEM) for 3D surface generation from any satellite imagery or aerial photographs. This paper suggests an algorithm that can be used for tracing contour lines automatically from contour maps extracted from the topographical sheets and creating a database. In our approach, we have proposed a modified Moore's Neighbor contour tracing algorithm to trace all contours in the given topographic maps. The proposed approach is tested on several topographic maps and provides satisfactory results and takes less time to trace the contour lines compared with other existing algorithms.
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...CSCJournals
This paper proposes an efficient method for the design of two-channel, quadrature mirror filter (QMF) bank for subband image coding. The choice of filter bank is important as it affects image quality as well as system design complexity. The design problem is formulated as weighted sum of reconstruction error in time domain and passband and stop-band energy of the low-pass analysis filter of the filter bank .The objective function is minimized directly, using nonlinear unconstrained method. Experimental results of the method on images show that the performance of the proposed method is better than that of the already existing methods. The impact of some filter characteristics, such as stopband attenuation, stopband edge, and filter length on the performance of the reconstructed images is also investigated.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared.
A lossless color image compression using an improved reversible color transfo...eSAT Journals
Abstract In case of the conventional lossless color image compression methods, the pixels are interleaved from each color component, and they are predicted and finally encoded. In this paper, we propose a lossless color image compression method using hierarchical prediction of chrominance channel pixels and encoded with modified Huffman coding. An input image is chosen and the R, G and B color channel is transform into YCuCv color space using an improved reversible color transform. After that a conventional lossless image coder like CALIC is used to compress the luminance channel Y. The chrominance channel Cu and Cv are encoded with hierarchical decomposition and directional prediction. The effective context modeling for prediction residual is adopted finally. It is seen from the experimental result the proposed method improves the compression performance than the existing method. Keywords: Lossless color image compression, hierarchical prediction, reversible color transform, modified Huffman coding.
Contour Line Tracing Algorithm for Digital Topographic MapsCSCJournals
Topographic maps contain information related to roads, contours, landmarks land covers and rivers etc. For any Remote sensing and GIS based project, creating a database using digitization techniques is a tedious and time consuming process especially for contour tracing. Contour line is very important information that these maps provide. They are mainly used for determining slope of the landforms or rivers. These contour lines are also used for generating Digital Elevation Model (DEM) for 3D surface generation from any satellite imagery or aerial photographs. This paper suggests an algorithm that can be used for tracing contour lines automatically from contour maps extracted from the topographical sheets and creating a database. In our approach, we have proposed a modified Moore's Neighbor contour tracing algorithm to trace all contours in the given topographic maps. The proposed approach is tested on several topographic maps and provides satisfactory results and takes less time to trace the contour lines compared with other existing algorithms.
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...CSCJournals
This paper proposes an efficient method for the design of two-channel, quadrature mirror filter (QMF) bank for subband image coding. The choice of filter bank is important as it affects image quality as well as system design complexity. The design problem is formulated as weighted sum of reconstruction error in time domain and passband and stop-band energy of the low-pass analysis filter of the filter bank .The objective function is minimized directly, using nonlinear unconstrained method. Experimental results of the method on images show that the performance of the proposed method is better than that of the already existing methods. The impact of some filter characteristics, such as stopband attenuation, stopband edge, and filter length on the performance of the reconstructed images is also investigated.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared.
A lossless color image compression using an improved reversible color transfo...eSAT Journals
Abstract In case of the conventional lossless color image compression methods, the pixels are interleaved from each color component, and they are predicted and finally encoded. In this paper, we propose a lossless color image compression method using hierarchical prediction of chrominance channel pixels and encoded with modified Huffman coding. An input image is chosen and the R, G and B color channel is transform into YCuCv color space using an improved reversible color transform. After that a conventional lossless image coder like CALIC is used to compress the luminance channel Y. The chrominance channel Cu and Cv are encoded with hierarchical decomposition and directional prediction. The effective context modeling for prediction residual is adopted finally. It is seen from the experimental result the proposed method improves the compression performance than the existing method. Keywords: Lossless color image compression, hierarchical prediction, reversible color transform, modified Huffman coding.
Maximum likelihood estimation-assisted ASVSF through state covariance-based 2...TELKOMNIKA JOURNAL
The smooth variable structure filter (ASVSF) has been relatively considered as a new robust predictor-corrector method for estimating the state. In order to effectively utilize it, an SVSF requires the accurate system model, and exact prior knowledge includes both the process and measurement noise statistic. Unfortunately, the system model is always inaccurate because of some considerations avoided at the beginning. Moreover, the small addictive noises are partially known or even unknown. Of course, this limitation can degrade the performance of SVSF or also lead to divergence condition. For this reason, it is proposed through this paper an adaptive smooth variable structure filter (ASVSF) by conditioning the probability density function of a measurement
to the unknown parameters at one iteration. This proposed method is assumed to accomplish the localization and direct point-based observation task of a wheeled mobile robot, TurtleBot2. Finally, by realistically simulating it and comparing to a conventional method, the proposed method has been showing a better accuracy and stability in term of root mean square error (RMSE) of the estimated map coordinate (EMC) and estimated path coordinate (EPC).
Face Alignment Using Active Shape Model And Support Vector MachineCSCJournals
The Active Shape Model (ASM) is one of the most popular local texture models for face alignment. It applies in many fields such as locating facial features in the image, face synthesis, etc. However, the experimental results show that the accuracy of the classical ASM for some applications is not high. This paper suggests some improvements on the classical ASM to increase the performance of the model in the application: face alignment. Four of our major improvements include: i) building a model combining Sobel filter and the 2-D profile in searching face in image; ii) applying Canny algorithm for the enhancement edge on image; iii) Support Vector Machine (SVM) is used to classify landmarks on face, in order to determine exactly location of these landmarks support for ASM; iv) automatically adjust 2-D profile in the multi-level model based on the size of the input image. The experimental results on CalTech face database and Technical University of Denmark database (imm_face) show that our proposed improvement leads to far better performance.
Evolution of 3D Surface Parameters: A Comprehensive Surveytheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Choice of Numerical Integration Method for Wind Time History Analysis of Tall...inventy
Wind tunnel tests are being performed routinely around the world for designing tall buildings but the advent of powerful computational tools will make time-history analysis for wind more common in near future. As the duration of wind storms ranges from tens of minutes to hours while earthquake durations are typically less than a three to four minutes, the choice of a time step size (Δt) for wind studies needs to be much larger both to reduce the computational time and to save disk space. As the error in any numerical solution of the equation of motion is dependent on step size (Δt), careful investigations on the choice of numerical integration methods for wind analyses are necessary. From a wide variety of integration methods available, it was decided to investigate three methods that seem appropriate for 3D-time history analysis of tall buildings for wind. These are modal time history analysis, the Hilber-Hughes-Taylor (HHT) method or α-method with α=- 0.1, and the Newmark method with β=0.25 and γ=0.5 ( i.e., trapezoidal rule). SAP2000, a common structural analysis software tool, and a 64-story structure are used to conduct all the analyses in this paper. A boundary layer wind tunnel (BLWT) pressure time history measured at 120 locations around the building envelope of a similar structure is used for the analyses. Analyses performed with both the HHT and Newmark-method considering P-delta effects show that second order effects have a considerable impact on both displacement and acceleration response. This result shows that it is necessary to account P-delta effect for wind analysis of tall buildings. As the direct integration time history analysis required very large computation times and very large computer physical memory for a wind duration of hours, a modal analysis with reduced stiffness is considered as a good alternative. For that purpose, a non-linear static analysis of the structure with a load combination of 1.0D + 1.0L is performed in SAP2000 and the reduced stiffness of the structure after the analysis is used to conduct an eigenvalue analysis to extract the mode shapes and frequencies of this structure. Then the first 20- modes are used to perform a modal time history analysis for wind load. The result shows that the responses from modal analysis with “20-mode (reduced stiffness)” are comparable with that from the P-Δ analyses of Newmark-method
Concurrent Ternary Galois-based Computation using Nano-apex Multiplexing Nibs...VLSICS Design
Novel realizations of concurrent computations utilizing three-dimensional lattice networks and their corresponding carbon-based field emission controlled switching is introduced in this article. The formalistic ternary nano-based implementation utilizes recent findings in field emission and nano applications which include carbon-based nanotubes and nanotips for three-valued lattice computing via field-emission methods. The presented work implements multi-valued Galois functions by utilizing concurrent nano-based lattice systems, which use two-to-one controlled switching via carbon-based field emission devices by using nano-apex carbon fibers and carbon nanotubes that were presented in the first part of the article. The introduced computational extension utilizing many-to-one carbon field-emission devices will be further utilized in implementing congestion-free architectures within the third part of the article. The emerging nano-based technologies form important directions in low-power compact-size regular lattice realizations, in which carbon-based devices switch less-costly and more-reliably using much less power than silicon-based devices. Applications include low-power design of VLSI circuits for signal processing and control of autonomous robots.
Realistic road path reconstruction from GIS datahanguyenhoang
We introduce a new approach to construct smooth piecewise curves representing realistic road paths. Given a GIS database of road networks in which sampled points are organized in 3D polylines, our method creates horizontal, then vertical curves, and finally combines them to produce 3D road paths. We first estimate the possibility of each point of being a junction between two separate primitive curve segments. Next, we design a tree-traversal
algorithm to expand sequences of local best fit primitives which are then merged together with respect to the G1 continuity constraint and civil engineering rules. We apply the Levenberg-Marquardt method to minimize the error
between the resulting curve and the sampled points while preserving the G1continuity
A New Method to Solving Generalized Fuzzy Transportation Problem-Harmonic Mea...AI Publications
Transportation Problem is one of the models in the Linear Programming problem. The objective of this paper is to transport the item from the origin to the destination such that the transport cost should be minimized, and we should minimize the time of transportation. To achieve this, a new approach using harmonic mean method is proposed in this paper. In this proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. Further comparative studies of the new technique with other existing algorithms are established by means of sample problems.
The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm
(GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is
compared with an improved hybrid GA in solving TSP. The improved or hybrid GA consist of
conventional GA and two local optimization strategies. The first strategy is extracting all sequential
groups including four cities of samples and changing the two central cities with each other. The second
local optimization strategy is similar to an extra mutation process. In this step with a low probability a
sample is selected. In this sample two random cities are defined and the path between these cities is
reversed. The computation results show that the proposed method also finds better paths than the
conventional GA within an acceptable computation time.
A hybrid image similarity measure based on a new combination of different sim...IJECEIAES
Image similarity is the degree of how two images are similar or dissimilar. It computes the similarity degree between the intensity patterns in images. A new image similarity measure named (HFEMM) is proposed in this paper. The HFEMM is composed of two phases. Phase 1, a modified histogram similarity measure (HSSIM) is merged with feature similarity measure (FSIM) to get a new measure called (HFM). In phase 2, the resulted (HFM) is merged with error measure (EMM) in order to get a new similarity measure, which is named (HFEMM). Different kindes of noises for example Gaussian, Uniform, and salt & ppepper noiser are used with the proposed methods. One of the human face databases (AT&T) is used in the experiments and random images are used as well. For the evaluation, the similarity percentage under peakk signal to noise ratio (PSNR) is used. To show the effectiveness of the proposed measure, a comparision anong different similar technique such as SSIM, HFM, EMM and HFEMM are considered. The proposed HFEMM achieved higher similarity result when PSNR was low compared to the other methods.
“An Alternate Approach to Find an Optimal Solution of a Transportation Problem.”IOSRJM
The Transportation Problem is the special class of Linear Programming Problem. It arises when the situation in which a commodity is shipped from sources to destinations. The main object is to determine the amounts shipped from each sources to each destinations which minimize the total shipping cost while satisfying both supply criteria and demand requirements. In this paper, we are giving the idea about to finding the Initial Basic Feasible solution as well as the optimal solution or near to the optimal solution of a Transportation problem using the method known as “An Alternate Approach to find an optimal Solution of a Transportation Problem”. An Algorithm provided here, concentrate at unoccupied cells and proceeds further. Also, the numerical examples are provided to explain the proposed algorithm. However, the above method gives a step by step development of the solution procedure for finding an optimal solution.
ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONSijcses
The complexity of implementing the Boolean functions by digital logic gates is directly related to the
complexity of the Boolean algebraic expression. Although the truth table is used to represent a function,
when it is expressed algebraically it appeared in many different, but equivalent, forms. Boolean expressions
may be simplified by Boolean algebra. However, this procedure of minimization is awkward because it
lacks specific rules to predict each succeeding step in the manipulative process. Other methods like Map
methods (Karnaugh map (K-map), and map Entered Variables) are useful to implement the Boolean
expression with minimal prime implicants. Or the Boolean function can be represents and design by used
type N’s Multiplexers by partitioned variable(s) from the function. An adaptive map is a combined method
of Boolean algebra and K-map to reduce and minimize Boolean functions involving more than three
Boolean variables
A New Method for Solving Transportation Problems Considering Average PenaltyIOSRJM
Vogel’s Approximation Method (VAM) is one of the conventional methods that gives better Initial Basic Feasible Solution (IBFS) of a Transportation Problem (TP). This method considers the row penalty and column penalty of a Transportation Table (TT) which are the differences between the lowest and next lowest cost of each row and each column of the TT respectively. In a little bit different way, the current method consider the Average Row Penalty (ARP) and Average Column Penalty (ACP) which are the averages of the differences of cell values of each row and each column respectively from the lowest cell value of the corresponding row and column of the TT. Allocations of costs are started in the cell along the row or column which has the highest ARP or ACP. These cells are called basic cells. The details of the developed algorithm with some numerical illustrations are discussed in this article to show that it gives better solution than VAM and some other familiar methods in some cases.
MODIFIED VOGEL APPROXIMATION METHOD FOR BALANCED TRANSPORTATION MODELS TOWARD...IAEME Publication
This paper is built on a study in relation to transportation problem as it affects most organisational decision in a decomposed setting. The case study used in this work is Dangote cement factory (in Ibese, Nigeria) with three sources and four destinationscentres. The factory is supported by increasing number of cement delivery trucks. Some models for solving balanced transportation problems (TPs) are considered in order to determine the optimal and initial basic feasible solutions (IBFS). From the analysis, it is observed that Modified Vogel Approximation Method (MVAM) is a better method. This is partly because MVAM considers each unit cost in its solution algorithm and minimises total cost comparatively with Vogel Approximation Method (VAM). The results arefurther justified and validated using windows version 2.00 Tora package.
Maximum likelihood estimation-assisted ASVSF through state covariance-based 2...TELKOMNIKA JOURNAL
The smooth variable structure filter (ASVSF) has been relatively considered as a new robust predictor-corrector method for estimating the state. In order to effectively utilize it, an SVSF requires the accurate system model, and exact prior knowledge includes both the process and measurement noise statistic. Unfortunately, the system model is always inaccurate because of some considerations avoided at the beginning. Moreover, the small addictive noises are partially known or even unknown. Of course, this limitation can degrade the performance of SVSF or also lead to divergence condition. For this reason, it is proposed through this paper an adaptive smooth variable structure filter (ASVSF) by conditioning the probability density function of a measurement
to the unknown parameters at one iteration. This proposed method is assumed to accomplish the localization and direct point-based observation task of a wheeled mobile robot, TurtleBot2. Finally, by realistically simulating it and comparing to a conventional method, the proposed method has been showing a better accuracy and stability in term of root mean square error (RMSE) of the estimated map coordinate (EMC) and estimated path coordinate (EPC).
Face Alignment Using Active Shape Model And Support Vector MachineCSCJournals
The Active Shape Model (ASM) is one of the most popular local texture models for face alignment. It applies in many fields such as locating facial features in the image, face synthesis, etc. However, the experimental results show that the accuracy of the classical ASM for some applications is not high. This paper suggests some improvements on the classical ASM to increase the performance of the model in the application: face alignment. Four of our major improvements include: i) building a model combining Sobel filter and the 2-D profile in searching face in image; ii) applying Canny algorithm for the enhancement edge on image; iii) Support Vector Machine (SVM) is used to classify landmarks on face, in order to determine exactly location of these landmarks support for ASM; iv) automatically adjust 2-D profile in the multi-level model based on the size of the input image. The experimental results on CalTech face database and Technical University of Denmark database (imm_face) show that our proposed improvement leads to far better performance.
Evolution of 3D Surface Parameters: A Comprehensive Surveytheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Choice of Numerical Integration Method for Wind Time History Analysis of Tall...inventy
Wind tunnel tests are being performed routinely around the world for designing tall buildings but the advent of powerful computational tools will make time-history analysis for wind more common in near future. As the duration of wind storms ranges from tens of minutes to hours while earthquake durations are typically less than a three to four minutes, the choice of a time step size (Δt) for wind studies needs to be much larger both to reduce the computational time and to save disk space. As the error in any numerical solution of the equation of motion is dependent on step size (Δt), careful investigations on the choice of numerical integration methods for wind analyses are necessary. From a wide variety of integration methods available, it was decided to investigate three methods that seem appropriate for 3D-time history analysis of tall buildings for wind. These are modal time history analysis, the Hilber-Hughes-Taylor (HHT) method or α-method with α=- 0.1, and the Newmark method with β=0.25 and γ=0.5 ( i.e., trapezoidal rule). SAP2000, a common structural analysis software tool, and a 64-story structure are used to conduct all the analyses in this paper. A boundary layer wind tunnel (BLWT) pressure time history measured at 120 locations around the building envelope of a similar structure is used for the analyses. Analyses performed with both the HHT and Newmark-method considering P-delta effects show that second order effects have a considerable impact on both displacement and acceleration response. This result shows that it is necessary to account P-delta effect for wind analysis of tall buildings. As the direct integration time history analysis required very large computation times and very large computer physical memory for a wind duration of hours, a modal analysis with reduced stiffness is considered as a good alternative. For that purpose, a non-linear static analysis of the structure with a load combination of 1.0D + 1.0L is performed in SAP2000 and the reduced stiffness of the structure after the analysis is used to conduct an eigenvalue analysis to extract the mode shapes and frequencies of this structure. Then the first 20- modes are used to perform a modal time history analysis for wind load. The result shows that the responses from modal analysis with “20-mode (reduced stiffness)” are comparable with that from the P-Δ analyses of Newmark-method
Concurrent Ternary Galois-based Computation using Nano-apex Multiplexing Nibs...VLSICS Design
Novel realizations of concurrent computations utilizing three-dimensional lattice networks and their corresponding carbon-based field emission controlled switching is introduced in this article. The formalistic ternary nano-based implementation utilizes recent findings in field emission and nano applications which include carbon-based nanotubes and nanotips for three-valued lattice computing via field-emission methods. The presented work implements multi-valued Galois functions by utilizing concurrent nano-based lattice systems, which use two-to-one controlled switching via carbon-based field emission devices by using nano-apex carbon fibers and carbon nanotubes that were presented in the first part of the article. The introduced computational extension utilizing many-to-one carbon field-emission devices will be further utilized in implementing congestion-free architectures within the third part of the article. The emerging nano-based technologies form important directions in low-power compact-size regular lattice realizations, in which carbon-based devices switch less-costly and more-reliably using much less power than silicon-based devices. Applications include low-power design of VLSI circuits for signal processing and control of autonomous robots.
Realistic road path reconstruction from GIS datahanguyenhoang
We introduce a new approach to construct smooth piecewise curves representing realistic road paths. Given a GIS database of road networks in which sampled points are organized in 3D polylines, our method creates horizontal, then vertical curves, and finally combines them to produce 3D road paths. We first estimate the possibility of each point of being a junction between two separate primitive curve segments. Next, we design a tree-traversal
algorithm to expand sequences of local best fit primitives which are then merged together with respect to the G1 continuity constraint and civil engineering rules. We apply the Levenberg-Marquardt method to minimize the error
between the resulting curve and the sampled points while preserving the G1continuity
A New Method to Solving Generalized Fuzzy Transportation Problem-Harmonic Mea...AI Publications
Transportation Problem is one of the models in the Linear Programming problem. The objective of this paper is to transport the item from the origin to the destination such that the transport cost should be minimized, and we should minimize the time of transportation. To achieve this, a new approach using harmonic mean method is proposed in this paper. In this proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. Further comparative studies of the new technique with other existing algorithms are established by means of sample problems.
The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm
(GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is
compared with an improved hybrid GA in solving TSP. The improved or hybrid GA consist of
conventional GA and two local optimization strategies. The first strategy is extracting all sequential
groups including four cities of samples and changing the two central cities with each other. The second
local optimization strategy is similar to an extra mutation process. In this step with a low probability a
sample is selected. In this sample two random cities are defined and the path between these cities is
reversed. The computation results show that the proposed method also finds better paths than the
conventional GA within an acceptable computation time.
A hybrid image similarity measure based on a new combination of different sim...IJECEIAES
Image similarity is the degree of how two images are similar or dissimilar. It computes the similarity degree between the intensity patterns in images. A new image similarity measure named (HFEMM) is proposed in this paper. The HFEMM is composed of two phases. Phase 1, a modified histogram similarity measure (HSSIM) is merged with feature similarity measure (FSIM) to get a new measure called (HFM). In phase 2, the resulted (HFM) is merged with error measure (EMM) in order to get a new similarity measure, which is named (HFEMM). Different kindes of noises for example Gaussian, Uniform, and salt & ppepper noiser are used with the proposed methods. One of the human face databases (AT&T) is used in the experiments and random images are used as well. For the evaluation, the similarity percentage under peakk signal to noise ratio (PSNR) is used. To show the effectiveness of the proposed measure, a comparision anong different similar technique such as SSIM, HFM, EMM and HFEMM are considered. The proposed HFEMM achieved higher similarity result when PSNR was low compared to the other methods.
“An Alternate Approach to Find an Optimal Solution of a Transportation Problem.”IOSRJM
The Transportation Problem is the special class of Linear Programming Problem. It arises when the situation in which a commodity is shipped from sources to destinations. The main object is to determine the amounts shipped from each sources to each destinations which minimize the total shipping cost while satisfying both supply criteria and demand requirements. In this paper, we are giving the idea about to finding the Initial Basic Feasible solution as well as the optimal solution or near to the optimal solution of a Transportation problem using the method known as “An Alternate Approach to find an optimal Solution of a Transportation Problem”. An Algorithm provided here, concentrate at unoccupied cells and proceeds further. Also, the numerical examples are provided to explain the proposed algorithm. However, the above method gives a step by step development of the solution procedure for finding an optimal solution.
ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONSijcses
The complexity of implementing the Boolean functions by digital logic gates is directly related to the
complexity of the Boolean algebraic expression. Although the truth table is used to represent a function,
when it is expressed algebraically it appeared in many different, but equivalent, forms. Boolean expressions
may be simplified by Boolean algebra. However, this procedure of minimization is awkward because it
lacks specific rules to predict each succeeding step in the manipulative process. Other methods like Map
methods (Karnaugh map (K-map), and map Entered Variables) are useful to implement the Boolean
expression with minimal prime implicants. Or the Boolean function can be represents and design by used
type N’s Multiplexers by partitioned variable(s) from the function. An adaptive map is a combined method
of Boolean algebra and K-map to reduce and minimize Boolean functions involving more than three
Boolean variables
A New Method for Solving Transportation Problems Considering Average PenaltyIOSRJM
Vogel’s Approximation Method (VAM) is one of the conventional methods that gives better Initial Basic Feasible Solution (IBFS) of a Transportation Problem (TP). This method considers the row penalty and column penalty of a Transportation Table (TT) which are the differences between the lowest and next lowest cost of each row and each column of the TT respectively. In a little bit different way, the current method consider the Average Row Penalty (ARP) and Average Column Penalty (ACP) which are the averages of the differences of cell values of each row and each column respectively from the lowest cell value of the corresponding row and column of the TT. Allocations of costs are started in the cell along the row or column which has the highest ARP or ACP. These cells are called basic cells. The details of the developed algorithm with some numerical illustrations are discussed in this article to show that it gives better solution than VAM and some other familiar methods in some cases.
MODIFIED VOGEL APPROXIMATION METHOD FOR BALANCED TRANSPORTATION MODELS TOWARD...IAEME Publication
This paper is built on a study in relation to transportation problem as it affects most organisational decision in a decomposed setting. The case study used in this work is Dangote cement factory (in Ibese, Nigeria) with three sources and four destinationscentres. The factory is supported by increasing number of cement delivery trucks. Some models for solving balanced transportation problems (TPs) are considered in order to determine the optimal and initial basic feasible solutions (IBFS). From the analysis, it is observed that Modified Vogel Approximation Method (MVAM) is a better method. This is partly because MVAM considers each unit cost in its solution algorithm and minimises total cost comparatively with Vogel Approximation Method (VAM). The results arefurther justified and validated using windows version 2.00 Tora package.
MFBLP Method Forecast for Regional Load Demand SystemCSCJournals
Load forecast plays an important role in planning and operation of a power system. The accuracy of the forecast value is necessary for economically efficient operation and also for effective control. This paper describes a method of modified forward backward linear predictor (MFBLP) for solving the regional load demand of New South Wales (NSW), Australia. The method is designed and simulated based on the actual load data of New South Wales, Australia. The accuracy of discussed method is obtained and comparison with previous methods is also reported.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Differential evolution (DE) algorithm has been applied as a powerful tool to find optimum switching angles for selective harmonic elimination pulse width modulation (SHEPWM) inverters. However, the DE’s performace is very dependent on its control parameters. Conventional DE generally uses either trial and error mechanism or tuning technique to determine appropriate values of the control paramaters. The disadvantage of this process is that it is very time comsuming. In this paper, an adaptive control parameter is proposed in order to speed up the DE algorithm in optimizing SHEPWM switching angles precisely. The proposed adaptive control parameter is proven to enhance the convergence process of the DE algorithm without requiring initial guesses. The results for both negative and positive modulation index (M) also indicate that the proposed adaptive DE is superior to the conventional DE in generating SHEPWM switching patterns.
This presentation is made to represent the basic transportation model. The aim of this presentation is to implement the transportation model in solving transportation problem.
ANALYTICAL FORMULATIONS FOR THE LEVEL BASED WEIGHTED AVERAGE VALUE OF DISCRET...ijsc
In fuzzy decision-making processes based on linguistic information, operations on discrete fuzzy numbers are commonly performed. Aggregation and defuzzification operations are some of these often used operations. Many aggregation and defuzzification operators produce results independent to the decisionmaker’s strategy. On the other hand, the Weighted Average Based on Levels (WABL) approach can take into account the level weights and the decision maker's "optimism" strategy. This gives flexibility to the WABL operator and, through machine learning, can be trained in the direction of the decision maker's strategy, producing more satisfactory results for the decision maker. However, in order to determine the WABL value, it is necessary to calculate some integrals. In this study, the concept of WABL for discrete trapezoidal fuzzy numbers is investigated, and analytical formulas have been proven to facilitate the calculation of WABL value for these fuzzy numbers. Trapezoidal and their special form, triangular fuzzy numbers, are the most commonly used fuzzy number types in fuzzy modeling, so in this study, such numbers have been studied. Computational examples explaining the theoretical results have been performed.
A new three-term conjugate gradient method with application to regression an...IJECEIAES
Conjugate gradient (CG) method is well-known for its ability to solve unconstrained optimization (UO.) problems. This article presenting a new CG method with sufficient descent conditions which improves the former method developed by Rvaie, Mustafa, Ismail and Leong (RMIL). The efficacy of the proposed method has been demonstrated through simulations on the Kijang Emas pricing regression problem. The daily data between January 2021 to May 2021 were obtained from Malaysian Ministry of Health and Bank Negara Malaysia. The dependent variable for this study was the Kijang Emas price, and the independent variables were the coronavirus disease (COVID-19) measures (i.e., new cases, R-naught, death cases, new recovered). Data collected were analyzed on its correlation and coefficient determinant, and the influences of COVID-19 on Kijang Emas price was examined through multiple linear regression model. Findings revealed that the suggested technique outperformed the existing CG algorithms in terms of computing efficiency.
Similar to An improved tabular technique for presenting the various (20)
An improved tabular technique for presenting the various
1. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
163
An Improved Tabular Technique for Presenting the Various
Algorithms for Finding Initial Basic Feasible Solutions to
Transportation Problems
John Usen Effiong1*
Ikpang Ikpang Nkereuwem 1,2
1. Department of Statistics, University of Calabar, Calabar, Cross-River State, Nigeria
2. Department of Maths/Statistics, Cross River University of Technology, Calabar, Cross-River State,
Nigeria
*E-mail of corresponding author: johnusen2002@yahoo.com
Abstract
The special structure of the transportation problem allows securing a non-artificial starting basic solution using
one of the three methods: Northwest-corner Method, Least-cost Method and Vogel Approximation Method. The
difference among the three methods is the “quality” of the starting basic solution they produce, in the sense that a
good starting solution yields an optimal solution in a fewer number of iterations. In general, the Vogel
Approximation Method yields the best starting basic solution, and the Northwest-corner Method yields the worst.
However, the Northwest-corner Method involves the least computations. Extensive and critical examination
regarding the usage and improvement of these methods abound in several publications with trivial consideration
given to the development of a near-ideal technique for presenting these algorithms. This paper develops and
implements an all-encompassing tabular technique for presenting the algorithms for these three methods.
Keywords: Transportation problem, Improved Tabular Technique, Initial Basic Feasible Solution
1. Introduction
The transportation model is a special class of the linear programming problem. It deals with situations in which a
commodity is shipped from “sources” to “destinations” [Taha, 1997; Reeb & Leavengood, 2002; Bijulal, 2013].
The objective is to determine the amounts shipped from each source to each destination that minimize the total
shipping cost, while satisfying both the supply limits and the demand requirements [Taha, 1997; Sharma, 2009;
Bijulal, 2013]. The model assumes that the shipping cost on a given route is directly proportional to the number
of units shipped on that route [Taha, 1997; Reeb & Leavengood, 2002]. In general, the transportation model can
be extended to areas other than the direct transportation of a commodity, including, among others, inventory
control, employment scheduling, and personnel assignment [Taha, 1997; Reeb & Leavengood, 2002; Sharma,
2009].
The general problem is represented by the network below. In the network, there are m sources and n
destinations, each represented by a “node”. There are also “arcs” linking the sources and destinations. These arcs
represent the routes between the sources and the destinations. Arcs ji, joining source i to destination j
carry two pieces of information: [1] the transportation cost per unit ijc , and [2] the amount shipped ijx . The
amount of supply at source i is ia and the amount of demand at destination j is jb [Taha, 1997; Wang,
2008, Effanga, 2011].
Figure. Network for a General Transportation Problem
2b
nb
1b
ma
2a
1a
2
2
1 1
m n
1111 : xc
mnmn xc :
2. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
164
The objective of a transportation model is to determine the unknowns ijx that will minimize the total
transportation cost while satisfying all the supply and demand restrictions [Taha, 1997; Sharma, 2009; Effanga,
2011]. Mathematically, the problem, in general, may be stated as follows:
jix
njDx
miSxts
xcCMin
ij
j
m
i
ij
i
n
j
ij
m
i
n
j
ijij
,,0
,,3,2,1
,,3,2,1:.
1
1
1 1
where iS is the supply at origin i , jD is the demand at destination j , ijx is the number of units shipped
from origin i to destination j ,
m
i
n
j
ijij xcC
1 1
is the total shipping cost, and
n
j
j
m
i
i DS
11
.
The transportation algorithm follows the exact steps of the simplex. However, instead of using the regular
simplex tableau, advantage is taken of the special structure of the transportation model to present the algorithm
in a more convenient form [Taha, 1997; Reeb & Leavengood, 2002; Sharma, 2009].
There are several methods available to obtain an initial basic feasible solution. But the three major methods for a
transportation problem are the Northwest-corner Method, Least-cost Method and Vogel Approximation Method
[Taha, 1997; Sharma, 2009]. Each of these methods has variously been previously presented using a continuum
of tables for any given transportation problem as can be seen in the publications of Taha [1997], Reeb &
Leavengood [2002], Wang [2008], Sharma, [2009], Effanga [2011] and Bijulal [2013]. It is in this vain that this
paper presents an improvement of the presentation technique for the three major methods which utilizes just one
table for the routine with better detail and clarity than previous techniques; and a case study from Effanga [2011]
has been used for the implementation.
2. Methodology
The proposed presentation technique utilizes a “well-designed grid” which extends the tabular presentation of
the given problem beyond the supply rows and demand columns to as many more columns and rows that would
be needed in the course of the solution process. In this work, we call the new columns and rows are called
“stages”. Variations of the well-designed grid for each method have been considered for the purpose of flexibility
as explained below, and illustrated in the next section.
2.1 Northwest Corner Rule
For the presentation of the Northwest Corner Rule, its laid down algorithm is applied, as we iteratively extend
the columns and the rows [from stage to stage] until the supplies are exhausted and demands satisfied.
2.2 Least Cost Rows Method
The presentation, using this method, adheres to the laid-down algorithm of the method. It also proceeds
horizontally along and vertically down the well-designed grid in stages just like the case of the North-west
corner rule except for the introduction of a set of well-defined “keys” [based on the presenter’s discretion];
which are used in an ordered progression from the beginning of the solution process to the end. The keys [in
their order] are used in the solution steps of the algorithms and in the tabular presentation to ensure clarity when
deleting rows and columns in accordance with the laid down algorithms.
2.3 Vogel Approximation Method
In the case of the presentation technique for Vogel Approximation Method we acknowledge that the algorithm
for this technique includes rows and columns differences. Hence, as a variation of the presentation technique for
the Least-cost method, we have incorporated additional columns and rows just after each stage to cater for the
column and row differences respectively.
3. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
165
3. Illustrating The Proposed Tabular Presentation
Table 1. Case study
Destination
Origin 1 2 3 4 Si
1 8 6 10 9 35
2 9 12 13 7 50
3 14 9 16 5 40
Di 45 20 30 30
In order to illustrate the use of the proposed tabular technique, we have employed the use of a case study from
Effanga [2011]. This case study is a balanced transportation problem, and is presented in table 1. The problem
requires one to find the initial basic feasible solution using the Northwest-corner Method, Least-cost Method and
Vogel Approximation Method. We have used the proposed improved presentation technique for the three
algorithms in finding the initial basic feasible solution to this problem and have obtained table 2 below. However,
the illustrations of the solution process are shown in the tables 3 through 7.
Table 2. Initial basic feasible [IBF] solutions
S/N Method IBF Solution
1 Northwest-corner 1180
2 Least-cost 1080
3 Vogel Approximation 1020
Table 3. Northwest-corner method
Destination
Origin 1 2 3 4 Si Stag1 Stag2 Stag3 Stag4 Stag5 Stag6
1 8 6 10 9 35 35/35=0 0 0 0 0 0
2 9 12 13 7 50 50 50/10=40 40/20=20 20/20=0 0 0
3 14 9 16 5 40 40 40 40 40 40/10=30 30/30=0
Di 45 20 30 30 125
Stag1 45/35=10 20 30 30 90
Stag2 10/10=0 20 30 30 80
Stag3 0 20/20=0 30 30 60
Stag4 0 0 30/20=10 30 40
Stag5 0 0 10/10=0 30 30
Stag6 0 0 0 30/30=0 0
5. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
167
Cd6 - - 10 -
6 0 0 25/25=0 0
St6
Rd6 6
10 25/25=0
- 0
- 0
0
Table 7. Key for Vogel approximation method
Order of Deletion Name of Colour Colour Description
First – Fourth column Red
Second – Second row Yellow
Third – Second column Green
Fourth – Cells (1, 1) & (2, 1) Deep Blue
Fifth – Cell (2, 3) Sky Blue
Sixth – Cell (3, 3) White
6. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
168
4. Conclusion
The proposed tabular presentation technique for presenting the three major algorithms for finding initial basic
feasible solutions to transportation problems is explicit and gives better clarity to the solution process. It
simplifies all previous presentation patterns used for this same purpose in an all-encompassing manner. Hence,
tendencies are that it could extend its implementation to variants of these three major algorithms that may be
developed by researchers in research directions based on improving the existing algorithms. We therefore
recommend that this proposed presentation technique should be incorporated into the available tool-kits for
doing this routine.
References
Bijulal, D. (2013), “Transportation Problem”, MBA 202 – Operations Research, College of Engineering,
Trivaddium.
Effanga, E. O. (2011), “Transportation Problem”, Lecture Notes on STA 6022 – Mathematical Programming.
Department of Statistics, University of Calabar, Nigeria
Sharma, J. K.. (2009), “Transportation Problem”, Operations Research – Theory and Applications, Delhi:
Macmillan Publishers India Limited, 259 – 312.
Reeb, J. & Leavengood, S. (2002), “Transportation Problem – A Special Case for Linear Programming
Problems”, Operations Research: Performance Excellence in the Wood Products Industry.
Taha, H. A. (1997), “Transportation Problem”, Operations Research – Theory and Applications, Prentice-Hall
International, Inc, USA, 165 – 185.
Wang, J. Y. (2008), “Chapter 8 – The Transportation and Assignment Problems”, Operations Research, College
of Management, NCTU.s
7. Business, Economics, Finance and Management Journals PAPER SUBMISSION EMAIL
European Journal of Business and Management EJBM@iiste.org
Research Journal of Finance and Accounting RJFA@iiste.org
Journal of Economics and Sustainable Development JESD@iiste.org
Information and Knowledge Management IKM@iiste.org
Journal of Developing Country Studies DCS@iiste.org
Industrial Engineering Letters IEL@iiste.org
Physical Sciences, Mathematics and Chemistry Journals PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research JNSR@iiste.org
Journal of Chemistry and Materials Research CMR@iiste.org
Journal of Mathematical Theory and Modeling MTM@iiste.org
Advances in Physics Theories and Applications APTA@iiste.org
Chemical and Process Engineering Research CPER@iiste.org
Engineering, Technology and Systems Journals PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems CEIS@iiste.org
Innovative Systems Design and Engineering ISDE@iiste.org
Journal of Energy Technologies and Policy JETP@iiste.org
Information and Knowledge Management IKM@iiste.org
Journal of Control Theory and Informatics CTI@iiste.org
Journal of Information Engineering and Applications JIEA@iiste.org
Industrial Engineering Letters IEL@iiste.org
Journal of Network and Complex Systems NCS@iiste.org
Environment, Civil, Materials Sciences Journals PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science JEES@iiste.org
Journal of Civil and Environmental Research CER@iiste.org
Journal of Natural Sciences Research JNSR@iiste.org
Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL
Advances in Life Science and Technology ALST@iiste.org
Journal of Natural Sciences Research JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare JBAH@iiste.org
Journal of Food Science and Quality Management FSQM@iiste.org
Journal of Chemistry and Materials Research CMR@iiste.org
Education, and other Social Sciences PAPER SUBMISSION EMAIL
Journal of Education and Practice JEP@iiste.org
Journal of Law, Policy and Globalization JLPG@iiste.org
Journal of New Media and Mass Communication NMMC@iiste.org
Journal of Energy Technologies and Policy JETP@iiste.org
Historical Research Letter HRL@iiste.org
Public Policy and Administration Research PPAR@iiste.org
International Affairs and Global Strategy IAGS@iiste.org
Research on Humanities and Social Sciences RHSS@iiste.org
Journal of Developing Country Studies DCS@iiste.org
Journal of Arts and Design Studies ADS@iiste.org
8. The IISTE is a pioneer in the Open-Access hosting service and academic event management.
The aim of the firm is Accelerating Global Knowledge Sharing.
More information about the firm can be found on the homepage:
http://www.iiste.org
CALL FOR JOURNAL PAPERS
There are more than 30 peer-reviewed academic journals hosted under the hosting platform.
Prospective authors of journals can find the submission instruction on the following
page: http://www.iiste.org/journals/ All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than those
inseparable from gaining access to the internet itself. Paper version of the journals is also
available upon request of readers and authors.
MORE RESOURCES
Book publication information: http://www.iiste.org/book/
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek
EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar