hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...

This paper presents a novel reliable hierarchical location-allocation model where facilities are subject to the risk of disruptions. Based on the relationship between various levels of system, a multi-level multi-flow hierarchy is considered. The heterogeneous probabilistic disruptions are investigated in which the constructed facilities have different site-dependent and independent failure rat...

In this paper we consider the problem of locating N new facilities with respect to M existing facilities in the plane and in the presence of polyhedral barriers. We assume that a barrier is a region where neither facility location nor traveling is permitted. For the resulting multi-dimensional mixed-integer optimization problem two different alternate location and allocation procedures are deve...

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

We study and compare asynchronous parallelization strategies for tabu search, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compared by using a tabu search algorithm for multicommodity location-allocation problems with balanc...

a new guideline for proper allocation of multipoles in the multiple multipole method (mmp) is proposed. in an ‘a posteriori’ approach, subspace fitting (ssf) is used to find the best location of multipole expansions for the two dimensional dielectric scattering problem. it is shown that the best location of multipole expansions (regarding their global approximating power) coincides with the med...