A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Zachariadis, Emmanouil E.; Kiranoudis, Chris T.

doi:10.1016/j.cor.2010.02.009

Cited by 75 publications

(65 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the unique depot). For these instances with 420 and 3,000 entities, the value of the feasible VRP solutions observed were typically 8-10 % above the best solutions known, reported in [7,20]. The computational time was less than 0.4 s for the instance with 420 entities and about 10 s for the instances with 3,000 Fig.…”

Section: Analysis Of Resultsmentioning

confidence: 69%

“…Even if the upper bounds are near 2 times the value of the lower bounds, we are confident that these results are not too bad, after having made the following experiment: We took few of the largest academic VRP instances publicly available, i.e. those proposed by [6,20] and we observed the solutions quality obtained with the following method: The entities are first clustered with our CPMD approach (trying different T capacity targets for having sets of entities not larger than vehicle capacity Q) and a TSP is solved for each cluster (? the unique depot).…”

Section: Analysis Of Resultsmentioning

confidence: 99%

“…Such a complexity is lower than that of other approaches specifically designed for limiting the algorithmic complexity of high-quality heuristics. For instance, the approach of [20] for the Vehicle Routing Problem, which is a sub-problem of the LRP, includes a step with quadratic algorithmic complexity. The memory requirement of this approach is also quadratic, meaning that problem instances with, let us say, 10 5 entities cannot be solved.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

POPMUSIC for the world location-routing problem

Alvim

Taillard

2013

EURO Journal on Transportation and Logistics

View full text Add to dashboard Cite

POPMUSIC-partial optimization metaheuristic under special intensification conditions-is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labelling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template is to find an initial solution. This article presents a method for generating an appropriate initial solution to the location-routing problem by producing in O (n 3/2 ) an approximate solution to the capacitated p-median problem. The method is tested on LRP instances with millions of entities.

show abstract

Section: Analysis Of Resultsmentioning

confidence: 69%

Section: Analysis Of Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

POPMUSIC for the world location-routing problem

Alvim

Taillard

2013

EURO Journal on Transportation and Logistics

View full text Add to dashboard Cite

show abstract

“…4, cause no significant increase of the runtime of the algorithm, a fast implementation of MAENS local search is introduced, which helped reducing effectively the runtime without incurring into extra memory consumption. The approach is similar to the one introduced in Zachariadis and Kiranoudis (2010) for the vehicle routing problem, but without relying on the use of memory.…”

Section: Improvements On Local Search Efficiencymentioning

confidence: 96%

Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis

et al. 2016

View full text Add to dashboard Cite

Self-adaptive mechanisms for the identification of the most suitable variation operator in evolutionary algorithms rely almost exclusively on the measurement of the fitness of the offspring, which may not be sufficient to assess the optimality of an operator (e.g., in a landscape with an high degree of neutrality). This paper proposes a novel adaptive operator selection mechanism which uses a set of four fitness landscape analysis techniques and an online learning algorithm, dynamic weighted majority, to provide more detailed information about the search space to better determine the most suitable crossover operator. Experimental analysis on the capacitated arc routing problem has demonstrated that different crossover operators behave differently during the search process, and selecting the proper one adaptively can lead to more promising results.

show abstract

“…Usually, the exploration removes or adds edges from the current solution by using local search operators. Three typical local search operators, including the 1-0 exchange move, 1-1 exchange move, and 2-Opt move [51], are used to explore the neighborhood solution in this article.…”

Section: Local Searchmentioning

confidence: 99%

A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

Fang

et al. 2015

IJGI

View full text Add to dashboard Cite

Vehicle routing optimization (VRO) designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard) complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-temporal perspective, this paper presents a spatial-temporal Voronoi diagram-based heuristic approach for large-scale vehicle routing problems with time windows (VRPTW). Considering time constraints, a spatial-temporal Voronoi distance is derived from the spatial-temporal Voronoi diagram to find near neighbors in the space-time searching context. A Voronoi distance decay strategy that integrates a time warp operation is proposed to accelerate local search procedures. A spatial-temporal feature-guided search is developed to improve unpromising micro route structures. Experiments on VRPTW benchmarks and real-world instances are conducted to verify performance. The results demonstrate that the proposed approach is competitive with state-of-the-art heuristics and achieves high-quality solutions for large-scale instances of OPEN ACCESS ISPRS Int. J. Geo-Inf. 2015, 4 2020 VRPTWs in a short time. This novel approach will contribute to spatial decision support community by developing an effective vehicle routing optimization method for large transportation applications in both public and private sectors.

show abstract

A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Cited by 75 publications

References 32 publications

POPMUSIC for the world location-routing problem

POPMUSIC for the world location-routing problem

Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis

A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

Contact Info

Product

Resources

About