A scatter search-based heuristic to locate capacitated transshipment points
From MaRDI portal
Publication:878590
DOI10.1016/j.cor.2005.11.020zbMath1185.90134OpenAlexW2082270393MaRDI QIDQ878590
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.020
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (15)
A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ Solving the robust two-stage capacitated facility location problem with uncertain transportation costs ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm ⋮ Cooperative co‐evolutionary scatter search for satellite module layout design ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments ⋮ A simulation-optimization approach for integrated sourcing and inventory decisions ⋮ Lower and upper bounds for a two-stage capacitated facility location problem with handling costs ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow ⋮ Facility location and supply chain management. A review ⋮ Transshipment service through crossdocks with both soft and hard time windows ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A genetic algorithm for solving a capacitated \(p\)-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- A dynamic programming heuristic for the \(P\)-median problem
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- An efficient genetic algorithm for the \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- An exact method for the two-echelon, single-source, capacitated facility location problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- A hybrid heuristic for the \(p\)-median problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Principles of scatter search
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- An LP-based heuristic for two-stage capacitated facility location problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- Multicommodity Distribution System Design by Benders Decomposition
- Experimental evaluation of heuristic optimization algorithms: A tutorial
- Planning and coordination of production and distribution facilities for multiple commodities
This page was built for publication: A scatter search-based heuristic to locate capacitated transshipment points
