Iterative Local-Search Heuristic for Weighted Vehicle Routing Problem

Wang, Xinyu; Shao, Shuai; Tang, Jiafu

doi:10.1109/tits.2020.2983398

Cited by 17 publications

(4 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is that the insertion with large regret will lead to a high cost if it is not inserted in the best position. Applications of this adjustment can be found in many works, including [70,303,81].…”

Section: Insert Methodsmentioning

confidence: 99%

“…The applications of ILS can be found on the prize-collecting VRP [276], time-dependent VRP [121], VRP with time penalty functions [127], VRP with heterogeneous [212], VRP with backhauls [64], VRP with multiple, incompatible commodities and multiple trips [42], split delivery VRP [261], location-routing [203], and weighted VRP [303]. Several recent improvements are carried out with additional procedures to extend the basic ILS.…”

Section: Iterated Local Searchmentioning

confidence: 99%

See 1 more Smart Citation

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Liu¹,

Lu²,

Gui³

et al. 2023

Preprint

View full text Add to dashboard Cite

Vehicle routing is a well-known optimization research topic with significant practical importance. Among different approaches to solving vehicle routing, heuristics can produce a satisfactory solution at a reasonable computational cost. Consequently, much effort has been made in the past decades to develop vehicle routing heuristics. In this article, we systematically survey the existing vehicle routing heuristics, particularly on works carried out in recent years. A classification of vehicle routing heuristics is presented, followed by a review of their methodologies, recent developments, and applications. Moreover, we present a general framework of state-of-the-art methods and provide insights into their success. Finally, three emerging research topics with notable works and future directions are discussed.

show abstract

Section: Insert Methodsmentioning

confidence: 99%

Section: Iterated Local Searchmentioning

confidence: 99%

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Liu¹,

Lu²,

Gui³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Local search (LS) is a classical method used for solving combinatorial optimization problems. In extant studies, LS proved to be an effective method for generating high-quality solutions to routing problems [38] . The LS basic idea is to improve interactively an initial solution using local modifications until finding the high-quality solution.…”

Section: Solution Approachesmentioning

confidence: 99%

Towards an efficient collection and transport of COVID-19 diagnostic specimens using genetic-based algorithms

Tlili

Masri

Krichen

2022

Applied Soft Computing

View full text Add to dashboard Cite

The speed by which the COVID-19 pandemic spread throughout the world makes the emergency services unprepared to answer all the patients’ requests. The Tunisian ministry of health established a protocol planning the sample collection from the patients at their location. A triage score is first assigned to each patient according to the symptoms he is showing, and his health conditions. Then, given the limited number of the available ambulances in each area, the location of the patients and the capacity of the nearby hospitals for receiving the testing samples, an ambulance scheduling and routing plan needs to be established so that specimens can be transferred to hospitals in short time. In this paper, we propose to model this problem as a Multi-Origin-Destination Team Orienteering Problem (MODTOP). The objective is to find the optimal one day tour plan for the available ambulances that maximizes the collected scores of visited patients while respecting duration and capacity constraints. To solve this NP-hard problem, two highly effective approaches are proposed which are Hybrid Genetic Algorithm (HGA) and Memetic Algorithm (MA). The HGA combines (i) a k-means construction method for initial population generation and (ii) a one point crossover operator for solution recombination. The MA is an improvement of HGA that integrates an effective local search based on three different neighborhood structures. Computational experiments, supported by a statistical analysis on benchmark data sets, illustrate the efficiency of the proposed approaches. HGA and MA reached the best known solutions in 54.7% and 73.5% of instances, respectively. Likewise, MA reached a relative error of 0.0675% and performed better than four existing approaches. Real-case instances derived from the city of Tunis were also solved and compared with the results of an exact solver Cplex to validate the effectiveness of our algorithm.

show abstract

“…VRP is a NP-hard problem and is one of the hotspots in operations research and combinatorial optimization. In recent years, heuristic algorithms have been widely explored in solving large-scale VRPs [5][6][7][8]. Therefore, a new algorithm for VRP has a certain theoretical significance and practical value.…”

Section: Introductionmentioning

confidence: 99%

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Jin-yin¹,

Shang

Jing

et al. 2022

Electronics

View full text Add to dashboard Cite

To address the poor searchability, population diversity, and slow convergence speed of the differential evolution (DE) algorithm in solving capacitated vehicle routing problems (CVRP), a new multistrategy-based differential evolution algorithm with the saving mileage algorithm, sequential encoding, and gravitational search algorithm, namely SEGDE, is proposed to solve CVRP in this paper. Firstly, an optimization model of CVRP with the shortest total vehicle routing is established. Then, the saving mileage algorithm is employed to initialize the population of the DE to improve the initial solution quality and the search efficiency. The sequential encoding approach is used to adjust the differential mutation strategy to legalize the current solution and ensure its effectiveness. Finally, the gravitational search algorithm is applied to calculate the gravitational relationship between points to effectively adjust the evolutionary search direction and further improve the search efficiency. Four CVRPs are selected to verify the effectiveness of the proposed SEGDE algorithm. The experimental results show that the proposed SEGDE algorithm can effectively solve the CVRPs and obtain the ideal vehicle routing. It adopts better search speed, global optimization ability, routing length, and stability.

show abstract

Iterative Local-Search Heuristic for Weighted Vehicle Routing Problem

Cited by 17 publications

References 35 publications

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Towards an efficient collection and transport of COVID-19 diagnostic specimens using genetic-based algorithms

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Contact Info

Product

Resources

About