A scatter search-based heuristic to locate capacitated transshipment points

Keskin, Burcu B.; íster, Halit

doi:10.1016/j.cor.2005.11.020

Cited by 39 publications

(20 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In a dynamic vehicle dispatching problem with pick-ups and deliveries, Gendreau et al (2006) proposed a tabu search with neighborhood search based on ejection chains to explore the proposed problem. A scatter search-based heuristic is designed to locate capacitated transshipment points (Keskin and Üster 2007). The other aspect is to employ the concept of a learning system used in learning automata and use reinforce-learning scheme (Bressloff 1995;Najim et al 1990) to apply adaptation in the evolution process.…”

Section: Meta-heuristic Algorithmsmentioning

confidence: 99%

Transshipment service through crossdocks with both soft and hard time windows

Miao

Yang

et al. 2010

Ann Oper Res

View full text Add to dashboard Cite

Recently, crossdocking techniques have been successfully applied in responsive supply chain management. However, most researches focused on physical layout of a crossdock, or scheduling operations within a crossdock. In this paper, we study a multi-crossdock transshipment service problem with both soft and hard time windows. The flows from suppliers to customers via the crossdocks are constrained by fixed transportation schedules. Cargos can be delayed and consolidated in crossdocks, and both suppliers and customers have specific hard time windows. In addition to hard time windows, customers also have less-restrictive time windows, called soft time windows. The problem to minimize the total cost of the multi-crossdock distribution network, including transportation cost, inventory handling cost and penalty cost, can be proved to be NP-hard in the strong sense and hence efficient heuristics are desired. We propose two types of meta-heuristic algorithms, called Adaptive Tabu Search and Adaptive Genetic Algorithm, respectively, to solve the problem efficiently. We conduct extensive experiments and the results show that both of them outperform CPLEX solver and provide fairly good solutions within realistic timescales. We also perform sensitivity analysis and obtain a number of managerial insights.

show abstract

Section: Meta-heuristic Algorithmsmentioning

confidence: 99%

Transshipment service through crossdocks with both soft and hard time windows

Miao

Yang

et al. 2010

Ann Oper Res

View full text Add to dashboard Cite

show abstract

“…Equations (6,8,10,11) and Equation (3.1) dual integer program of problem P1 with vectors linked with weak constraint Equation (9) (Big M constraint). In these the vectors linked with constraints 1, 2, 4 and 5 are neither strong nor weak but they are necessary binding constraints for the problem included in both weak and strong.…”

Section: Problem Dp1mentioning

confidence: 99%

“…Keskin & Uster [6] have attempted a SSCWLP (with capacity limit at the manufacturing plant, not on the warehouse). Our problem is one where the fixed capacity of facility to be located is to be handled, i.e.…”

mentioning

confidence: 99%

“…Capacitated plant location problem is also of interest to many researchers and many heuristic and exact approaches have been given for the same. Sharma & Agrawal [15] used vertical decomposition to solve the two staged capacitated warehouse location problem (TSCWLP) which was attempted by Keskin and Uster [6] using heuristic based scatter search algorithm. Some new strong formulations of the two staged location problem were shown by Sharma & Namdeo [16].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Application of Modified Benders Decomposition to Single-Stage Multi-Commodity Multi-Period Warehouse Location Problem: An Empirical Investigation

Sharma¹,

Malviya²,

Kumar³

et al. 2016

AJOR

View full text Add to dashboard Cite

In the past, researchers have applied Bender's decomposition to distribution problem and used feasibility constraint to speed up the performance of Bender's decomposition. Further, the application of Branch and Bound to single-stage multi-commodity single-period warehouse location problem (SSMCSPWLP) with strong constraints has shown that they are more effective. It was also shown in the previous research (in the context of Branch and Bound Methodology) that hybrid formulation for the single-stage single-period multi-commodity warehouse location problem yielded superior results. In this paper we apply Benders' decomposition to strong and weak formulations of single-stage multi-commodity multi-period warehouse location problem (SSMCMPWLP). As suggested in the previous literature we put feasibility constraints in the pure integer subproblem to speed up the performance of Benders' decomposition. We also develop an additional cut (constraint that is again added to pure integer sub-problem) and show that it further speeded up Benders' Decomposition. This research led to the possibility of applying Benders' Decomposition to the hybrid formulation of SSMCMPWLP in future.

show abstract

“…They validate the model by applying it to a real-world problem and by its sensitivity analyses. Keskin and Üster [15] attempted for SSCWLP and gave a scatter search-based heuristic approach for the problem.…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

Vertical Decomposition Approach to Solve Single Stage Capacitated Warehouse Location Problem (SSCWLP)

Verma¹,

Sharma²

2011

AJOR

View full text Add to dashboard Cite

Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we give a "vertical decomposition" approach to solve SSCWLP that uses Lagrangian relaxation. This way SSCWLP is broken into two versions of capacitated plant location problem (the CPLP_L and CPLP_R) by relaxing the flow balance constraints. For CPLP_R, we use well known Lagrangian relaxations given in literature (Christofides and Beasley [5] and Nauss [6]); and adopt them suitably for solving CPLP_L. We show theoretically in this paper that SSCWLP can be more efficiently solved by techniques of vertical decomposition developed in this paper than the method available in literature (Sharma and Berry [4]). Encouraging computational study is reported in this paper.

show abstract

A scatter search-based heuristic to locate capacitated transshipment points

Cited by 39 publications

References 29 publications

Transshipment service through crossdocks with both soft and hard time windows

Transshipment service through crossdocks with both soft and hard time windows

Application of Modified Benders Decomposition to Single-Stage Multi-Commodity Multi-Period Warehouse Location Problem: An Empirical Investigation

Vertical Decomposition Approach to Solve Single Stage Capacitated Warehouse Location Problem (SSCWLP)

Contact Info

Product

Resources

About