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-4zbMATH Open1360.90037OpenAlexW2385452324MaRDI QIDQ522430FDOQ522430

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

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

Recommendations

• On computing Pareto optimal paths in weighted time-dependent networks
• Pareto optimal solutions of a cost-time trade-off bulk transportation problem
• Routing with nonlinear multiattribute cost functions
• Time dependency in multiple objective dynamic programming
• scientific article; zbMATH DE number 4079184

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)

Cites Work

• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimizing dead mileage in urban bus routes through a nondominated solution approach
• 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
• Title not available (Why is that?)
• A bicriterion call center problem through an evolved branch and bound algorithm
• Nondominated solutions of a site selection problem with two objectives without assignment of priorities to them
• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
• Efficient solutions for a bicriterion problem selecting sites for polling stations and assigning voter-areas to them through Hungarian method incorporating concept of lexicographic minimization of ordered pairs
• Title not available (Why is that?)

Cited In (4)

• Routing with nonlinear multiattribute cost functions
• On computing Pareto optimal paths in weighted time-dependent networks
• Title not available (Why is that?)
• Computing Pareto-optimal transit routes through mathematical algorithms

Uses Software

• Algorithm 97

This page was built for publication: Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522430)