A hybrid metaheuristic algorithm based on iterated local search for vehicle routing problem with simultaneous pickup and delivery

Öztaş, Tayfun; Tuş, Ayşegül

doi:10.1016/j.eswa.2022.117401

Cited by 23 publications

(5 citation statements)

References 74 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Öztaş [14] Hybrid algorithms combining iterative local search, variable neighborhood descent and threshold acceptance metaheuristics…”

Section: Vehicle Routing Problem With Time Window (Vrptw)mentioning

confidence: 99%

Review of research on vehicle routing problems

Hao,

Mao,

Wei

et al. 2024

International Conference on Smart Transportation and City Engineering (STCE 2023)

View full text Add to dashboard Cite

With the rise of the social logistics industry, the vehicle routing problem has always been a hot topic for scholars to study. This paper focuses on the recent research advances in the last 5 years of the vehicle routing problem, which contains the basic vehicle routing problem (VRP), vehicle routing problem with capacity constraints (CVRP), vehicle routing problem with time windows (VRPTW), split delivery vehicle routing problem (SDVRP), dynamic vehicle routing problem (DVRP), other types of VRPs, and so on. By subdividing the above according to VRP characteristics and describing its solution method. Finally, future research trends and development trends of VRP are summarized.

show abstract

“…Öztaş [14] Hybrid algorithms combining iterative local search, variable neighborhood descent and threshold acceptance metaheuristics…”

Section: Vehicle Routing Problem With Time Window (Vrptw)mentioning

confidence: 99%

Review of research on vehicle routing problems

Hao,

Mao,

Wei

et al. 2024

International Conference on Smart Transportation and City Engineering (STCE 2023)

View full text Add to dashboard Cite

show abstract

“…VRP is a typical NP-hard problem. With the increase in the problem size, it is difficult for the exact algorithm to find the optimal solution quickly, so scholars use a meta-heuristic or improved heuristic algorithm to solve the problem [36]. In cold chain logistics, an improved heuristic algorithm can quickly help logistics enterprises plan the optimal distribution route, reasonably arrange the distribution vehicles and reduce the distribution cost [37].…”

Section: Algorithm Optimizationmentioning

confidence: 99%

Optimization of Electric Vehicle Routes Considering Multi-Temperature Co-Distribution in Cold Chain Logistics with Soft Time Windows

He,

Yang,

et al. 2024

WEVJ

View full text Add to dashboard Cite

Inspired by the practice of urban distribution of fresh products, we introduce a new electric vehicle routing problem with soft time windows. In this problem, goods with different temperature layers can be distributed in ordinary electric vehicles simultaneously based on the cold storage insulation box. The primary objective is to devise optimized distribution routes for logistics companies to minimize distribution costs, including transportation, refrigeration, and charging costs. To address this, we present a mathematical model for the problem and propose an improved ant colony optimization algorithm combined with a 2-opt algorithm. Based on Solomon dataset, we conduct numerical experiments to verify the effectiveness of the proposed model and algorithm. The numerical results demonstrate that multi-temperature co-distribution can lead to a reduction in distribution cost and an improvement in distribution efficiency.

show abstract

“…Additionally, they designed an extended genetic algorithm with a new multi-stage paired vectors representation scheme that is offered to deal more effectively with the proposed DMS-FSC strategy. Oztas and Tus [32] proposed a hybrid algorithm combining the iterated local search, variable neighborhood descent and threshold acceptance metaheuristics to solve the VRPSPD. Yu and Aloina [33] cast the VRPSPD into a mixed-integer linear programming model and proposed a simulated annealing heuristic with a mathematical programming-based construction heuristic to solve the VRPSPD.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimization of Simultaneous Pickup and Delivery Vehicle Routing with Three-Dimensional Balanced Loading Constraints

Zhang

Sheng

2023

Sustainability

View full text Add to dashboard Cite

In order to promote the cost reduction and efficiency improvement of the logistics distribution process and to guarantee the safety of goods transportation, this paper studies the portfolio optimization of goods loading and the problem of simultaneous pickup and delivery vehicle routing. A balanced loading constraint was introduced to restrict loading through two aspects of axle weight bearing and lateral center-of-gravity offset. With the shortest total route length as the objective, this paper constructs a simultaneous pickup and delivery vehicle routing model with three-dimensional (3D) balanced loading constraints (3BL-VRPSPD). Additionally, a hybrid tabu search (TS) algorithm embedded loading test was proposed to solve this problem. Firstly, a heuristic insertion method was applied to determine the initial routing scheme, and the node swapping and relocation operators were designed to construct the tabu neighborhood scheme for routing optimization. On this basis, the 3D balanced loading was incorporated into the routing iteration process. A balanced loading algorithm, combining multiple-indicator ordering and maximum space division strategies (MOMD), was formulated to develop a 3D-balanced loading plan for goods with a pickup and delivery vehicle routing scheme. Finally, standard instances verified the effectiveness of the method. The results show that the proposed method can effectively optimize 3BL-VRPSPD and outperform other algorithms.

show abstract

A hybrid metaheuristic algorithm based on iterated local search for vehicle routing problem with simultaneous pickup and delivery

Cited by 23 publications

References 74 publications

Review of research on vehicle routing problems

Review of research on vehicle routing problems

Optimization of Electric Vehicle Routes Considering Multi-Temperature Co-Distribution in Cold Chain Logistics with Soft Time Windows

Optimization of Simultaneous Pickup and Delivery Vehicle Routing with Three-Dimensional Balanced Loading Constraints

Contact Info

Product

Resources

About