NDLI: A Gravitational Facility Location Problem based on Prize-Collecting Traveling Salesman Problem

Content Provider	IEEE Xplore Digital Library
Author	Ma Yunfeng Li Lu Yang Jun
Copyright Year	2012
Description	Author affiliation: School of Management, Huazhong University of Science & Technology, Wuhan, Hubei Province,430074, China (Yang Jun) \|\| School of Management, Wuhan University of Science & Technology, Hubei Province, 430081, China (Ma Yunfeng; Li Lu)
Abstract	We consider a facility location scenario that is common in public transit or logistics system planning where the service area and demand area have been laid out and another set of facilities need to be set up to connect these two kinds of area. Given a network G=(V, A), we model this kind problem as a Gravitational Facility Location Problem (GFLP) with consideration of service accessibility and the feature of demand. We firstly formulate a GFLP with budget constraint to maximize total accessibility of selected demand and service area measured by Newton's law of universal gravitation. Secondly, GFLP is reduced to Gravitational Prize-Collecting Salesman Problem (GPCSP) according to the properties of needs in demand area. Even the reduced problem GPCSP is a generalization of Prize- Collecting Traveling Salesman Problem (PCTSP) which belongs to the hard core of NP-hard problems. Thirdly, we develop a merger-cluster based grafting heuristic algorithms for GPCSP, comparing with an adapted heuristics from an $O(log^{2}$ (min (R, n)) -approximation algorithm proposed by Awerbuch et al. The numerical examples show that our algorithm is more effective on a set of instances tailored from on line database for PCST instances and three cities street network.
Starting Page	511
Ending Page	516
File Size	477551
Page Count	6
File Format	PDF
ISBN	9781467303620
ISSN	21618151
e-ISBN	9781467303644
e-ISBN	9781467303637
DOI	10.1109/ICAL.2012.6308257
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-08-15
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Prize-collecting Salesman Clustering algorithms Steiner Tree Vegetation Approximation algorithms Linear programming Planning Approximation methods Facility Location
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

A matheuristic algorithm for the Prize-collecting Steiner Tree Problem

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

LP-Based Algorithms for Capacitated Facility Location

A Faster, Better Approximation Algorithm for the Minimum Latency Problem

A density based model for facility location problem

Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems

A Gravitational Facility Location Problem based on Prize-Collecting Traveling Salesman Problem

Similar Documents

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

A matheuristic algorithm for the Prize-collecting Steiner Tree Problem

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

LP-Based Algorithms for Capacitated Facility Location

A Faster, Better Approximation Algorithm for the Minimum Latency Problem

A density based model for facility location problem

Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems

A Gravitational Facility Location Problem based on Prize-Collecting Traveling Salesman Problem