Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture

Anokić, Ana; Stanimirović, Zorica; Davidović, Tatjana; Stakić, Đorđe

doi:10.1111/itor.12480

Cited by 11 publications

(6 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Variable neighborhood search that is proposed by Mladenović and Hansen [38] does not involve parameters and can find optimal solution of the problem. Variable neighborhood search is applied to solve various combinatorial optimization problem [39][40][41][42]. In current, it is seldom found that variable neighborhood search is used to solve the automatic production system scheduling problem under just-in-time environment.…”

Section: Literature Reviewmentioning

confidence: 99%

INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment

Qingxiang,

Xiaofei,

Yude

et al. 2023

Journal of Applied Mathematics

View full text Add to dashboard Cite

Automatic production system scheduling problem under a just-in-time environment is researched in this paper. The automatic production system is composed of many tanks and one robotic, the tank of the researched problem is responsible for processing the job, and the robotic moves the job from one tank to the other tank. The difference between the researched problem and the classic shop scheduling problem is that the former must consider job scheduling and the robotic move sequence, but the latter considers only job scheduling. For optimizing simultaneously job scheduling and robotic move sequence in the proposed problem and minimizing total earliness/tardiness, an improved NEH (Nawaz-Enscore-Ham) and variable search (INEH-VNS) algorithm are developed. In the proposed method, firstly, to obtain initial solution, an improved NEH is shown. Secondly, for computing value of the objective function, the double procedure method is constructed. Thirdly, according to the properties of the proposed problem, three neighborhood structures, adjacent exchange, random insertion, and job exchange, are investigated. To test the performance of the INEH-VNS, 100 instances are randomly generated. When the run time is the same, compared with CPLEX 12.5, the INEH-VNS algorithm can find high-quality approximate optimal solution, a special big scale. Compared with the G-VNS algorithm, the average improvement rate of the approximate optimal solution is 45.9%, and the average stability rate of the INEH-VNS algorithm enhances 75.04%. That is to say, the INEH-VNS algorithm is outstanding and more effective.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment

Qingxiang,

Xiaofei,

Yude

et al. 2023

Journal of Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…According to the iterative process and particle flight situations, adaptive inertia weight is employed to dynamically adjusting the inertia weight (Zhan et al., 2009; Nickabadi et al., 2011), thereby balancing the global search and convergence speed. The ND algorithm combines deep search and neighborhood structure strategy and achieves alternative search by using neighborhood structure formed (Hansen et al., 2001; Gao et al., 2008; Kammoun et al., 2017; Anokic et al., 2020).…”

Section: Nd‐pso Algorithmmentioning

confidence: 99%

A decision method on yard cranes transformation and deployment in green ports

Tan

Zhang

Yuan

et al. 2021

Int Trans Operational Res

View full text Add to dashboard Cite

This study proposes a strategic level decision method for yard cranes (YCs) transformation and deployment for the purpose of building efficient and energy‐saving green ports with low carbon emission. An integer programming model is embedded in the method for the above decision considering some green technology for YC transformation. The aim of the model is to minimize the investment cost for purchasing and transforming YCs as well as the operation costs during the planning horizon. A neighborhood descent particle swarm optimization algorithm is developed for solving the proposed model. Real data based on numerical experiments are conducted to verify the effectiveness of the proposed decision method. Take the case of Shanghai Yangshan Deep Water Port, the carbon emission is reduced by 415,756.8 kg and the energy consumption costs are saved 1,226,016 RMB. The above method may be potentially useful for the practitioners on the strategic level decisions of YCs transformation and deployment.

show abstract

“…Likewise, Plessen (2019b) optimized the transport resources in agriculture, seeking to develop models that were thought primarily for spraying and fertilizing applications in the fields through a fleet of vehicles. Recently, Anokić et al (2020) developed a transportation planning problem from the sugar beet industry in Serbia.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, Anokić et al. (2020) developed a transportation planning problem from the sugar beet industry in Serbia.…”

Section: Introductionmentioning

confidence: 99%

Linear programming based decision support system for grapes transport planning in CAPEL

Monardes-Concha

Serrano‐Julio

Hoffmann³

2020

Int Trans Operational Res

View full text Add to dashboard Cite

This research is about developing a decision support system (DSS) for the distribution of grapes and grape must in a Chilean cooperative, Cooperativa Agrícola Pisquera Elqui Limitada (CAPEL). CAPEL is dedicated to producing and distributing several beverages such as sparkling wines, beers, energy drinks, rum, and pisco. This work aims to support the grinding‐related transport stage through a linear programming based DSS, in order to find the optimal use of the transport demand in a network based on source and destination plants during the harvest season. To achieve this aim, an operational research (OR) model that feeds the DSS is developed, whose objective function seeks to minimize the total transport cost. The decision variables define the grape cargo to be transported from a source plant to a destination plant. The OR model uses constraints such as transportation demand, grinding capacity, maximum storage, and available grape in plants. The model succeeded in reducing the total transport costs by 14% for the 2017 season of the pisco‐making process, meaning approximately savings of 59 million Chilean pesos.

show abstract

Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture

Cited by 11 publications

References 45 publications

INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment

INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment

A decision method on yard cranes transformation and deployment in green ports

Linear programming based decision support system for grapes transport planning in CAPEL

Contact Info

Product

Resources

About