نتایج جستجو برای: facility location dynamic dynamic location problems dlps time horizon review

تعداد نتایج: 3650645  

In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

2004
Roberto Diéguez Galvão

The objective of the present paper is to review my personal contributions in the field of uncapacitated facility location problems. These contributions took place throughout my academic career, from the time I was a Ph.D. student at Imperial College to the present day. They cover approximately 30 years, from 1973 to 2003; they address: algorithms developed for the p-median problem and for a gen...

2008
Behrouz Behmardi Shiwoo Lee

This paper concerns a dynamic multi-commodity capacitated facility location problem in supply chain, where different products flow throughout different layers of supply chain over a time horizon to meet customers’ demand. The capacity and the location of facilities need to be changed for supply chain to operate efficiently and respond quickly to demand changes. Relocating facilities or changing...

Journal: :Annals OR 2009
Reza Zanjirani Farahani Zvi Drezner Nasrin Asgari

In this paper a single facility location problem with multiple relocation opportunities is investigated. The weight associated with each demand point is a known function of time. We consider either rectilinear, or squared Euclidean, or Euclidean distances. Relocations can take place at pre-determined times. The objective function is to minimize the total location and relocation costs. An algori...

2005
Wenqiang Dai Peng Xiao Ke Jiang

Facility Location Problems have always been studied with the assumption that the environment in the network is static and does not change over time. In practice, however, the environment is usually dynamic and we must consider the facility location in a global view. In this paper, we impose the following additional constraints on input facilities: the total number of facilities to be placed is ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید