|
| Abbreviation | Description |
|
| FMILP | Fuzzy mixed-integer linear programming |
| NLP | Nonlinear programming |
| NILP | Noninteger linear programming |
| ILP | Integer linear programming |
| IP | Integer programming |
| MIP | Mixed-integer programming |
| MILP | Mixed-integer linear programming |
| MINLP | Mixed-integer nonlinear programming |
| B&B | Branch-and-bound algorithm |
| GH | Greedy heuristic |
| LRH | Lagrangian relaxation heuristic |
| ACO | Ant colony optimization |
| SA | Simulated annealing |
| TS | Tabu search |
| HS | Harmony search |
| ALNS | Adaptive large neighborhood search |
| AMP | Adaptive memory programming |
| AMABC | Adaptive memory artificial bee colony |
| PSO | Particle swarm optimization |
| GA | Genetic algorithm |
| NSGA-II | Nondominated sorting genetic algorithm |
| MOPSO | Multiobjective particle swarm optimization |
| ML | Machine learning |
| BP | Branch and price |
| LPBB | Linear programming-based branch and bound |
| BBO | Biogeography-based optimization |
| AMRTS | Adaptive multirestart tabu search |
| PH | Primal heuristics |
| CW | Clarke and Wright’s algorithm |
| CG | Column generation |
| EA | Evolutionary algorithm |
| FP | Fuzzy programming |
| SW | Sweep algorithm |
| ILS | Iterated local search |
| MSGA | Modified savings-based genetic algorithm |
| IS | Improved saving |
| ICW | Improved Clarke and Wright’s algorithm |
| ABC | Artificial bee colony |
| MVNS | Modified variable neighborhood search |
| SAICA | Self-adaptive imperialist competitive algorithm |
| CH | Constructive heuristic approach |
|
