A tabu search procedure for multicommodity location/allocation with balancing requirements
From MaRDI portal
Publication:2367013
Cites work
- A branch-and-bound method for multicommodity location with balancing requirements
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A new heuristic method for the flow shop sequencing problem
- Algorithms for the maximum satisfiability problem
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Future paths for integer programming and links to artificial intelligence
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu search techniques. A tutorial and an application to neural networks
Cited in
(22)- Planning models for freight transportation
- Driving tabu search with case-based reasoning
- Some personal views on the current state and the future of locational analysis
- Kohonen maps for solving a class of location-allocation problems
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Tabu search for the multilevel generalized assignment problem
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Metaheuristics: A bibliography
- Parallel local search
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Multicommodity network flows: a survey. I: Applications and formulations
- Flexible job-shop scheduling with transportation resources
- Metaheuristics: A Canadian Perspective
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- Metaheuristics in combinatorial optimization
- Positioning empty containers among multiple ports with leasing and purchasing considerations
This page was built for publication: A tabu search procedure for multicommodity location/allocation with balancing requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367013)
