A scatter search-based heuristic to locate capacitated transshipment points

Authors:
Burcu B. Keskin;Halit íster
Affiliations:
Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX 77843-3131, USA;Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX 77843-3131, USA
Venue:
Computers and Operations Research
Year:
2007

Citing 12
Cited 4

Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)

Discrete Applied Mathematics - Special volume: viewpoints on optimization
A branch-and-bound algorithm for the transportation problem with location of p transshipment points

Computers and Operations Research
A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution

Computers and Operations Research
Tabu Search

Tabu Search
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Heuristic concentration for the p-median: an example demonstrating how and why it works

Computers and Operations Research
Parallelization of the scatter search for the p-median problem

Parallel Computing - Special issue: Parallel computing in logistics
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
A column generation approach to capacitated p-median problems

Computers and Operations Research
Algorithms of Ant System and Simulated Annealing for the p-median Problem

Automation and Remote Control
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
A fixed-length subset genetic algorithm for the p-median problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

A steady-state genetic algorithm for multi-product supply chain network design

Computers and Industrial Engineering
Lower and upper bounds for a capacitated plant location problem with multicommodity flow

Computers and Operations Research
A simulation-optimization approach for integrated sourcing and inventory decisions

Computers and Operations Research
Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required ...