A double VNS heuristic for the facility location and pricing problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A double VNS heuristic for the facility location and pricing problem

In this paper we present the problem of decision making on the facility location and pricing. We assume that the facilities can charge the different prices and the objective is to maximize the overall revenue. It is known that the problem is NPhard in the strong sense even for the given facility location. A two level local search heuristic based on the VNS framework is developed for this nonlin...

متن کامل

A Hybrid VNS for Connected Facility Location

The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆ V , a set of potential facility locations F ⊆ V (including a root r), and a set of Steiner nodes in the graph G = (V, E), a solution (F, T ) of ConFL represents a set of open facilities F ⊆ F , such that each customer ...

متن کامل

A hybrid multistart heuristic for the uncapacitated facility location problem

We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show extensive empirical evidence to the effectiveness of our algorithm in practice. For most benchmarks instances in the literature, we obtain solutions that are either optimal or a fraction of a percentage point away from it....

متن کامل

A hybrid DEA-based K-means and invasive weed optimization for facility location problem

In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...

متن کامل

Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem

In the two-stage capacitated facility location problem a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2012

ISSN: 1571-0653

DOI: 10.1016/j.endm.2012.10.005