• Title/Summary/Keyword: Weber problem

Search Result 19, Processing Time 0.02 seconds

ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE

  • Kazakovtsev, Lev A.;Stanimirovic, Predrag S.
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.1_2
    • /
    • pp.157-172
    • /
    • 2015
  • We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.

A GRASP heuristics for Expanded multi-source Weber problem on Reverse Logistics Network (역물류 네트워크를 위한 확장된 복수 Weber 문제의 GRASP 해법)

  • Yang, Byoung-Hak
    • Journal of the Korea Safety Management & Science
    • /
    • v.12 no.1
    • /
    • pp.97-104
    • /
    • 2010
  • Expanded muti-source Weber problem (EWP), which introduced in this paper, is a reverse logistics network design problem to minimize the total transportation cost from customers thorough regional center to central center. Decision factor of EWP are the locations of regional centers and a central center. We introduce a GRASP heuristics for the EWP. In the suggested GRASP, an expanded iterative location allocation method (EILA) is introduced based on the Cooper's iterative location allocation method[3]. For the initial solution of GRASP, allocation first seed (AFSeed) and location first seed (LFSeed) are developed. The computational experiment for the objective value shows that the LFSeed is better than the AFSeed. Also the calculating time of the LFSeed is better than that of the AFSeed.

A MIXED INTEGRAL EQUATION IN THE QUASI-STATIC DISPLACEMENT PROBLEM

  • Badr, Abdallah A.
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.2
    • /
    • pp.575-583
    • /
    • 2000
  • In this work, we solve the Fredholm-Volterra integral equation(FVIE) when the kernel takes a potential function form under given conditions. we represent this kernel in the Weber-sonin integral form.

Weighted Histogram Equalization Method adopting Weber-Fechner's Law for Image Enhancement (이미지 화질개선을 위한 Weber-Fechner 법칙을 적용한 가중 히스토그램 균등화 기법)

  • Kim, Donghyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.7
    • /
    • pp.4475-4481
    • /
    • 2014
  • A histogram equalization method have been used traditionally for the image enhancement of low quality images. This uses the transformation function, which is a cumulative density function of an input image, and it has mathematically maximum entropy. This method, however, may yield whitening artifacts. This paper proposes the weighted histogram equalization method based on histogram equalization. It has Weber-Fechner's law for a human's vision characteristics, and a dynamic range modification to solve the problem of some methods, which yield a transformation function, regardless of the input image. Finally, the proposed transformation function was calculated using the weighted average of Weber-Fechner and the histogram equalization transformation functions in a modified dynamic range. The simulation results showed that the proposed algorithm effectively enhances the contrast in terms of the subjective quality. In addition, the proposed method has similar or higher entropy than the other conventional approaches.

Generalized Vehicle Routing Problem for Reverse Logistics Aiming at Low Carbon Transportation

  • Shimizu, Yoshiaki;Sakaguchi, Tatsuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.2
    • /
    • pp.161-170
    • /
    • 2013
  • Deployment of green transportation in reverse logistics is a key issue for low carbon technologies. To cope with such logistic innovation, this paper proposes a hybrid approach to solve practical vehicle routing problem (VRP) of pickup type that is common when considering the reverse logistics. Noticing that transportation cost depends not only on distance traveled but also on weight loaded, we propose a hierarchical procedure that can design an economically efficient reverse logistics network even when the scale of the problem becomes very large. Since environmental concerns are of growing importance in the reverse logistics field, we need to reveal some prospects that can reduce $CO_2$ emissions from the economically optimized VRP in the same framework. In order to cope with manifold circumstances, the above idea has been deployed by extending the Weber model to the generalized Weber model and to the case with an intermediate destination. Numerical experiments are carried out to validate the effectiveness of the proposed approach and to explore the prospects for future green reverse logistics.

Face Recognition based on Weber Symmetrical Local Graph Structure

  • Yang, Jucheng;Zhang, Lingchao;Wang, Yuan;Zhao, Tingting;Sun, Wenhui;Park, Dong Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1748-1759
    • /
    • 2018
  • Weber Local Descriptor (WLD) is a stable and effective feature extraction algorithm, which is based on Weber's Law. It calculates the differential excitation information and direction information, and then integrates them to get the feature information of the image. However, WLD only considers the center pixel and its contrast with its surrounding pixels when calculating the differential excitation information. As a result, the illumination variation is relatively sensitive, and the selection of the neighbor area is rather small. This may make the whole information is divided into small pieces, thus, it is difficult to be recognized. In order to overcome this problem, this paper proposes Weber Symmetrical Local Graph Structure (WSLGS), which constructs the graph structure based on the $5{\times}5$ neighborhood. Then the information obtained is regarded as the differential excitation information. Finally, we demonstrate the effectiveness of our proposed method on the database of ORL, JAFFE and our own built database, high-definition infrared faces. The experimental results show that WSLGS provides higher recognition rate and shorter image processing time compared with traditional algorithms.

