A Fast Randomized Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery

Nepomuceno, Napoleão; Saboia, Ricardo Barboza; Pinheiro, Plácido Rogério

doi:10.3390/a12080158

Cited by 6 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their threshold function has an adaptive property capable of self-adjustment. Nepomuceno and Saboia [22] proposed a fast randomized algorithm using the nearest neighbor strategy to tackle an extension of the VRPSPD in which the fleet of vehicles is heterogeneous.…”

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

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

show abstract

“…et al [30] proposed an adaptive multi-local search algorithm to solve HFVRPTW with two-dimensional loading constraints. Considering the HFVRP with simultaneous pickup and delivery, Napoleão N. et al [31] proposed a randomized algorithm to tackle it. However, the search efficiency of traditional heuristic algorithm is unsatisfactory, because it is easy to fall into local optimal and lead to hardly achieve global optimization.…”

Section: Heterogeneous Multitype Fleet Vehicle Routing Problems With ...mentioning

confidence: 99%

Heterogeneous Multitype Fleet Green Vehicle Path Planning of Automated Guided Vehicle with Time Windows in Flexible Manufacturing System

et al. 2022

View full text Add to dashboard Cite

In this study, we present and discuss a variant of the classical vehicle routing problem (VRP), namely the heterogeneous multitype fleet green automated guided vehicle (AGV) routing problem with time windows (HFGVRPTW) applied in the workshops of flexible manufacturing systems (FMS). Specifically, based on the analysis of AGV body structure and motion state, transport distance and energy consumption are selected as two optimization objectives. According to the characteristics and application context of the problem, this paper designs a hybrid genetic algorithm with large neighborhood search (GA-LNS) considering the farthest insertion heuristic. GA-LNS is improved by increasing the local search ability of genetic algorithm to enhance the solution optimal quality. Extensive computational experiments which are generated from Solomon’s benchmark instances and a real case of FMS are designed to evaluate and demonstrate the efficiency and effectiveness of the proposed model and algorithm. The experimental results reveal that compared with using the traditional homogeneous fleet, the heterogeneous multitype AGV fleet transportation mode has a huge energy-saving potential in workshop intralogistics.

show abstract

“…Many variants of the VRP have been studied in the literature, and recent research focuses on modeling very specialized real-world variants of the VRP. Some of these recent specialized real-world variants can be found in [20][21][22][23][24][25][26][27][28][29].…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Grasshopper Optimization Algorithm Applied to the Open Vehicle Routing Problem

et al. 2020

View full text Add to dashboard Cite

This paper presents a hybrid grasshopper optimization algorithm using a novel decoder and local search to solve instances of the open vehicle routing problem with capacity and distance constraints. The algorithm's decoder first defines the number of vehicles to be used and then it partitions the clients, assigning them to the available routes. The algorithm performs a local search in three neighborhoods after decoding. When a new best solution is found, every route is locally optimized by solving a traveling salesman problem, considering the depot and clients in the route. Three sets containing a total of 30 benchmark problems from the literature were used to test the algorithm. The experiments considered two cases of the problem. In the first, the primary objective is to minimize the total number of vehicles and then the total distance to be traveled. In the second case, the total distance traveled by the vehicles is minimized. The obtained results showed the algorithm's proficient performance. For the first case, the algorithm was able to improve or match the best-known solutions for 21 of the 30 benchmark problems. For the second case, the best-known solutions for 18 of the 30 benchmark problems were found or improved by the algorithm. Finally, a case study from a real-life problem is included.

show abstract

A Fast Randomized Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery

Cited by 6 publications

References 16 publications

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

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

Heterogeneous Multitype Fleet Green Vehicle Path Planning of Automated Guided Vehicle with Time Windows in Flexible Manufacturing System

A Hybrid Grasshopper Optimization Algorithm Applied to the Open Vehicle Routing Problem

Contact Info

Product

Resources

About