Processing, Please wait...

  • Publisher Home
  • Home
  • ๐Ÿ”™ Back
  • ๐Ÿ“š Journals
    • โš™๏ธ IJIEC - Industrial Engineering Computations
    • ๐ŸŒ IJDNS - Data and Network Science
    • ๐Ÿงช CCL - Current Chemistry Letters
    • ๐Ÿ’น AC - Accounting
    • ๐ŸŽฏ DSL - Decision Science Letters
    • ๐Ÿš› USCM - Uncertain Supply Chain Management
    • ๐Ÿ—๏ธ JPM - Journal of Project Management
    • ๐Ÿฅ HE - Healthcare Engineering
    • ๐Ÿ“ˆ SCI - Scientometrica
    • ๐Ÿ”ฉ ESM - Engineering Solid Mechanics
    • ๐ŸŒฟ JFS - Journal of Future Sustainability
    • ๐Ÿ’ผ MSL - Management Science Letters
  • ๐Ÿ“ Submit Article
  • ๐Ÿ“Š Statistics
  • ๐Ÿ“‹ About
    • ๐Ÿ“„ About Us
    • ๐Ÿ“ฐ Blog
    • ๐Ÿ“ข News
    • ๐Ÿ“ง Contact
  • ๐Ÿ“บ Tutorial
  • Search:
  • Advanced Search

Growing Science » Tags cloud » Variable neighborhood search

โญ Highly Cited Articles

  • Jaya Algorithm
  • Rao Algorithm
  • TLBO Algorithm
  • ChatGPT and Blended Learning

Journals

  • IJIEC (840)
  • IJDS (1032)
  • DSL (759)
  • ESM (434)
  • CCL (563)
  • JPM (350)
  • AC (572)
  • JFS (106)
  • MSL (2658)
  • USCM (1104)
  • HE (56)
  • SCI (53)

๐Ÿ”‘ Keywords

Jordan(175)
Supply chain management(172)
Vietnam(154)
Customer satisfaction(124)
Performance(117)
Supply chain(115)
Artificial intelligence(108)
Service quality(101)
Competitive advantage(100)
SMEs(95)
Tehran Stock Exchange(94)
Sustainability(94)
optimization(88)
Financial performance(86)
TOPSIS(85)
Trust(85)
Organizational performance(81)
Job satisfaction(81)
Genetic Algorithm(81)
Social media(80)


» Show all keywords

