Bicriteria Transportation Problem

DOI10.1287/MNSC.25.1.73zbMath0442.90056OpenAlexW1978090048MaRDI QIDQ3885513

K. P. K. Nair, Yash P. Aneja

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.1.73

zbMATH Keywords

solution spaceparametric searchbottleneck criterioncriteria spacebicriteria transportation problemconsumption of certain scarce resourcesminimizations of total costmultiobjective linear programming techniquetime bound transportation schedulestotal deterioration of goodstwo or more objectives

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (only showing first 100 items - show all)

Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ Constructing the set of efficient objective values in linear multiple objective transportation problems ⋮ On a class of quadratic programs ⋮ An algorithm for the committee construction problem ⋮ Tangency portfolios in the LP solvable portfolio selection models ⋮ A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem ⋮ Time variant multi-objective linear fractional interval-valued transportation problem ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ Distributed localized bi-objective search ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Interactive solutions for the linear multiobjective transportation problem ⋮ Multiobjective traveling salesperson problem on Halin graphs ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ Multiple objective minimum cost flow problems: a review ⋮ On bicriterion minimal spanning trees: An approximation ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ An exact algorithm for the bi-objective timing problem ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ An interactive approach for bi-attribute multi-item auctions ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Multi-objective two-stage grey transportation problem using utility function with goals ⋮ \(\varepsilon\)-approximation minimization of convex functions in fixed dimension ⋮ Pyramidal tours and multiple objectives ⋮ Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization ⋮ Minmax combinatorial optimization ⋮ Computing representations using hypervolume scalarizations ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Efficient and sparse neural networks by pruning weights in a multiobjective learning approach ⋮ Mehar's method to find exact fuzzy optimal solution of unbalanced fully fuzzy multi-objective transportation problems ⋮ Branch and cut method for solving integer indefinite quadratic bilevel programs ⋮ Improving the anytime behavior of two-phase local search ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ Bicriteria linear fractional programming ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Lower bound sets for biobjective shortest path problems ⋮ A new method for solving linear multi-objective transportation problems with fuzzy parameters ⋮ An interactive algorithm for multi-objective route planning ⋮ An algorithm for bicriterion linear programming ⋮ The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives ⋮ Efficiency and time-cost-tradeoffs in transportation problems ⋮ Bicriteria network flow problems: Continuous case ⋮ Bi-criteria transportation problem with multiple parameters ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ A note on solving bicriteria linear programming problems using single criteria software ⋮ A novel approach for solving rough multi-objective transportation problem: development and prospects ⋮ The convergence rate of the sandwich algorithm for approximating convex functions ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ A bicriterion framework for operations assignment and routing flexibility analysis in cellular manufacturing systems ⋮ Efficient computation of the search region in multi-objective optimization ⋮ Multi-objective branch and bound ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Efficient solutions for the bicriteria network flow problem ⋮ Bicriteria network flow problems: Integer case ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Fuzzy efficient interactive goal programming approach for multi-objective transportation problems ⋮ Solving fixed charge transportation problem with interval parameters ⋮ Using genetic algorithm and TOPSIS technique for multiobjective transportation problem: a hybrid approach ⋮ A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Three algorithms for bicriteria integer linear programs ⋮ A transportation model with multiple criteria and multiple constraint levels ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ How Good is the Chord Algorithm? ⋮ Parametric min-cuts analysis in a network. ⋮ Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower ⋮ A method for convex curve approximation ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria ⋮ Approximation of convex curves with application to the bicriterial minimum cost flow problem ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ A fixed charge transportation problem with damageable items under uncertain environment ⋮ The biobjective minimum cost flow problem ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem ⋮ On trade-off solution pairs in a special type of transportation problem ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ A variation of the assignment problem ⋮ The maximum covering/shortest path problem: A multiobjective network design and routing formulation ⋮ Fuzzy programming approach to multicriteria decision making transportation problem ⋮ Fuzzy programming approach to multiobjective solid transportation problem ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ Optimization over the efficient set: Four special cases ⋮ The multiple objective time transportation problem with additional restrictions

This page was built for publication: Bicriteria Transportation Problem