Probabilistic local search algorithms for concave cost transportation network problems
type: Item
instance of: scholarly article
title: Probabilistic local search algorithms for concave cost transportation network problems
zbMATH Open document ID: 0937.90068
DOI: 10.1016/S0377-2217(98)00270-7
author: Shangyao Yan
author: So-Chang Luo
published in: European Journal of Operational Research
publication date: 2000-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1358490
zbMATH Keywords: concave cost
zbMATH Keywords: transportation problem
zbMATH Keywords: simulated annealing
zbMATH Keywords: threshold accepting
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Q3056948
cites work: A Random Activity Network Generator
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: An algorithm for the min concave cost flow problem
cites work: Adjacent extreme flows and application to min concave cost flow problems
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4692508
cites work: Using simulated annealing to solve routing and location problems
cites work: A polynomial time solvable concave network flow problem
cites work: Experimental analysis of simulated annealing based algorithms for the layout problem
cites work: Optimization by Simulated Annealing
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: An approximative algorithm for the fixed-charges transportation problem
cites work: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
cites work: Global Solutions for a Nonconvex Nonconcave Rail Network Model
cites work: A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
cites work: Minimum Concave Cost Flows in Certain Networks
full work available at URL: s0377-2217(98)00270-7
OpenAlex ID: W2047121773
Recommended article: Global and local search algorithms for concave cost transshipment problems
Recommended article: A globally convergent algorithm for transportation continuous network design problem
Recommended article: Probabilistic diversification and intensification in local search for vehicle routing
Recommended article: Q5488955
Recommended article: An efficient implementation of local search algorithms for constrained routing problems
Recommended article: Local search heuristics for the probabilistic dial-a-ride problem
Recommended article: An algorithm for solving the transport problem on network with concave cost functions of flow on edges
Recommended article: Q3839026
description: scientific article; zbMATH DE number 1358490