A Routing Model for Hybrid Hub-and-Spoke with Time Windows

Gunadi, Felix Arya; Lesmono, Dharma; Aritonang, Kinley

doi:10.22219/jtiumm.vol21.no1.22-33

Cited by 3 publications

(4 citation statements)

References 20 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distribution route planning is an important activity in the supply chain sector [1], [2], and it can help a company's operational costs [3]. However, inadequate distribution route planning leads to high distribution costs [4], [5]. Transportation activities have contributed to an increase in pollution [6].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

2022

View full text Add to dashboard Cite

Distribution is a critical activity that must be carefully planned in order to minimize the company's fuel costs. The hybrid jellyfish (HJF) algorithm is proposed in this study to solve the fuel consumption capacity vehicle routing problem (FCCVRP). This problem's objective function is to minimize fuel consumption costs. The proposed HJF algorithm is used in this study to generate optimal fuel consumption through a population and iteration parameter experiment. The experiment results indicate that the HJF increasing parameter has an effect on reducing the total cost of fuel. Additionally, this study presents an algorithm comparison that demonstrates how effectively the proposed HJF algorithm solves FCCVRP.

show abstract

Section: Introductionmentioning

confidence: 99%

“…is the behavior of each jellyfish swimming in the best direction to find food. This behavior is denoted in (5), where 𝑓 is the objective function of location 𝑋.…”

mentioning

confidence: 99%

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

2022

View full text Add to dashboard Cite

show abstract

“…The development of VRP research includes problems with heterogeneous fleets, time windows, split delivery, and pick-up and delivery problems. Some of the best known VRP developments are the Vehicle Routing Problem with pick-ups and delivery (VRPPD) [5], [6], [7]; Vehicle Routing Problem with split delivery (SDVRP) [8], [9]; Vehicle Routing Problem with time window (VRPTW) [10], [11], [12], [13], [14]. Besides the VRP types above, there are several other types of VRP developments such as the Periodic Vehicle Routing Problem (PVRP), Multi Depot Vehicle Routing Problem (MDVRP), Capacitated Vehicle Routing Problem (CVRP), Green Vehicle Routing Problem (G-VRP).…”

Section: Introductionmentioning

confidence: 99%

Model of Flexible Periodic Vehicle Routing Problem-Service Choice Considering Inventory Status

Rizal

Saidatuningtyas

2021

JTI

View full text Add to dashboard Cite

Vehicle routing problems and inventory problems need to be integrated in order to improve performance. This research discusses the determination of vehicle routes for product delivery with periodic delivery times that are released at any time depending on the inventory status. A mixed-integer linear programming model in determining periodic flexible visiting vehicles' route considering inventory is proposed to solve this problem. This model also accommodates time window constraints, retailer warehouse capacity. The search for solutions was carried out using the branch-and-bound method with the help of Lingo 18.0. The mathematical model testing result saves shipping costs and inventory costs. In addition, the developing mathematical model offers the flexibility of visiting depending on the inventory status of the consumer. The sensitivity analysis of the model results in the vehicle capacity influence the total cost and routes formed.

show abstract

“…G-VRP is the development of the classic vehicle routing problem (VRP). e VRP aims to minimize the total cost [14,15] and the distance of travel [16][17][18]. However, the G-VRP aims at reducing the environmental impacts, such as reducing fuel consumption and carbon emissions caused by the distribution process [19,20].…”

Section: Introductionmentioning

confidence: 99%

A New Hybrid Butterfly Optimization Algorithm for Green Vehicle Routing Problem

Utama

Widodo

Ibrahim

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

In the industrial sector, transportation plays an essential role in distribution. This activity impacts climate change and global warming. One of the critical problems in distribution is the green vehicle routing problem (G-VRP). This study focuses on G-VRP for a single distribution center. The objective function is to minimize the distribution costs by considering fuel costs, carbon costs, and vehicle use costs. This research aims to develop the hybrid butterfly optimization algorithm (HBOA) to minimize the distribution costs on G-VRP. It was inspired by the butterfly optimization algorithm (BOA), which was by combining the tabu search (TS) algorithm and local search swap and flip strategies. BOA is a new metaheuristic algorithm that has been successfully applied in various engineering fields. Experiments were carried out to test the parameters of the proposed algorithm and vary the speed of vehicles. The proposed algorithm was also compared with several procedures of prior study. The experimental results proved that the HBOA could minimize the total distribution cost compared to other algorithms. Moreover, the computation time is also included in the analysis.

show abstract

A Routing Model for Hybrid Hub-and-Spoke with Time Windows

Cited by 3 publications

References 20 publications

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

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

Model of Flexible Periodic Vehicle Routing Problem-Service Choice Considering Inventory Status

A New Hybrid Butterfly Optimization Algorithm for Green Vehicle Routing Problem

Contact Info

Product

Resources

About