A novel hybrid jellyfish algorithm for minimizing fuel consumption capacitated vehicle routing problem

Utama, Dana Marsetiya; Widjonarko, Bahru; Widodo, Dian Setiya

doi:10.11591/eei.v11i3.3263

Cited by 9 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Meta-heuristic algorithm, such as swarm-based algorithm, have been applied to various optimization problems (Utama, Yurifah, and Garside, 2023;Nitnara and Tragangoon, 2023;Zukhruf et al, 2020). This study focused on a single-objective MILP model which aimed to minimize total costs in solving CLSC, location-allocation, transportation, and supplier selection problem.…”

Section: Literature Reviewmentioning

confidence: 99%

A Hybrid Method for The Closed-loop Supply Chain to Minimize Total Logistics Costs

Xu,

Luis,

Yuce

2023

IJTech

View full text Add to dashboard Cite

Crow search algorithm for binary optimization (BinCSA) is currently used in some ideal models of the uncapacitated facility location problem (UFLP), but studies on its use in real-world supply chain cases remain limited. Therefore, this study aimed to address the gap by introducing a hybrid method that combined the BinCSA with an exact method to solve a CLSC problem, including location allocation, transportation, and supplier selection challenges. The initial sections of the study included theoretical foundations and experimental results of the BinCSA. Subsequently, how the BinCSA works in the proposed hybrid method was discussed, and the computational results were showed to evaluate the performance of the proposed method.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Hybrid Method for The Closed-loop Supply Chain to Minimize Total Logistics Costs

Xu,

Luis,

Yuce

2023

IJTech

View full text Add to dashboard Cite

show abstract

“…The algorithm that is currently being developed to solve VRP cases is the Metaheuristic algorithm. In CVRP research, metaheuristic algorithms used include the jellyfish algorithm (Utama et al, 2022), the Ant Colony Optimization (ACO) algorithm (Mutar et al, 2020) & (Dassisti et al, 2017) and the Simulated Annealing (SA) algorithm (Aydemir & Karagul, 2020), (Redi et al, 2020), (İlhan, 2021) & (Normasari et al, 2019) , and many more algorithms are used. The SA algorithm is a favorite in determining vehicle routes.…”

Section: Determination Of the Medical Equipment Delivery Route For Pt...mentioning

confidence: 99%

Determination of the Medical Equipment Delivery Route for PT Tri Sapta Jaya Using Simulated Annealing (SA) Algorithm

Rizal,

Hardiman,

Diningrat

et al. 2023

Int. J. Multidiscipline. Approach. Res. Sci.

View full text Add to dashboard Cite

This research was conducted at PT Tri Sapta Jaya, a medical equipment distributor company. The product distribution to consumers was inefficient due to using traditional methods. The division of regions and determination of delivery routes was based on districts and cities. The existing delivery method faced various challenges, including delivery delays and inefficient routes. This inefficiency results in potential financial losses for the company in terms of delivery costs. To assist the company in improving delivery efficiency, this research focuses on determining vehicle routes considering vehicle capacity (Capacity Vehicle Routing Problem). In solving and searching for solutions, the research uses Simulated-Annealing algorithm. The algorithm generated an initial solution randomly and improved the solution by changing the positions of consumers within a route and switching positions of consumers between routes to obtain the best solution. The computation time of the developed Simulated Annealing algorithm was quite efficient, taking only 2 seconds for 25 consumers. Based on the data from PT Tri Sapta Jaya, the best solution obtained was 615,319. This result was achieved using the Simulated Annealing algorithm with the parameters T0 = 100,000, Ta = 1, and α = 0.9.

show abstract

“…Utama et al 60 proposed the hybrid-jellyfish (HJF) algorithm which combines JSO and the neighborhood exchange strategy. HJF has five major stages: (1) initializing the position of the jellyfish swarm and ocean currents; (2) updating position based on jellyfish movement; (3) applying the time control mechanism; (4) applying the rules of large rank value; and (5) improving solutions based on neighborhood exchange procedures.…”

Section: Recent Improvements On and Variants Of Jsomentioning

confidence: 99%

Recent advances in use of bio-inspired jellyfish search algorithm for solving optimization problems

Chou

Molla

2022

Sci Rep

View full text Add to dashboard Cite

The complexity of engineering optimization problems is increasing. Classical gradient-based optimization algorithms are a mathematical means of solving complex problems whose ability to do so is limited. Metaheuristics have become more popular than exact methods for solving optimization problems because of their simplicity and the robustness of the results that they yield. Recently, population-based bio-inspired algorithms have been demonstrated to perform favorably in solving a wide range of optimization problems. The jellyfish search optimizer (JSO) is one such bio-inspired metaheuristic algorithm, which is based on the food-finding behavior of jellyfish in the ocean. According to the literature, JSO outperforms many well-known meta-heuristics in a wide range of benchmark functions and real-world applications. JSO can also be used in conjunction with other artificial intelligence-related techniques. The success of JSO in solving diverse optimization problems motivates the present comprehensive discussion of the latest findings related to JSO. This paper reviews various issues associated with JSO, such as its inspiration, variants, and applications, and will provide the latest developments and research findings concerning JSO. The systematic review contributes to the development of modified versions and the hybridization of JSO to improve upon the original JSO and present variants, and will help researchers to develop superior metaheuristic optimization algorithms with recommendations of add-on intelligent agents.

show abstract

A novel hybrid jellyfish algorithm for minimizing fuel consumption capacitated vehicle routing problem

Cited by 9 publications

References 27 publications

A Hybrid Method for The Closed-loop Supply Chain to Minimize Total Logistics Costs

A Hybrid Method for The Closed-loop Supply Chain to Minimize Total Logistics Costs

Determination of the Medical Equipment Delivery Route for PT Tri Sapta Jaya Using Simulated Annealing (SA) Algorithm

Recent advances in use of bio-inspired jellyfish search algorithm for solving optimization problems

Contact Info

Product

Resources

About