Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized

DOI10.1007/s12597-016-0259-4zbMath1360.90037OpenAlexW2385452324MaRDI QIDQ522430

Deepika Kaushik, Bhuvnesh Tanwar, Richa Garg, Sourabh Aggarwal, Satya Prakash, Anuj Gupta

Publication date: 28 April 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-016-0259-4

zbMATH Keywords

optimizationmultiobjective programmingPareto optimal solutionbicriterionFloyd's algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)

Uses Software

• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• A bicriterion call center problem through an evolved branch and bound algorithm
• Optimizing dead mileage in urban bus routes through a nondominated solution approach
• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
• Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search
• Pareto optimal solutions of a cost-time trade-off bulk transportation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item