RETRACTED ARTICLE: Conic Reformulations of a Class of Discrete Stochastic Location Problems with Congestion
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
No Canadian affiliation. An affiliation-only frame — the usual design — would never have seen this work. It is one of the works that make the case for inverting the frame.
Post-publication record
OpenAlex flags this work as retracted, but it carries no matching Retraction Watch record in this frame.
Machine scores (provisional)
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
- Teacher spread
- 0.215 · how far apart the two teachers sit on this one work
- Validation status
score_only:v0-immature-baseline· verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it
Abstract
In this paper, we study a class of discrete facility location problems with stochastic demand and congestion that arise in the design of various service systems. The problem is to determine the location and size of the facilities, as well as the assignment of clients to these facilities, to minimize the weighted sum of the total travel time, waiting time and service time at the facilities. Traditionally, these problems are formulated as mixed-integer nonlinear optimization problems that can be computationally challenging even for moderate-sized instances. We reformulate the problem as a mixed-integer second-order cone program and present two new formulations that are further strengthened using polymatroid inequalities. An exact and efficient branch-and-cut algorithm is proposed in which polymatroid inequalities are separated to improve convergence. Through computational experiments, we show that our reformulations are approximately twenty times faster than the exact cutting plane method and outperform other conic reformulations reported in the literature. Furthermore, the average computation time is reduced further by half when polymatroid inequalities are used with the reformulations. Using the proposed method, we solved a large, real-life instance of the optimal location of mammography screening centers in the city of Montreal, Canada, in a reasonable time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- IISE Transactions
- Topic
- Facility Location and Emergency Management
- Field
- Business, Management and Accounting
- Canadian institutions
- —
- Funders
- —
- Keywords
- Conic sectionClass (philosophy)Computer scienceMathematical optimizationMathematicsMathematical economicsArtificial intelligenceGeometry
- Has abstract in OpenAlex
- yes