Probabilistic local search algorithms for concave cost transportation network problems

DOI10.1016/S0377-2217(98)00270-7zbMath0937.90068OpenAlexW2047121773MaRDI QIDQ1806939

Shangyao Yan, So-Chang Luo

Publication date: 15 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00270-7

zbMATH Keywords

simulated annealingthreshold acceptingtransportation problemconcave cost

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (6)

Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ Unnamed Item ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ A continuous approach for the concave cost supply problem via DC programming and DCA ⋮ The concave cost supply problem. ⋮ Global and local search algorithms for concave cost transshipment problems

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• An algorithm for the min concave cost flow problem
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
• Experimental analysis of simulated annealing based algorithms for the layout problem
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Using simulated annealing to solve routing and location problems
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• An approximative algorithm for the fixed-charges transportation problem
• Adjacent extreme flows and application to min concave cost flow problems
• Tabu Search—Part I
• Tabu Search—Part II
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Global Solutions for a Nonconvex Nonconcave Rail Network Model
• A Random Activity Network Generator
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• A polynomial time solvable concave network flow problem
• Minimum Concave Cost Flows in Certain Networks

This page was built for publication: Probabilistic local search algorithms for concave cost transportation network problems