• No results found

maximal covering location problem (MCLP)

Dynamic capacitated maximal covering location problem by considering dynamic capacity   Pages 249-264
		 Download PDF

Dynamic capacitated maximal covering location problem by considering dynamic capacity Pages 249-264 Download PDF

... this problem is important (Yin & Mu, ...(multi-period) covering location problem is not new in the literature (Fazel Zarandi et ...dynamic maximal covering location ...

16

A Two-Phase Optimization Method for Solving the Multi-Type Maximal Covering Location Problem in Emergency Service Networks

A Two-Phase Optimization Method for Solving the Multi-Type Maximal Covering Location Problem in Emergency Service Networks

... Multi-Type Maximal Covering Location Problem (MTMCLP) that arises from the design of emergency service networks, and represents a generalization of the well-known Maximal ...

18

A Simulated Annealing method to solve a generalized maximal covering location problem   Pages 439-448
		 Download PDF

A Simulated Annealing method to solve a generalized maximal covering location problem Pages 439-448 Download PDF

... the maximal covering location problem is NP-hard and the proposed model of this paper is an extension of MCLP where three covering assumptions are relaxed, we can conclude that the ...

10

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

... The maximal covering location problem (MCLP) has been modeled as a binary integer program by Church and ReVelle ...This problem seeks to maximize the coverage of demand points with a ...

9

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 ...

11

GIS hotspot Application and Use of Set-Cover Problem For Centralized Abattoir Biogas Plant Treatment Facilities In Anambra State of Nigeria

GIS hotspot Application and Use of Set-Cover Problem For Centralized Abattoir Biogas Plant Treatment Facilities In Anambra State of Nigeria

... used maximal covering location problem to study the healthcare facilities of one of the districts in ...facility location models is covering problem. While covering ...

6

The multimode covering location problem

The multimode covering location problem

... facility location problem consists in placing a number of facilities to serve a set of demand centers, whose positions are known, while optimizing a given objective ...The problem admits several ...

24

A Multi Objective Obnoxious Facility Location Modelon a Plane

A Multi Objective Obnoxious Facility Location Modelon a Plane

... Vertex Covering Obnoxious Facility Location model on a Plane has been designed with a combination of three interacting criteria as follows: 1) Minimize the overall importance of the various exist- ing ...

7

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 ...

12

A NOVEL APPROACH TO GENERATE TEST CASES FOR COMPOSITION & SELECTION OF WEB 
SERVICES BASED ON MUTATION TESTING

A NOVEL APPROACH TO GENERATE TEST CASES FOR COMPOSITION & SELECTION OF WEB SERVICES BASED ON MUTATION TESTING

... is Maximal Covering Problem which has various applications of pure mathematics to determine the location of mobile network antennas or police ...of maximal covering ...

11

Variation In Greedy Approach To Set Covering Problem

Variation In Greedy Approach To Set Covering Problem

... Williams (2005) addressed the maximal covering sub-tree problem that applies to the design of the transport network and extensive facility location. Two objectives are involved in finding an ...

70

Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces

Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces

... feasibility problem, the zero point problem of maximal monotone operators, the minimization problem and the equilibrium problem, and to show that the unique minimum norm solution can be ...

20

Breakdown Mechanic Location Problem

Breakdown Mechanic Location Problem

... demand points. The numerical tests were performed by using the commercial MILP solver, namely IBM-CPLEX [13], with a total number of 1056 variables and 1057 constraints. The numerical experiments were executed on a ...

6

On  the  Equivalence  between  the  Set  Covering  Problem   and  the  Problem  of  Finding  Optimal  Cumulative  Assignment  Schemes

On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes

... the problem of finding optimal CAS’s and the SCP, lastly proves that finding CAS’s with minimum cardinality of the primitive share set (or minimum average information rate) is ...

12

Maximal Triangle Free Graph and Travelling Salesman Problem

Maximal Triangle Free Graph and Travelling Salesman Problem

... a maximal triangle free graph containing a large ...in maximal triangle free graphs containing a matching of size and having each vertex valency ...the problem to decide whether a graph can be made ...

9

A Solution to the Problem of the Maximal Number of Symbols for Biomolecular Computer

A Solution to the Problem of the Maximal Number of Symbols for Biomolecular Computer

... the maximal num- ber of symbols for a biomolecular automaton using the re- striction enzyme BbvI will be characterized through four stages, which are distinguished in the algorithm: the initial stage, the stage of ...

10

Approach to Solving K-Sat Problem Based on Reduction Thereof to the Covering Problem

Approach to Solving K-Sat Problem Based on Reduction Thereof to the Covering Problem

... the problem of the relationship of classes P and ...this problem are Stephen Arthur Cook, Professor from University of Toronto and a Turing Award winner, and Professor Leonid ...the problem of ...

15

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

... In public transportation, each passenger can be traveled under various modes (e.g. walking, driving, bicycling, Commuter Rail / Subway / Bus, taxi, boat). Therefore, in each system with regard to its characteristics, ...

12

The tag location problem

The tag location problem

... Chapter 2 surveyed a range of problems in tracking data regarding the accuracy of location estimates and the representation of track data. Uncertainties in loca- tion are compounded by inconsistencies with track ...

150

Heuristic and exact algorithms for Generalized Bin Covering Problem

Heuristic and exact algorithms for Generalized Bin Covering Problem

... A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum [3]. In many problems, a greedy strategy ...

10

Show all 10000 documents...

Related subjects