Construction and improvement heuristics applied to the capacitated vehicle routing problem

Tavares, Leonardo G.; Lopes, Heitor Silvério; Lima, Carlos R. Erig

doi:10.1109/nabic.2009.5393467

Cited by 9 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A two-stage approach enables designing effective algorithms for both optimization stages independently. In construction heuristics, unserved customers are iteratively inserted into a partial solution (Potvin and Rousseau 1993;Petch and Salhi 2003;Tavares et al 2009;Pang 2011). Improvement heuristics modify an initial solution to explore the solution space (Bräysy and Gendreau 2005;Nagata and Bräysy 2009).…”

Section: Vehicle Routing Problem With Time Windowsmentioning

confidence: 99%

Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows

Nalepa

Błocho²

2015

Soft Comput

View full text Add to dashboard Cite

This paper presents an adaptive memetic algorithm to solve the vehicle routing problem with time windows (VRPTW). It is a well-known NP-hard discrete optimization problem with two objectives-to minimize the number of vehicles serving a set of geographically dispersed customers, and to minimize the total distance traveled in the routing plan. Although memetic algorithms have been proven to be extremely efficient in solving the VRPTW, their main drawback is an unclear tuning of their numerous parameters. Here, we introduce the adaptive memetic algorithm (AMA-VRPTW) for minimizing the total travel distance. In AMA-VRPTW, a population of solutions evolves with time. The parameters of the algorithm, including the selection scheme, population size and the number of child solutions generated for each pair of parents, are adjusted dynamically during the search. We propose a new adaptive selection scheme to balance the exploration and exploitation of the solution space. Extensive experimental study performed on the well-known Solomon's and Gehring and Homberger's benchmark sets confirms the efficacy and convergence capabilities of the proposed AMA-VRPTW. We show that it is very competitive compared with other state-of-the-art techniques. Finally, the influence of the proposed adaptive schemes on the AMA-VRPTW behavior and performance is investigated in a thorough sensitivity analysis. This analysis is complemented with

show abstract

Section: Vehicle Routing Problem With Time Windowsmentioning

confidence: 99%

Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows

Nalepa

Błocho²

2015

Soft Comput

View full text Add to dashboard Cite

show abstract

“…Heuristic methods can be grouped into construction and improvement techniques. In the former case, unserved customers are iteratively inserted into a partial solution [53][54][55]62,64]. Alternatively, improvement heuristics modify an initial solution to explore new regions of the solution space, e.g., by applying some local search procedures [13,45].…”

Section: Vehicle Routing Problem With Time Windowsmentioning

confidence: 99%

Co-operation in the Parallel Memetic Algorithm

Nalepa

Błocho²

2014

Int J Parallel Prog

View full text Add to dashboard Cite

Evolutionary algorithms (EAs) have been attracting research attention for last decades. They were shown to be very efficient in solving various complex optimization problems in most fields of science and engineering. In EAs, the population of solutions evolves in time to explore the search space. Parallel EAs became an important stream of development due to a wide availability of parallel computer architectures. Thus, designing parallel algorithms utilizing hundreds of CPU cores efficiently is critical nowadays. In this paper, we investigate the impact of selecting a cooperation scheme for the parallel memetic algorithm (PMA-VRPTW) to solve the NP-hard vehicle routing problem with time windows. In the island-model PMA-VRPTW, which is a hybrid of a genetic algorithm applied to explore the search space, and some refinement methods to exploit solutions already found, a number of populations are evolved in parallel. Processes then cooperate and exchange solutions according to the cooperation scheme (migration policy, interval, and topology). Extensive experimental study (which comprised more than 1,584,000 CPU hours on an SMP cluster) performed on 1000-customer Gehring and Homberger's (GH) benchmark tests gave a detailed insight into the PMA-VRPTW performance and search capabilities. We report 19 (32 % of all 1000-customer GH tests) new world's best solutions obtained using the best cooperation schemes. Finally, we give clear and consistent guidelines on how to select a proper cooperation scheme in PMA-VRPTW based on the test characteristics.

show abstract

“…Tour Construction heuristics iteratively construct based on specified criteria, fol-lowing three steps namely, initialization, selection and insertion. Improvement heuristics iteratively refine solutions until it is impossible to obtain a better solution [7,8]. Compound heuristics deploy a cocktail of techniques and obtain the best performing combina-tion [9,10,11,12,13].…”

Section: Introductionmentioning

confidence: 99%

A Computation Investigation of the Impact of Convex Hull subtour on the Nearest Neighbour Heuristic

Asani

Okeyinka

Adebiyi

2023

2023 International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG)

View full text Add to dashboard Cite

This study investigated the computational effect of a Convex Hull subtour on the Nearest Neighbour Heuristic. Convex hull subtour has been shown to theoretically degrade the worstcase performances of some insertion heuristics from twice optimal to thrice optimal, although other empirical studies have shown that the introduction of the convex hull as a subtour is expected to minimize the occurrences of outliers, thereby potentially improving the solution quality. This study was therefore conceived to investigate the empirical effect of a convex-hull-based initial tour on the Nearest Neighbour Heuristic vis-a-vis the traditional use of a single node as the initial tour. The resulting hybrid Convex Hull-Nearest Neighbour Heuristic (CH-NN) was used to solve the Travelling Salesman Problem. The technique was experimented using publicly available testbeds from TSPLIB. The performance of CH-NN vis-à-vis that of the traditional Nearest Neighbour solution showed empirically that Convex Hull can potentially improve the solution quality of tour construction techniques.

show abstract

Construction and improvement heuristics applied to the capacitated vehicle routing problem

Cited by 9 publications

References 10 publications

Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows

Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows

Co-operation in the Parallel Memetic Algorithm

A Computation Investigation of the Impact of Convex Hull subtour on the Nearest Neighbour Heuristic

Contact Info

Product

Resources

About