Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized
Year of publication: |
Oct-Dec 2016
|
---|---|
Authors: | Prakash, Satya ; Gupta, Anuj ; Garg, Richa ; Tanwar, Bhuvnesh ; Kaushik, Deepika ; Aggarwal, Sourabh |
Published in: |
Opsearch : journal of the Operational Research Society of India. - New Delhi : Springer India, ISSN 0030-3887, ZDB-ID 417088-X. - Vol. 53.2016, 4, p. 778-807
|
Subject: | Optimization | Multiobjective programming | Bicriterion | Pareto optimal solution | Floyd's algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Pareto-Optimum | Pareto efficiency | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Algorithmus | Algorithm | Wohlfahrtsökonomik | Welfare economics |
-
A linearization to the multi-objective linear plus linear fractional program
Borza, Mojtaba, (2023)
-
Nguyen, Hoa T. M., (2021)
-
On the effects of combining objectives in multi-objective optimization
Dempe, Stephan, (2015)
- More ...
-
Pareto optimal solutions of a cost-time trade-off bulk transportation problem
Prakash, Satya, (2008)
-
Pareto optimal solutions of a cost–time trade-off bulk transportation problem
Prakash, Satya, (2008)
-
A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
Prakash, Satya, (2014)
- More ...