A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows

Dondo, Rodolfo Gabriel; Cerdá, Jaime

doi:10.1016/j.ejor.2004.07.077

Cited by 258 publications

(145 citation statements)

References 11 publications

Supporting

Mentioning

136

Contrasting

Unclassified

Order By: Relevance

“…Tarantilis and Kiranoudis (2007) adapted a BoneRoute method that uses adaptive memory to solve two case studies, one from the diary and the other in the construction sector. Dondo and Cerda (2007) developed a three phase heuristic for the multi-depot HFVRPTW. The idea is to use clustering to reduce the size of the problem which is then solved optimally.…”

Section: Introductionmentioning

confidence: 99%

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

Imran

Salhi

Wassan

2009

European Journal of Operational Research

123

View full text Add to dashboard Cite

The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the 2-opt. Our VNS algorithm uses several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. Two VNS variants, which differ in the order the diversification and Dijkstra's algorithm are used, are implemented. Both variants appear to be competitive and produce new best results when tested on the data sets from the literature. We also constructed larger data sets for which benchmarking results are provided for future comparison.

show abstract

Section: Introductionmentioning

confidence: 99%

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

Imran

Salhi

Wassan

2009

European Journal of Operational Research

123

View full text Add to dashboard Cite

show abstract

“…The study by Dondo and Gerda [33] was one of them. Using a heuristic/algorithmic approach, they clustered demand points and dedicated them to vehicles in a multi-depot heterogeneous VRP based on time windows.…”

Section: Related Workmentioning

confidence: 99%

A cluster-based emergency vehicle routing problem in disaster with reliability

et al. 2017

View full text Add to dashboard Cite

Abstract. In the event of natural disasters, relief distribution is the most challenging problem in emergency transportation. What is important in response to disaster is victims' relief in disaster areas with the quick distribution of vital commodity. In this regard, damage to infrastructure (e.g., roads) can make trouble in designing a distribution network. Therefore, this paper considers a problem using a three-stage approach. In the rst stage, pre-processing of model inputs is done through an Arti cial Neural Fuzzy Inference System (ANFIS) followed by investigating the safest route for each cluster using decision-making techniques and graph theory. In the second stage, a heterogeneous multi-depot multimode vehicle routing problem is formulated for minimizing the transportation time and maximizing the reliability. Finally, since the routing problem is NP-hard, 2 multi-objective meta-heuristic algorithms, namely, Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-Objective Fire y Algorithm (MOFA), are proposed to obtain the optimal solution and their performances are compared through a set of randomly generated test problems. The results show that for this routing problem, the MOFF gives better solutions than NSGA-II does, and it performs well in terms of accuracy and solution time.

show abstract

“…Nagata [45] proposed a new penalty function in which change can be computed in O(1) time for the VRPTW. When a later service happens for a customer, a time warp operation is performed such that the arrival time is adjusted to the end of the time window, and a penalty is added to the original objective.…”

Section: Time Warp Operationmentioning

confidence: 99%

“…Using spatial clustering, Dondo and Cerdá [45] divided the large scale VRPTW into a set of small-sized problems. Routes were generated for each small problem to provide a high quality initial solution.…”

Section: Heuristic Algorithms For the Vrptwmentioning

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 cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows

Cited by 258 publications

References 11 publications

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

A cluster-based emergency vehicle routing problem in disaster with reliability

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

Contact Info

Product

Resources

About