Capacity management in public service facility networks: a model, computational tests and a case study

Bruno, Giuseppe; Genovese, Andrea; Piccolo, Carmela

doi:10.1007/s11590-015-0923-2

Cited by 19 publications

(9 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e 2E-LRPSPD deals with the location of satellites. For a facility location problem, Bruno et al [65] presented a mathematical model for facility location systems in noncompetitive contexts. An and Svensson [66] reviewed the approximation algorithms for a facility location problem.…”

Section: Studies Related To 2e-lrpspdmentioning

confidence: 99%

Presenting a Multi-Start Hybrid Heuristic for Solving the Problem of Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD)

Fan

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

This study proposes a three-index flow-based mixed integer formulation to solve a two-echelon location routing problem with simultaneous pickup and delivery. In this formulation, pickup and delivery demands can be addressed using the same vehicle in each echelon of the network to reduce costs and increase logistics efficiency. We solve such NP-hard problem by developing a multistart hybrid heuristic with path relinking (MHH-PR) which is composed of local search and a variable neighbourhood descent algorithm. In the algorithm, three constructive heuristics are applied to generate diversified initial solutions, and path relinking is introduced for intensification and postoptimisation. Results indicate that MHH-PR can reduce the gap between the near optimal and global optimal solutions by 1%-2%. The proposed algorithm significantly improves computational efficiency by reducing the computational time of more than 10 min for existing cases involving 20 nodes to less than 10 s.

show abstract

Section: Studies Related To 2e-lrpspdmentioning

confidence: 99%

Presenting a Multi-Start Hybrid Heuristic for Solving the Problem of Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD)

Fan

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…A review of the main methodological issues and applications of the PMP is out of the scope of this article. Hence, we address the interested reader to several comprehensive surveys and papers .…”

Section: Literature Reviewmentioning

confidence: 99%

A three‐stage p‐median based exact method for the optimal diversity management problem

et al. 2018

View full text Add to dashboard Cite

The optimal diversity management problem (ODMP) arises in many application fields when a company, producing a good and/or a service customizable with options, has to satisfy many different client demands with various subset of options, but only a limited number of option combinations can be produced. ODMP can be represented by a disconnected network and formulated as a large-scale p-median problem (PMP). In this article we improve a known decomposition approach where smaller PMPs, related to the network components, can be solved instead of the initial large problem. The proposed method is structured in three stages and it combines Lagrangian relaxation-based techniques, variable fixing and reduction tests, and a dynamic programming algorithm. It drastically reduces the number and the dimensions of the p-median subproblems to be solved to optimality by a MIP solver and to be combined to determine the optimal solution of the original PMP by a multiple choice knapsack problem. A sequential and a parallel implementation of the method are provided and tested. Obtained results on known and new test instances show that our approach considerably outperforms state-of-the-art algorithms for large-scale ODMPs.decomposition, Lagrangian relaxation, multiple choice knapsack, optimal diversity management, p-median, parallel computing I N T R O D U C T I O NThe optimal diversity management problem (ODMP) is a well-known optimization problem arising in many application fields, every time a company produces a good and/or a service which can be provided with options. In this case the product can be personalized by the customer who can choose different option combinations (configurations) depending on her/his needs or preferences. In this context, satisfying all the possible demands with exactly the required options would impose a company to produce all the possible configurations in advance and manage all of them at the assembly lines. Moreover, the production operations could start only after a demand is received, so providing huge delays in satisfying a request. To overcome these drawbacks, a company usually produces a limited number of opportunely chosen configurations to cover all the possible ones. In this way a demand, if no available configuration contains exactly the required options, can be satisfied by a compatible configuration, that is, by a configuration containing all the required options plus some others undemanded by the customer. This implies that a client could receive some unrequired options, so generating an over-cost for the company.

show abstract

“…schools, post offices, emergency services, fire stations, hospitals, ambulances) and private (i.e. plants, warehouses, industrial sites) facilities (Aboolian et al, 2007, Bruno et al, 2015.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In the literature, such studies have been conducted in several countries. For studies conducted in Italy, see Bruno et al (2015;2016). The former presented a mathematical model to support location decisions oriented to rationalize facility systems in non-competitive contexts.…”

Section: Literature Reviewmentioning

confidence: 99%

Proposed system for analyzing the location of preschools: a Brazilian case study

Endler

Scarpin

Steiner

2017

BJO&PM

View full text Add to dashboard Cite

Early infant education and care have become priority issues in Brazil. The present article evaluates the spatial distribution of public preschools in the municipality of Curitiba, in Paraná State, Brazil. This problem is an important aspect of school administration and can relieve problems of inequality in public education, such as accessibility and availability of places. The main contribution of this article is the system it proposes for rationalizing decision-making in the education system in question. This system presents four complementary analyses, although they are independent of one another: (i) analysis of the current location of facilities; (ii) analysis of the proposed location; (iii) analysis for expanding the capacity of existing units; and (iv) analysis of the opening of new facilities. The models were generated using VB.NET © modeling language and were solved by the CPLEX © solver. The results showed that, in general, there is a need for immediate planning to increase the number of places available in public infant education in Curitiba, which is also a requirement for compliance with the goals of the National Education Plan (NEP) that is now in force nationwide.

show abstract

Capacity management in public service facility networks: a model, computational tests and a case study

Cited by 19 publications

References 33 publications

Presenting a Multi-Start Hybrid Heuristic for Solving the Problem of Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD)

Presenting a Multi-Start Hybrid Heuristic for Solving the Problem of Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD)

A three‐stage p‐median based exact method for the optimal diversity management problem

Proposed system for analyzing the location of preschools: a Brazilian case study

Contact Info

Product

Resources

About