• No results found

covering location-allocation problem

A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem 
with M/M/1 Queueing System

A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System

... maximal covering location-allocation problem discussed in ...the location of at most p service centers and allocate demand points to those centers so that the population covered is ...

9

A robust approach to multi period covering location-allocation problem in pharmaceutical supply chain

A robust approach to multi period covering location-allocation problem in pharmaceutical supply chain

... capacitated covering location-allocation model for pharmaceutical ...maximum covering model by adding zone ...centers, covering location-allocation problem, robust ...

14

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

... A hub location problem is applied when it is cost- effective to join and distribute the flow at a centralised location called a hub node. Flow concentration and consolidation take place on the arcs ...

12

Differential evolution algorithm for multi-commodity and multi-level of service hub covering location problem   Pages 127-138
		 Download PDF

Differential evolution algorithm for multi-commodity and multi-level of service hub covering location problem Pages 127-138 Download PDF

... hub location problem involves a network of origins and destinations over which transportation takes ...the location of hub nodes and the allocation of demand nodes to these located hub nodes ...

12

A Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs

A Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs

... of location problems considering inventory approaches that use performance constraints to increase the efficiency of networks, some are mentioned below: Cole [24]; Nozick and Turnquist [25-27]; Daskin et ...and ...

10

Capacitated Single-Assignment Hub Covering Location Problem under Fuzzy Environment

Capacitated Single-Assignment Hub Covering Location Problem under Fuzzy Environment

... This section presents the result of fuzzy capacitated single-allocation hub covering location problem. This paper uses CAB and AP data set to do the experiment. The CAB data set [21] comes ...

6

A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities

A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities

... facility location networks subjected to ...hub location problem that build reliable network by explicitly considering possible disruption at hub facilities in the design ...hub location ...

13

Fuzzy Hierarchical Queueing Models for the Location Set Covering Problem in Congested Systems

Fuzzy Hierarchical Queueing Models for the Location Set Covering Problem in Congested Systems

... developing location models, most eorts can be categorized into a class of qualitative ...p-median problem as a fuzzy model and came up with an exact method of ...set covering and fuzzy sets to ...

11

Fuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem

Fuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem

... customer covering in the general model of the maximum coverage ...a location-allocation problem in fuzzy method for density of systems, and they called it maximum coverage ...

21

A multiobjective continuous covering location model

A multiobjective continuous covering location model

... location problem. Guillen et al. (2005) considered the design and retrofit problem of a supply chain consisting of several production plants, warehouses, markets and the associated distribution ...

13

Mathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters

Mathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters

... he problem of maximal hub covering as a challenging problem in operation ...optimal location of a set of hubs to reach maximum flow in a ...the problem such as origin-destination flows, ...

12

Genetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure

Genetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure

... the location of hubs, and the assignment of spokes to the hubs but they did not consider stepwise functions in the ...hub location problems. They solved un-capacitated multiple allocation p-hub ...

17

Comparing population and incident data for optimal air ambulance base locations in Norway

Comparing population and incident data for optimal air ambulance base locations in Norway

... Optimal base locations were determined by modelling the problem as a Maximal Covering Location Problem (MCLP) [18]. The MCLP model maximizes the number of demand locations covered by at least ...

11

A Nonlinear Model for a Capacitated Location-allocation Problem with Bernoulli Demand using Sub-sources

A Nonlinear Model for a Capacitated Location-allocation Problem with Bernoulli Demand using Sub-sources

... Facility location problem has been continuously studied in operations ...optimization problem in which the goal is to minimize the cost of operated facilities to serve the demand ...the ...

10

The Hierarchical Hub Covering Problem with Innovative Allocation Procedure by Covering Radiuses

The Hierarchical Hub Covering Problem with Innovative Allocation Procedure by Covering Radiuses

... hub location problem, entitled the hub covering ...hub covering problem nds the location of a hub and allocates demand nodes to opening hub facilities, so that the travel time ...

23

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

... hub location problem is divided to five major classes, namely p-hub median, hub location with fixed cost, p-hub center, hub covering and hub edge location ...median problem, ...

16

Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)

Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)

... hub location and network design formulation that considered the fixed costs of establishing the hubs and the arcs in the ...The problem was formulated as a mixed integer programming problem embedding ...

14

Algorithmic Methods for Concave Optimization Problems

Algorithmic Methods for Concave Optimization Problems

... LMRP problem can be solved by Lagrangian relaxation quite efficiently, just like the UFLP, as- suming that the ratio of the customer demand rate and the standard deviation of daily demand are ...

13

SECRET DATA HIDING BY OPTIMIZING GENERAL SMOOTHNESS DIFFERENCE EXPANSION BASED 
METHOD

SECRET DATA HIDING BY OPTIMIZING GENERAL SMOOTHNESS DIFFERENCE EXPANSION BASED METHOD

... facility location decisions in supply chain ...facility location problem. They expand the context of facility location decisions to incorporate additional features of a supply chain ...of ...

13

Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms

Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms

... The optimization concept is to find some values among the parameters of a function to optimize that function. All the proper values for this are possible solutions and the best of them is known as the optimal solution. ...

8

Show all 10000 documents...

Related subjects