Global and local search algorithms for concave cost transshipment problems

DOI10.1007/s10898-004-3133-5zbMath1080.90088OpenAlexW2028016928MaRDI QIDQ811873

Shangyao Yan, Wei-shen Lai, Chien-rong Chen, Der-Shin Juang

Publication date: 23 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-3133-5

zbMATH Keywords

Genetic algorithmLocal searchConcave costGlobal searchTransshipment problems

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope

Cites Work

• 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
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• The noising method: A new method for combinatorial optimization
• A restricted-entry method for a transportation problem with piecewise- linear concave costs
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Probabilistic local search algorithms for concave cost transportation network problems
• Using simulated annealing to solve routing and location problems
• A composite algorithm for a concave-cost network flow problem
• An approximative algorithm for the fixed-charges transportation problem
• Adjacent extreme flows and application to min concave cost flow problems
• Feature Article—Genetic Algorithms for the Operations Researcher
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
• An approach to a problem in network design using genetic algorithms
• A polynomial time solvable concave network flow problem
• Minimum Concave Cost Flows in Certain Networks
• Minimum cost routing for static network models
• Approximating reduced costs under degeneracy in a network flow problem with side constraints