Solving transportation problems with nonlinear side constraints with tabu search

Solving transportation problems with nonlinear side constraints with tabu search

0.00 Avg rating0 Votes
Article ID: iaor19951907
Country: United Kingdom
Volume: 22
Issue: 6
Start Page Number: 593
End Page Number: 603
Publication Date: Jul 1995
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

An algorithm based on tabu search ideas is developed to solve transportation problems with nonlinear side constraints. The authors show how to superimpose the tabu search (TS) framework conveniently on basis exchange (or ‘pivoting’) operations specialized to the transportation network context, and thereby to guide these operations to overcome the limitations of local optimality. Using an exact algorithm as a benchmark, the present computational study demonstrates the effectiveness of the procedure, and suggests the relevance of similar TS applications for solving other optimization problems that can be formulated as network problems with complicated nonlinear side constraints.

Reviews

Required fields are marked *. Your email address will not be published.