Tabu search and adaptive memory programming—advances, applications and challenges
F Glover - Interfaces in computer science and operations …, 1997 - Springer
ABSTRACT College of Business, CB 419 University of Colorado Boulder, CO 80309 email:
Fred. Glover@ colorado. edu Tabu search (TS) has provided advances for solving difficult …
Fred. Glover@ colorado. edu Tabu search (TS) has provided advances for solving difficult …
A review of transport market modeling using game-theoretic principles
Transport markets involve interactions between multiple groups of decision-makers, hence
they are good candidates to be analyzed through the prism of game theory. The many …
they are good candidates to be analyzed through the prism of game theory. The many …
[图书][B] Tabu search
Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …
world, classical methods often encounter great difficulty. Vitally important applications in …
MIPLIB 2010: Mixed integer programming library version 5
T Koch, T Achterberg, E Andersen, O Bastert… - Mathematical …, 2011 - Springer
This paper reports on the fifth version of the Mixed Integer Programming Library. The miplib
2010 is the first miplib release that has been assembled by a large group from academia …
2010 is the first miplib release that has been assembled by a large group from academia …
Metaheuristics in combinatorial optimization
M Gendreau, JY Potvin - Annals of Operations Research, 2005 - Springer
The emergence of metaheuristics for solving difficult combinatorial optimization problems is
one of the most notable achievements of the last two decades in operations research. This …
one of the most notable achievements of the last two decades in operations research. This …
Solving non-linear fixed-charge transportation problems using nature inspired non-linear particle swarm optimization algorithm
D Rani - Applied Soft Computing, 2023 - Elsevier
The main objective of this study is to formulate and solve the model of non-linear fixed-
charge transportation problem (NFCTP), which is one of the NP-hard problems. This type of …
charge transportation problem (NFCTP), which is one of the NP-hard problems. This type of …
New approaches in metaheuristics to solve the fixed charge transportation problem in a fuzzy environment
S Sadeghi-Moghaddam, M Hajiaghaei-Keshteli… - Neural computing and …, 2019 - Springer
Fixed charge transportation problem (FCTP) is a primary and important problem which
attracts researchers in the last decade. Recently, solution approaches typically …
attracts researchers in the last decade. Recently, solution approaches typically …
Solving the uncapacitated facility location problem using tabu search
M Sun - Computers & Operations Research, 2006 - Elsevier
A tabu search heuristic procedure is developed to solve the uncapacitated facility location
problem. Tabu search is used to guide the solution process when evolving from one solution …
problem. Tabu search is used to guide the solution process when evolving from one solution …
Fuzzy fixed charge solid transportation problem and algorithm
L Yang, L Liu - Applied soft computing, 2007 - Elsevier
This paper mainly investigates the fixed charge solid transportation problem under fuzzy
environment, in which the direct costs, the fixed charges, the supplies, the demands and the …
environment, in which the direct costs, the fixed charges, the supplies, the demands and the …
A simple heuristic for solving small fixed-charge transportation problems
V Adlakha, K Kowalski - Omega, 2003 - Elsevier
The fixed-charge transportation problem (FCTP) is an extension of the classical
transportation problem in which a fixed cost is incurred, independent of the amount …
transportation problem in which a fixed cost is incurred, independent of the amount …