2013
DOI: 10.1007/978-3-319-00795-3_18
|View full text |Cite
|
Sign up to set email alerts
|

Relevant Network Distances for Approximate Approach to Large p-Median Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
4
1

Relationship

3
6

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…The necessity to solve big instances of the p-median problem lead to design of special algorithm (Avella et al 2007) and also to development of very effective radial formulation of the problem. The radial formulation was used both in construction of special software tool (García et al 2011) and in suggesting an approximate approach implementable on common commercial Integer Programming (IP)-solver (Janáček 2008;Janacek, Kvet 2014).…”
Section: Literature Reviewmentioning
confidence: 99%
“…The necessity to solve big instances of the p-median problem lead to design of special algorithm (Avella et al 2007) and also to development of very effective radial formulation of the problem. The radial formulation was used both in construction of special software tool (García et al 2011) and in suggesting an approximate approach implementable on common commercial Integer Programming (IP)-solver (Janáček 2008;Janacek, Kvet 2014).…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the benchmarks, the generalized disutility perceived by a user sharing a given location was the sum of three distances from the user's location to the three nearest vehicle locations. The suffixes BG and BGh denote bisection approaches, where the IP-solver solves the optimization problem for a fixed value G t at each step t. The denotation BG corresponds to the models (18), (3)-(6), (8), (9), (19) or (23), (12), (13), (15), (16), (24), while the denotation BGh is used for the models (20), (3)- (6), (8), (9), (21), (22) or (25), (12), (13), (15), (16), (26), (22) depending on location-allocation or radial formulations. To solve the problems described by the mentioned models, optimization software FICO Xpress 7.3 (64-bit, release 2012) was used and the experiments were run on a PC equipped with the Intel® Core™ i7 3610 QM processor, at 2.3 GHz and with 8 GB RAM.…”
Section: Computational Studymentioning
confidence: 99%
“…In this paper, we focus on a problem-solving method for the initial phase, when the generalized disutility is considered. Based on our experiences in designing the min-sum optimal public service system, we found that the radial formulation of the problem can considerably accelerate the associated problem-solving process [1,4,6,8]. Furthermore, we can start from our previous research [7,10], where we developed and successfully tested radial formulation of the min-sum service system design problem with the generalized disutility.…”
Section: Introductionmentioning
confidence: 99%
“…Regardless of the type of distance, representing travelling time, cost or other form of social costs, this approach usually involves the weighted p-median problem [8,9]. Complexity of the pmedian problem and the necessity to solve large instances of the problem has led to the search for a suitable algorithm suitable to the task.…”
Section: Introductionmentioning
confidence: 99%