A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
From MaRDI portal
Publication:1718582
DOI10.1155/2014/517467zbMath1407.90071OpenAlexW1590882662WikidataQ59068131 ScholiaQ59068131MaRDI QIDQ1718582
Zhi-yu Xu, Wei-hui Shao, Wei-sheng Xu, Zheng-yang Zeng
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/517467
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
The electric two-echelon vehicle routing problem ⋮ An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization ⋮ A large neighbourhood based heuristic for two-echelon routing problems ⋮ Route optimization cold chain logistic distribution using greedy search method ⋮ Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization ⋮ Two-echelon vehicle routing problems: a literature review ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
Cites Work
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- Handbook of metaheuristics
This page was built for publication: A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
