A large neighbourhood based heuristic for two-echelon routing problems

DOI10.1016/j.cor.2016.06.014zbMath1349.90073arXiv1505.08003OpenAlexW2593437733WikidataQ59389533 ScholiaQ59389533MaRDI QIDQ342576

Richard F. Hartl, Thibaut Vidal, U. Breunig, Verena Schmid

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.08003

zbMATH Keywords

heuristicmulti-depot vehicle routing problemlarge neighbourhood searchsplit delivery vehicle routing problemcity logisticsvariable neighbourhood searchcapacitated vehicle routing problemadaptive large neighbourhood searchtwo-echelon vehicle routing problemcovariance matrix adaptation evolution strategytwo-echelon location routing problem with single depotwo-echelon location routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (20)

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 bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint ⋮ A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ The vehicle routing problem with arrival time diversification on a multigraph ⋮ The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ 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 ⋮ The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology ⋮ A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach ⋮ Two-echelon vehicle routing problem with satellite bi-synchronization ⋮ A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles ⋮ Two-echelon vehicle routing problems: a literature review ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows ⋮ A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

Uses Software

• R
• OR-Library
• CMA-ES
• VRP

Cites Work

• Unnamed Item
• A survey on two-echelon routing problems
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
• A comparative study of heuristics for a two-level routing-location problem
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
• Record breaking optimization results using the ruin and recreate principle
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A guide to vehicle routing heuristics
• An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: A large neighbourhood based heuristic for two-echelon routing problems