Optimization of 3D Triangular Mesh Watermarking Using ACO-Weber's Law

  • Narendra, Modigari;Valarmathi, M.L.;Anbarasi, L.Jani
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4042-4059
    • /
    • 2020
  • The development of new multimedia techniques such as 3D printing is increasingly attracting the public's attention towards 3D objects. An optimized robust and imperceptible watermarking method based on Ant Colony Optimization (ACO) and Weber Law is proposed for 3D polygonal models. The proposed approach partitions the host model into smaller sub meshes and generates a secret watermark from the sub meshes using Weber Law. ACO based optimized strength factor is identified for embedding the watermark. The secret watermark is embedded and extracted on the wavelet domain. The proposed scheme is robust against geometric and photometric attacks that overcomes the synchronization problem and authenticates the secret watermark from the distorted models. The primary characteristic of the proposed system is the flexibility achieved in data embedding capacity due to the optimized strength factor. Extensive simulation results shows enhanced performance of the recommended framework and robustness towards the most common attacks like geometric transformations, noise, cropping, mesh smoothening, and the combination of such attacks.

A Hierarchical Hybrid Meta-Heuristic Approach to Coping with Large Practical Multi-Depot VRP

  • Shimizu, Yoshiaki;Sakaguchi, Tatsuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.2
    • /
    • pp.163-171
    • /
    • 2014
  • Under amazing increase in markets and certain demand on qualified service in the delivery system, global logistic optimization is becoming a keen interest to provide an essential infrastructure coping with modern competitive prospects. As a key technology for such deployment, we have been engaged in the practical studies on vehicle routing problem (VRP) in terms of Weber model, and developed a hybrid approach of meta-heuristic methods and the graph algorithm of minimum cost flow problem. This paper extends such idea to multi-depot VRP so that we can give a more general framework available for various real world applications including those in green or low carbon logistics. We show the developed procedure can handle various types of problem, i.e., delivery, direct pickup, and drop by pickup problems in a common framework. Numerical experiments have been carried out to validate the effectiveness of the proposed method. Moreover, to enhance usability of the method, Google Maps API is applied to retrieve real distance data and visualize the numerical result on the map.

Exact Evaluation of a Sommerfeld Integral for the Impedance Half-Plane Problem (임피던스 반 평면에 대한 Sommerfeld 적분의 Closed-Form 계산)

  • Koh Il-Suek
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.8 s.111
    • /
    • pp.788-794
    • /
    • 2006
  • In this paper, a Sommerfeld integral for an impedance half-plane is considered, which is one of classical problems in electromagnetic theory. First, the integral is evaluated into two series representations which are expressed in terms of exponential integral and Lommel function, respectively. Then based on the Lommel function expansion, an exact, closed-form expression of the integral is formulated, written in terms of incomplete Weber integrals. Additionally, based on the exponential integral expansion, an approximate expression of the integral is obtained. Validity of all formulations derived in this paper is demonstrated through comparisons with a numerical integration of the integral for various situations.

Elaborate Image Quality Assessment with a Novel Luminance Adaptation Effect Model (새로운 광적응 효과 모델을 이용한 정교한 영상 화질 측정)

  • Bae, Sung-Ho;Kim, Munchurl
    • Journal of Broadcast Engineering
    • /
    • v.20 no.6
    • /
    • pp.818-826
    • /
    • 2015
  • Recently, objective image quality assessment (IQA) methods that elaborately reflect the visual quality perception characteristics of human visual system (HVS) have actively been studied. Among those characteristics of HVS, luminance adaptation (LA) effect, indicating that HVS has different sensitivities depending on background luminance values to distortions, has widely been reflected into many existing IQA methods via Weber's law model. In this paper, we firstly reveal that the LA effect based on Weber's law model has inaccurately been reflected into the conventional IQA methods. To solve this problem, we firstly derive a new LA effect-based Local weight Function (LALF) that can elaborately reflect LA effect into IQA methods. We validate the effectiveness of our proposed LALF by applying LALF into SSIM (Structural SIMilarity) and PSNR methods. Experimental results show that the SSIM based on LALF yields remarkable performance improvement of 5% points compared to the original SSIM in terms of Spear rank order correlation coefficient between estimated visual quality values and measured subjective visual quality scores. Moreover, the PSNR (Peak to Signal Noise Ratio) based on LALF yields performance improvement of 2.5% points compared to the original PSNR.