Solving transportation problems with nonlinear side constraints with tabu search

DOI10.1016/0305-0548(94)00055-DzbMath0827.90112OpenAlexW2069285427MaRDI QIDQ1892666

Buyang Cao, Götz Uebe

Publication date: 19 June 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00055-d

zbMATH Keywords

tabu searchtransportation problemsnonlinear side constraints

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

The transportation problem with conflicts ⋮ The Red-Blue transportation problem ⋮ Metaheuristics: A bibliography ⋮ Minimum cost flow problem with conflicts ⋮ Using penalty function and tabu search to solve cell formation problems with fixed cell cost. ⋮ Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables ⋮ A note on a dynamic space-allocation method for outbound containers. ⋮ The transportation problem with exclusionary side constraints ⋮ Pickup and delivery problem with incompatibility constraints ⋮ The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

Uses Software

• TABARIS
• Tabu search

Cites Work

• Unnamed Item
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
• Tabu search techniques. A tutorial and an application to neural networks
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Future paths for integer programming and links to artificial intelligence
• Large-scale controlled rounding using tabu search with strategic oscillation
• Transportation problem with nonlinear side constraints a branch and bound approach
• Tabu Search—Part I
• Solving Constrained Transportation Problems