Skip to main content
Top
Published in: Journal of Applied and Industrial Mathematics 4/2021

01-11-2021

Reduction of the Pareto Set of a Special Structure in Bicriteria Discrete Problems

Authors: A. O. Zakharov, Yu. V. Kovalenko

Published in: Journal of Applied and Industrial Mathematics | Issue 4/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We investigate the bicriteria discrete optimization problems in the context of the axiomatic approach reducing the Pareto set. The degree of the reduction with respect to values of the coefficient of compromise is evaluated for the special structures and general case of the Pareto set. We apply the results to the set covering problems and the vehicle routing problems.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference O. I. Larichev, Decision-Making Theory and Methods as Well as a Chronicle of Events in Magical Lands (Logos, Moscow, 2006) [in Russian]. O. I. Larichev, Decision-Making Theory and Methods as Well as a Chronicle of Events in Magical Lands (Logos, Moscow, 2006) [in Russian].
2.
go back to reference A. V. Lotov and I. I. Pospelova, Multicriteria Decision Making Problems (MAKS Press, Moscow, 2008) [in Russian]. A. V. Lotov and I. I. Pospelova, Multicriteria Decision Making Problems (MAKS Press, Moscow, 2008) [in Russian].
3.
go back to reference A. V. Petrovsky, Decision Making Theory (Akademija, Moscow, 2009) [in Russian]. A. V. Petrovsky, Decision Making Theory (Akademija, Moscow, 2009) [in Russian].
4.
go back to reference A. Ishizaka and P. Nemery, Multi-Criteria Decision Analysis: Methods and Software (Wiley, Hoboken, NJ, 2013).CrossRef A. Ishizaka and P. Nemery, Multi-Criteria Decision Analysis: Methods and Software (Wiley, Hoboken, NJ, 2013).CrossRef
5.
go back to reference M. Ehrgott, J. L. Figueira, and S. Greco, Trends in Multiple Criteria Decision Analysis (Springer, New York, 2010).CrossRef M. Ehrgott, J. L. Figueira, and S. Greco, Trends in Multiple Criteria Decision Analysis (Springer, New York, 2010).CrossRef
6.
go back to reference S. Greco, M. Ehrgott, and J. L. Figueira, Multiple Criteria Decision Analysis: State of the Art Surveys (Springer, New York, 2016).CrossRef S. Greco, M. Ehrgott, and J. L. Figueira, Multiple Criteria Decision Analysis: State of the Art Surveys (Springer, New York, 2016).CrossRef
7.
go back to reference O. I. Larichev, Verbal Analysis of Solutions, Ed. by A. B. Petrovsky (Nauka, Moscow, 2006) [in Russian]. O. I. Larichev, Verbal Analysis of Solutions, Ed. by A. B. Petrovsky (Nauka, Moscow, 2006) [in Russian].
8.
go back to reference V. D. Nogin, Pareto Set Reduction: An Axiomatic Approach (Fizmatlit, Moscow, 2016) [in Russian]. V. D. Nogin, Pareto Set Reduction: An Axiomatic Approach (Fizmatlit, Moscow, 2016) [in Russian].
9.
go back to reference A. O. Zakharov and Yu. V. Kovalenko, “Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem,” in Optimization Problems and Their Applications. Revised Selected Papers. 7th International Conference (Omsk, Russia, July 8–14, 2018), Ed. by A. Eremeev, M. Khachay, Yu. Kochetov, and P. Pardalos (Cham: Springer, 2018), pp. 93–105. A. O. Zakharov and Yu. V. Kovalenko, “Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem,” in Optimization Problems and Their Applications. Revised Selected Papers. 7th International Conference (Omsk, Russia, July 8–14, 2018), Ed. by A. Eremeev, M. Khachay, Yu. Kochetov, and P. Pardalos (Cham: Springer, 2018), pp. 93–105.
10.
go back to reference A. O. Zakharov and Yu. V. Kovalenko, “Construction and Reduction of the Pareto Set in Asymmetric Travelling Salesman Problem with Two Criteria,” Vestnik St.-Petersburg Univ. Ser. Prikl. Mat., Informat., Proc. Upravl. 14 (4), 378–392 (2018).MathSciNet A. O. Zakharov and Yu. V. Kovalenko, “Construction and Reduction of the Pareto Set in Asymmetric Travelling Salesman Problem with Two Criteria,” Vestnik St.-Petersburg Univ. Ser. Prikl. Mat., Informat., Proc. Upravl. 14 (4), 378–392 (2018).MathSciNet
11.
go back to reference A. O. Zakharov and Yu. V. Kovalenko, “Structures of the Pareto Set and Their Reduction in Bicriteria Discrete Problems,” J. Phys. Conf. Ser. 1260 (8), 082007:1–082007:8 (2019).CrossRef A. O. Zakharov and Yu. V. Kovalenko, “Structures of the Pareto Set and Their Reduction in Bicriteria Discrete Problems,” J. Phys. Conf. Ser. 1260 (8), 082007:1–082007:8 (2019).CrossRef
12.
go back to reference N. Christofides, Graph Theory: An Algorithmic Approach (Acad. Press, London, 1975).MATH N. Christofides, Graph Theory: An Algorithmic Approach (Acad. Press, London, 1975).MATH
13.
go back to reference A. V. Eremeev, L. A. Zaozerskaya, and A. A. Kolokolov, “A Set Covering Problem: Complexity, Algoritms, Experimental Research,” Diskret. Anal. Issled. Oper. Ser. 2, 7 (2), 22–46 (2000).MATH A. V. Eremeev, L. A. Zaozerskaya, and A. A. Kolokolov, “A Set Covering Problem: Complexity, Algoritms, Experimental Research,” Diskret. Anal. Issled. Oper. Ser. 2, 7 (2), 22–46 (2000).MATH
14.
go back to reference M. I. Nechepurenko, V. K. Popkov, S. M. Majnagashev, S. B. Kaul’, V. A. Proskuryakov, V. A. Kohov, and A. V. Gryzunov, Algorithms and Programs for Solving Problems on Graphs and Networks (Nauka, Novosibirsk, 1990) [in Russian].MATH M. I. Nechepurenko, V. K. Popkov, S. M. Majnagashev, S. B. Kaul’, V. A. Proskuryakov, V. A. Kohov, and A. V. Gryzunov, Algorithms and Programs for Solving Problems on Graphs and Networks (Nauka, Novosibirsk, 1990) [in Russian].MATH
15.
go back to reference A. A. Kolokolov and L. A. Zaozerskaya, “Solving a Bicriteria Problem of Optimal Service Centers Location,” J. Math. Model. Algorithms 12, 105–116 (2013).MathSciNetCrossRef A. A. Kolokolov and L. A. Zaozerskaya, “Solving a Bicriteria Problem of Optimal Service Centers Location,” J. Math. Model. Algorithms 12, 105–116 (2013).MathSciNetCrossRef
16.
go back to reference J. Saksena, “Mathematical Model for Scheduling Clients through Welfare Agencies,” J. Can. Oper. Res. Soc. 8, 185–200 (1970).MathSciNetMATH J. Saksena, “Mathematical Model for Scheduling Clients through Welfare Agencies,” J. Can. Oper. Res. Soc. 8, 185–200 (1970).MathSciNetMATH
17.
go back to reference A. Henry-Labordere, “The Record Balancing Problem: A Dynamic Programming Solution of a Generalized Traveling Salesman Problem,” Rev. Franç. Inform. Rech. Opér. 3 (B-2), 43–49 (1969).MATH A. Henry-Labordere, “The Record Balancing Problem: A Dynamic Programming Solution of a Generalized Traveling Salesman Problem,” Rev. Franç. Inform. Rech. Opér. 3 (B-2), 43–49 (1969).MATH
18.
go back to reference M. Yu. Khachai and E. D. Neznakhina, “Approximate Schemes for the Generalized Traveling Salesman Problem,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 22 (3), 283–292 (2016). M. Yu. Khachai and E. D. Neznakhina, “Approximate Schemes for the Generalized Traveling Salesman Problem,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 22 (3), 283–292 (2016).
19.
go back to reference A. G. Chentsov, M. Yu. Khachai, and D. M. Khachai, “An Exact Algorithm with Linear Complexity for a Problem of Visiting Megalopolises,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 21 (3), 309–317 (2015).MATH A. G. Chentsov, M. Yu. Khachai, and D. M. Khachai, “An Exact Algorithm with Linear Complexity for a Problem of Visiting Megalopolises,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 21 (3), 309–317 (2015).MATH
Metadata
Title
Reduction of the Pareto Set of a Special Structure in Bicriteria Discrete Problems
Authors
A. O. Zakharov
Yu. V. Kovalenko
Publication date
01-11-2021
Publisher
Pleiades Publishing
Published in
Journal of Applied and Industrial Mathematics / Issue 4/2021
Print ISSN: 1990-4789
Electronic ISSN: 1990-4797
DOI
https://doi.org/10.1134/S1990478921040153

Other articles of this Issue 4/2021

Journal of Applied and Industrial Mathematics 4/2021 Go to the issue

Premium Partners