โœ๏ธ Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(70)
Mohammad Reza Iravani(65)
Endri Endri(45)
Hotlan Siagian(43)
Muhammad Alshurideh(42)
Dmaithan Almajali(39)
Jumadil Saputra(37)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Sautma Ronni Basana(33)
Barween Al Kurdi(32)
Basrowi Basrowi(31)
Mohammad Khodaei Valahzaghard(30)
Haitham M. Alzoubi(30)
Ni Nyoman Kerti Yasa(30)
Hassan Ghodrati(30)
Shankar Chakraborty(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Mahmoud Allahham(28)


» Show all authors

๐ŸŒ Countries

1. Algeria (52)
2. Angola (2)
3. Argentina (22)
4. Armenia (2)
5. Australia (52)
6. Austria (2)
7. Bahrain (26)
8. Bangladesh (58)
9. Belarus (4)
10. Belgium (3)
11. Benin (2)
12. Benin Republic (1)
13. Bhutan (1)
14. Bosnia and Herzegovina (1)
15. Botswana (9)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
Sort articles by: ๐Ÿ“– Volume | ๐Ÿ“… Date | โญ Most Rates | ๐Ÿ‘๏ธ Most Views | ๐Ÿš€ Rising Stars | ๐Ÿ”— Citations (Scopus) | ๐Ÿ”ฅ Hot Papers
1.

A genetic algorithm-based approach for solving the production scheduling problem in unrelated parallel machines Pages 1835-1850 PDF Download PDF

Authors: Yung-Chia Chang, Kuei-Hu Chang, Te-Chi Kong, Austin Lu

doi 10.5267/j.ijiec.2026.6.010

๐Ÿ”‘ Keywords: Machine eligibility restrictions, Q-learning, Reinforcement learning, Unrelated parallel machine scheduling problem, Variable neighborhood search, Sequence-dependent setup times

Abstract:
The scheduling of unrelated parallel machines (UPM) is a critical aspect of production planning and a major challenge in the manufacturing industry. Scheduling outcomes directly impact a business's profitability and sustainability. In the UPM problem, the processing times for each work order vary across machines and are not proportionally consistent. This becomes a common scheduling challenge for medium- to large-sized enterprises due to its complexity. To address the UPM scheduling problem, this study aims to minimize the makespan while considering sequence-dependent setup times for both machines and work orders. It then proposes a genetic algorithm integrating reinforcement learning and variable neighborhood search. To assess the feasibility and effectiveness of the proposed algorithm, real work orders from a renowned international semiconductor copper foil manufacturer (Company D) are used as test data to assess the proposed method. The results indicate that the proposed method can reduce the makespan by 22.45% compared to other existing methods used by Company D. Additionally, randomly generated test data were used to validate the effectiveness and feasibility of the method.
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2026 | Volume: 17 | Issue: 4 | Views: 123

 
2.

Solving mixed-model two-sided u-type assembly line balancing problem using a hybrid GA-VNS Pages 1149-1162 PDF Download PDF

Authors: Yฤฑlmaz Delice

doi 10.5267/j.ijiec.2026.4.006

๐Ÿ”‘ Keywords: Two-sided U-type assembly lines, Mixed-model, Genetic Algorithm, Variable Neighborhood Search

Abstract:
This study investigates the mixed-model two-sided U-type assembly line balancing (MMTsUtALB) problem and proposes a hybrid solution approach based on Genetic Algorithm (GA) and Variable Neighborhood Search (VNS). Unlike existing studies on two-sided U-type assembly line balancing (TsUtALB), the mixed-model structure is explicitly considered. In the proposed approach, GA is used to explore the solution space through evolutionary operators, while VNS is applied as a local improvement procedure to refine promising solutions and improve convergence. A problem-oriented priority ruleโ€“based encoding method is adopted to represent solutions, which are transformed into feasible two-sided U-type assembly line configurations using a decoding-based task assignment procedure. This structure allows the algorithm to balance diversification and intensification during the search process. The effectiveness of the GAโ€“VNS hybrid algorithm is evaluated using benchmark test problems. Since this study represents the first attempt to solve the MMTsUtALB problem, the obtained results are compared with closely related mixed-model two-sided assembly line balancing studies. Computational results show that GAโ€“VNS achieves competitive performance, particularly for larger instances, by reducing the number of stations and positions with lower computational times than SA and PSO.
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2026 | Volume: 17 | Issue: 3 | Views: 137

 
3.

Sugar beet transportation problem under growersโ€™ equity regulations: Metaheuristic approach Pages 1123-1142 PDF Download PDF

Authors: Dragana Drenovac, ฤorฤ‘e Stakiฤ‡, Ana Anokiฤ‡, Tatjana Davidoviฤ‡, Milorad Vidoviฤ‡

doi 10.5267/j.ijiec.2025.6.011

๐Ÿ”‘ Keywords: Sugar beet transportation, Growersโ€™ equity, Integer linear programming, Variable neighborhood search, Greedy randomized adaptive search procedure

Abstract:
We consider the optimization problem related to the sugar beet transportation when supplying sugar mills in the sugar production. The sugar beet transportation comprises of loading the beet collected at storage piles and then delivering it to sugar mills. An essential prerequisite to guarantee a viability of the considered sugar mill, is to transport the required quantities of sugar beet while maximizing technological quality and minimizing transportation costs. Some growers may be privileged to conduct collection activities in days of a planning period when sugar beet is fresh and contains larger amount of sucrose, while others do not. This unfair collect scheduling plan should be avoided to provide equal treatment of growers. We propose an Integer Linear Programming (ILP) model with the aim of simultaneously maximizing the amount of collected sucrose during the planning period while minimizing the number of vehicles of a homogenous vehicle fleet, including constraints that provide equal opportunities for growers in sugar beet collection. The problem is denoted by the Sugar Beet Transportation Problem under Growersโ€™ Equity Regulations (SBT-GER). By applying the weighted sum method, the two objective functions are combined to transform the bi-objective problem into a single-objective one. Equity regulations are expressed through the requirement that the minimum percentage of the quantity of sugar beet is guaranteed to be collected from each grower on the day of harvest. For real-sized instances, we propose two metaheuristic algorithms, based on Variable Neighborhood Search (VNS) and Greedy Randomized Adaptive Search Procedure (GRASP), respectively. The developed mathematical model and the proposed metaheuristic approaches are evaluated on a set of randomly generated test instances. The obtained results show that VNS outperforms exact solver and GRASP for the majority of examples.
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2025 | Volume: 16 | Issue: 4 | Views: 338

 
4.

A novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time Pages 21-36 PDF Download PDF

Authors: Yajie Wu, Shiming Yang, Leilei Meng, Weiyao Cheng, Biao Zhang, Peng Dua

doi 10.5267/j.ijiec.2024.11.003

๐Ÿ”‘ Keywords: Flexible job shop scheduling problem, Sequence dependent setup time, Constraint programming, Variable neighborhood search

Abstract:
This study focuses on the flexible job shop scheduling problem with sequence-dependent setup times (FJSP-SDST), and the goal is minimizing the makespan. To solve FJSP-SDST, first, we develop a constraint programming (CP) model to obtain optimal solutions. Due to the NP-hardness of FJSP-SDST, a CP assisted meta-heuristic algorithm (C-VNS-CP) is designed to make use of the advantages of both CP model and cooperative variable neighborhood search (C-VNS). The C-VNS-CP algorithm consists of two stages. The first stage involves C-VNS, for which eight neighborhood structures are defined. In the second stage, CP is used to further optimize the good solution obtained from C-VNS. In order to prove the efficiency of the C-VNS algorithm, CP model, and C-VNS-CP algorithm, experiments of 20 instances are conducted.
Details
  • 51
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2025 | Volume: 16 | Issue: 1 | Views: 1240

 
5.

A novel hybrid algorithm of genetic algorithm, variable neighborhood search and constraint programming for distributed flexible job shop scheduling problem Pages 813-832 PDF Download PDF

Authors: Leilei Meng, Weiyao Cheng, Biao Zhang, Wenqiang Zou, Peng Duan

doi 10.5267/j.ijiec.2024.3.001

๐Ÿ”‘ Keywords: Distributed flexible job shop scheduling problem, Genetic algorithm, Variable neighborhood search, Constraint programming, Makespan minimization

Abstract:
With a decentral and global economy, distributed scheduling problems are getting a lot of attention. This paper addresses a distributed flexible job shop scheduling problem (DFJSP) with minimizing makespan, in which three subproblems, namely operations sequencing, factory selection and machine selection must be determined. To solve the DFJSP, a novel mixed-integer linear programming (MILP) model is first developed, which can solve the small-scaled instances to optimality. Since the NP-hard characteristic of DFJSP, a hybrid algorithm (GA-VNS-CP) of genetic algorithm (GA), variable neighborhood search (VNS) and constraint programming (CP). Specifically, the GA-VNS-CP is divided into two stages. The first stage uses the hybrid meta-heuristic algorithms of GA and VNS (GA-VNS), and the VNS is designed to improve the local search ability of GA. In GA-VNS, the encoding only considers the factory selection and the operations sequencing problems, and the machine selection problem is determined by the decoding rule. Because the solution space may be limited by the decoding rule, the second stage uses the CP to extend the solution and further improve the solution. Numerical experiments based on benchmark instances are conducted to evaluate the effectiveness of the MILP model, VNS, CP and GA-VNS-CP. The experimental results show effectiveness of the MILP model, VNS and CP. Moreover, the GA-VNS-CP algorithm has better performance than traditional algorithms and improves 6 current best solutions for benchmark instances
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2024 | Volume: 15 | Issue: 3 | Views: 2634

 
6.

Variable neighborhood search algorithm for the green vehicle routing problem Pages 195-204 PDF Download PDF

Authors: Mannoubia Affi, Houda Derbel, Bassem Jarboui

doi 10.5267/j.ijiec.2017.6.004

๐Ÿ”‘ Keywords: Green vehicle routing problem, Refueling stations, Variable neighborhood search, Heuristics

Abstract:
This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem. We tested and compared the performance of our algorithm intensively on datasets existing in the literature.
Details
  • 85
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2018 | Volume: 9 | Issue: 2 | Views: 3634

 

® 2010-2026 GrowingScience.Com