IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v34y2024i1p211-232id11.html
   My bibliography  Save this article

How to know it is “the one”? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization

Author

Listed:
  • Elif Göksu Öztürk
  • Ana Maria Rodrigues
  • José Soeiro Ferreira
  • Cristina Teles Oliveira

Abstract

Multi-objective optimization (MOO) considers several objectives to find a feasible set of solutions. Selecting a solution from Pareto frontier (PF) solutions requires further effort. This work proposes a new classification procedure that fits into the analytic hierarchy Process (AHP) to pick the best solution. The method classifies PF solutions using pairwise comparison matrices for each objective. Sectorization is the problem of splitting a region into smaller sectors based on multiple objectives. The efficacy of the proposed method is tested in such problems using our instances and real data from a Portuguese delivery company. A non-dominated sorting genetic algorithm (NSGA-II) is used to obtain PF solutions based on three objectives. The proposed method rapidly selects an appropriate solution. The method was assessed by comparing it with a method based on a weighted composite single-objective function.

Suggested Citation

  • Elif Göksu Öztürk & Ana Maria Rodrigues & José Soeiro Ferreira & Cristina Teles Oliveira, 2024. "How to know it is “the one”? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(1), pages 211-232.
    • Handle: RePEc:wut:journl:v:34:y:2024:i:1:p:211-232:id:11
    DOI: 10.37190/ord240111
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2024vol34no1_11.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord240111?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    2. Ivorra, Benjamin & Mohammadi, Bijan & Manuel Ramos, Angel, 2015. "A multi-layer line search method to improve the initialization of optimization algorithms," European Journal of Operational Research, Elsevier, vol. 247(3), pages 711-720.
    3. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    4. Rodrigo Rebolledo & Ana Ulloa & Óscar Cornejo & Carlos Obreque & Felipe Baesler, 2024. "Optimizing Districting and Seat Allocation for Enhanced Representativeness in Chile’s Chamber of Deputies," Mathematics, MDPI, vol. 12(24), pages 1-14, December.
    5. Rui Fragoso & Conceição Rego & Vladimir Bushenkov, 2016. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 14(2), pages 179-198, December.
    6. Xin Tang & Ameur Soukhal & Vincent T’kindt, 2014. "Preprocessing for a map sectorization problem by means of mathematical programming," Annals of Operations Research, Springer, vol. 222(1), pages 551-569, November.
    7. Steiner, Maria Teresinha Arns & Datta, Dilip & Steiner Neto, Pedro José & Scarpin, Cassius Tadeu & Rui Figueira, José, 2015. "Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil," Omega, Elsevier, vol. 52(C), pages 53-64.
    8. Scheuerer, Stephan & Wendolsky, Rolf, 2006. "A scatter search heuristic for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 533-547, March.
    9. Jörg Kalcsics & Stefan Nickel & Michael Schröder, 2005. "Towards a unified territorial design approach — Applications, algorithms and GIS integration," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(1), pages 1-56, June.
    10. Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
    11. Haugland, Dag & Ho, Sin C. & Laporte, Gilbert, 2007. "Designing delivery districts for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 180(3), pages 997-1010, August.
    12. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
    13. Douglas M. King & Sheldon H. Jacobson & Edward C. Sewell & Wendy K. Tam Cho, 2012. "Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning," Operations Research, INFORMS, vol. 60(5), pages 1213-1228, October.
    14. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    15. Swamy, Rahul & King, Douglas M. & Ludden, Ian G. & Dobbs, Kiera W. & Jacobson, Sheldon H., 2024. "A practical optimization framework for political redistricting: A case study in Arizona," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).
    16. Balázs Fleiner & Balázs Nagy & Attila Tasnádi, 2017. "Optimal partisan districting on planar geographies," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 879-888, December.
    17. Burcin Bozkaya & Erhan Erkut & Dan Haight & Gilbert Laporte, 2011. "Designing New Electoral Districts for the City of Edmonton," Interfaces, INFORMS, vol. 41(6), pages 534-547, December.
    18. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    19. Dilip Datta & Jacek Malczewski & José Rui Figueira, 2012. "Spatial Aggregation and Compactness of Census Areas with a Multiobjective Genetic Algorithm: A Case Study in Canada," Environment and Planning B, , vol. 39(2), pages 376-392, April.
    20. Mai, Feng & Fry, Michael J. & Ohlmann, Jeffrey W., 2018. "Model-based capacitated clustering with posterior regularization," European Journal of Operational Research, Elsevier, vol. 271(2), pages 594-605.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wut:journl:v:34:y:2024:i:1:p:211-232:id:11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.