Approximation of solutions for location problems

Idrissi, H.; Michelot, Christian

doi:10.1007/bf00938529

Cited by 25 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here the functions D j (·) are nondecreasing and concave. Stronger results on the local optima of (6) have also been derived in the subsequent work of Idrissi et al (1988). Actually these findings are all generalizations of Wendell and Hurter's (1973) early dominance results on the planar WP with 1 -norm.…”

Section: Lower Bounding Procedures For the Abb Algorithmmentioning

confidence: 53%

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

2012

View full text Add to dashboard Cite

Given the locations of J customers, their demands and I capacitated facilities, the Capacitated Multi-facility Weber Problem (CMWP) is concerned with locating I facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost which is proportional to the distance between them. We propose two types of branch and bound algorithms for the r distance CMWP with 1 ≤ r < ∞. One of them is an allocation space based branch and bound algorithm for which a new branching variable selection strategy and new lower bounding procedures have been proposed. The other one is new and partitions the location space. Based on extensive computational experiments we can say that the proposed algorithms are promising and perform better than the existing ones.

show abstract

Section: Lower Bounding Procedures For the Abb Algorithmmentioning

confidence: 53%

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

2012

View full text Add to dashboard Cite

show abstract

“…Sukopp andWittig, 1993). Location and approximation problems have been studied by many authors from the theoretical as well as the computational point of view (Chalmet, Francis and Kolen, 1981;Kuhn, 1973;Idrissi, Loridan and Michelot, 1988;Gerth (Tammer) and Pöhler, 1988;Tammer and Tammer, 1991;Wendell, Hurter and Lowe, 1973;Francis and White, 1974;Hamacher and Nickel, 1993 and many others). An interesting overview on algorithms for planar location problems is given in Hamacher (1995).…”

Section: Introductionmentioning

confidence: 99%

Decision Support for Location Problems in Town Planning

Patz

Spitzner

Tammer

2002

Int Trans Operational Res

View full text Add to dashboard Cite

Urban development and town planning need an adequate decision-making process. European cities, in particular, are compact. Urban elements and functions are in a constant state of change. Moreover, the large number of historic buildings and areas means a sensitive and responsible approach must be taken. The aim of this paper is to consider special location problems in town planning. We formulate multi-criteria location problems, derive optimality conditions and present a geometric algorithm and an interactive procedure including a proximal point algorithm for solving multi-criteria location problems. In this paper, we use location theory as a possible method to help determine the location of a children's playground in a newly-built district of Halle, Germany.

show abstract

Global Optimization in Location Problems

Tụy¹

2008

Encyclopedia of Optimization

View full text Add to dashboard Cite

Approximation of solutions for location problems

Cited by 25 publications

References 10 publications

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

Decision Support for Location Problems in Town Planning

Global Optimization in Location Problems

Contact Info

Product

Resources

About