A Metaheuristic Algorithm to Transporter Scheduling for Assembly Blocks in a Shipyard considering Precedence and Cooperating Constraints

Tao, Ningrong; Jiang, Zuhua; Liu, Jianfeng; Xia, Beixin; Li, Baihe

doi:10.1155/2019/2615154

Cited by 8 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To validate the implementation of TS and CS methods, the results were compared with the authors' works [32,39]. The adjustment of the TS and CS parameters improved convergence and achieved better results compared with the GAMS algorithm.…”

Section: Discussionmentioning

confidence: 99%

“…The experimental results showed that the ant colony optimization algorithm is capable of finding high-quality solutions. Furthermore, Tao et al [32] proposed a metaheuristic based on the hybrid topological graph, genetic algorithm, and TS to minimize travel and waiting times. The algorithm considers time windows, load capacity, and the origin of tasks.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The main challenge of these metaheuristics is to solve large combinatorial optimization problems in an adequate time period. Different authors have used metaheuristic algorithms to solve VRP: local search [24], simulated annealing [25], greedy randomized adaptive search procedure (GRASP) [26], swarm intelligence [27], tabu search (TS) [28,29], genetic algorithms [30], colony optimization [31], reactive search [32], and maximum coverage [33].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

et al. 2021

View full text Add to dashboard Cite

The research evaluates the vehicular routing problem for distributing refrigerated products. The mathematical model corresponds to the vehicle routing problem with hard time windows and a stochastic service time (VRPTW-ST) model applied in Santiago de Chile. For model optimization, we used tabu search, chaotic search and general algebraic modeling. The model’s objective function is to minimize the total distance traveled and the number of vehicles using stochastic waiting restrictions at the customers’ facilities. The experiments were implemented in ten scenarios by modifying the number of customers. Experiments were established with several customers that can be solved using the general algebraic modeling technique in order to validate the tabu search and the chaotic search methods. The study considered two algorithms modified with Monte Carlo (tabu search and chaotic search). Additionally, two modified algorithms, TSv2 and CSv2, were proposed to reduce execution time. These algorithms were modified by delaying the Monte Carlo procedure until the first set of sub-optimal routes were found. The results validate the metaheuristic chaotic search to solve the VRPTW-ST. The chaotic search method obtained a superior performance than the tabu search method when solving a real problem in a large city. Finally, the experiments demonstrated a direct relationship between the percentage of customers with stochastic waiting time and the model resolution time.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Ship segment stacking is different from the production scheduling problem of general products which has the characteristics of complex structure, small production batch, large volume and weight, and inconvenient to transport frequently. Therefore, there are strict spatiotemporal constraints in the production process, which means that it not only needs to satisfy the order in time but also the constraints on space resources [3,4] . Shipbuilding belongs to the One-of-a-Kind Production (OKP) mode, which is also a typical Make-to-Order production mode [5] .…”

Section: Introductionmentioning

confidence: 99%

Modern Logistics Technology Based Ship Segment Outfitting Scheme

Qie,

Miao,

Huang

et al. 2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Shipbuilding occupies an important position in national defense and economy, which belongs to a typical large-scale complex production. In the modern shipbuilding mode, the segment outfitting process is the bottleneck of the whole shipbuilding. The outfitting cycle is long, and there are many resource constraints in the process. At present, China’s shipbuilding enterprises adopt the method of storage-yard based segment outfitting, which is relatively extensive in management and low in efficiency. This article points out that storage-yard based segment outfitting depends on complex dynamic scheduling, involving complex theoretical planning problems such as three-dimensional spatiotemporal coordination and flatbed transporter scheduling. Inspired by the segment outfitting line proposed in Germany and the modern logistics technology, the station design of the segment outfitting line was determined, and the centralized distribution with the intelligent logistics mode of outfitting parts is analyzed. The material and personnel coordination framework of the segment outfitting line is established. In the end, an assembly line based collaborative scheme of ship segment outfitting is proposed, with the characteristics of plan oriented, comprehensive perception, and dynamic synergistic.

show abstract

“…Tao et al 11 consider an optimization transporter scheduling problem for assembly blocks; a metaheuristic algorithm is proposed based on the hybrid topological graph and genetic algorithm and tabu search. The experimental results show the efficiency and effectiveness of the proposed algorithm.…”

mentioning

confidence: 99%

Research on block storage yard scheduling according to grid method

Zhou

Wang

Liu

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

In order to solve the problems of low utilization of the shipyard unreasonable placed of the blocks and unbalanced use of flat transporters, grid search algorithm for block storage yard scheduling is proposed. Firstly, the information of block storage yard and each block are described by the method of bitmap; secondly, the blocks access sequence, stacking principles of the blocks, and the principles of flat transporters are developed based on heuristic rules and shape differences of the blocks; finally, the grid search algorithm is proposed for the scheduling of shipyard's plan. It has been demonstrated in some shipyard; the results show that the utilization rate of the yard space and the efficiency of block storage yard scheduling have been improved greatly, and the situation of manpower and material resources waste have been decreased fully.

show abstract

A Metaheuristic Algorithm to Transporter Scheduling for Assembly Blocks in a Shipyard considering Precedence and Cooperating Constraints

Cited by 8 publications

References 24 publications

Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

Modern Logistics Technology Based Ship Segment Outfitting Scheme

Research on block storage yard scheduling according to grid method

Contact Info

Product

Resources

About