Modeling rolling batch planning as vehicle routing problem with time windows

Xiong, Chen; Wan, Weishui; Xu, Xinhe

doi:10.1016/s0305-0548(98)00018-5

Cited by 44 publications

(24 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These production instances consist of different numbers of slabs of 64, 128, 183, 228, and 300, respectively. In addition, three different methods, including D-HOA, GA/k-opt [5], and manual scheduling method, are used to solve the above scheduling problems for comparison. GA/k-opt is an excellent algorithm that is better than insertion heuristic [16] and manual scheduling method in solving the hot rolling batch scheduling problem.…”

Section: Experimental Results and Analysismentioning

confidence: 99%

“…To obtain good results, choosing suitable parameters is important. The parameters of GA/k-opt are set the same as those in paper [5], and based on many experiments, the parameters of D-HOA are set as follows:…”

Section: Experimental Results and Analysismentioning

confidence: 99%

“…They proposed a heuristic method based on tabu search and a new idea called "cannibalization" to obtain good approximate solutions. Chen et al [5] suggested a vehicle routing problem with time windows (VRPTW) model to describe the rolling batch planning problem, in which the position limitation of slabs was quantified as the time constraints. They compared three algorithms and pointed out that the genetic algorithm was prior to the other two methods.…”

Section: Introductionmentioning

confidence: 99%

“…They introduced a decomposing procedure and designed a decomposition-coordination ant colony system to solve the transformed model. Some of the models mentioned above are single objective ones [2][3][4][5][6]10]. While in practice, there are multiple objectives, which are even contradictory, need to be balanced.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem

Jia

Zhu

Yang

et al. 2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

In this paper, the hot rolling batch scheduling problem is formulated as a multi-objective vehicle routing problem with double time windows model, in which the first time window deals with the surface grade constraint and the second one is for the linkage modes. In view of the complexity of the proposed model and the priority of considered objectives in practical production, a decomposition-based hierarchical optimization algorithm is proposed to solve the model. Firstly, the model is decomposed into two sub-problems: vehicle routing problem with time windows (VRPTW) and single vehicle routing problem with time windows (SVRPTW). Secondly, MACS-VRPTW is used to optimize the VRPTW sub-problem, in which the first objective is prior to the second one. Then, dynamic programming and genetic algorithm are used to optimize the SVRPTW sub-problem so as to reach a higher hot charge temperature. Experimental results based on the practical production instances have indicated that the proposed model and algorithm are effective and efficient.

show abstract

Section: Experimental Results and Analysismentioning

confidence: 99%

Section: Experimental Results and Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem

Jia

Zhu

Yang

et al. 2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…At present, there are mainly three types of routing algorithms: heuristics (Tijms, 1994;Christofides, 1985;Viswanathan and Mathur, 1997;Chao, 2002), mathematical programming (Popken, 1994;Wendy et al, 1999), and genetic algorithms (Gabbert et al, 1991;Chen and Gen, 1996;Chen et al, 1998). Ma and Davidrajuh (2005) propose genetic algorithms for routing, for ease of implementation.…”

Section: The Tactical Modulementioning

confidence: 99%

Structures for Stepwise Development of Adaptive Supply Chains

Davidrajuh¹

2006

Journal of Internet Commerce

View full text Add to dashboard Cite

ABSTRACT. Falling margins, globalization, and accelerating innova-tion cycles are forcing businesses to switch from traditional (linear and sequential) supply chains to adaptive supply chains that possess the flexibility needed to respond to changing market condition. Developing an adaptive supply chain is no easy task as it is large and complex. In this paper, first, a literature study is given on structures for developing adaptive supply chains; the purpose of this study is to identify the commonly used structures for design and development of some modern supply chain solutions. Second, a new iterative approach to developing an adaptive distribution supply chain is presented.

show abstract