An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics

DOI10.1016/J.COR.2012.04.007zbMATH Open1349.90858OpenAlexW2146004814WikidataQ41643170 ScholiaQ41643170MaRDI QIDQ339671FDOQ339671

Teodor Gabriel Crainic, V. C. Hemmelmayr, Jean-François Cordeau

Publication date: 11 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.007

Recommendations

• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
• A large neighbourhood based heuristic for two-echelon routing problems
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• A variable neighborhood search approach for the two-echelon location-routing problem
• Lower and upper bounds for the two-echelon capacitated location-routing problem

zbMATH Keywords

city logisticslocation routing problemadaptive large neighborhood search heuristictwo-echelon vehicle routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• A Method for Solving Traveling-Salesman Problems
• A simple and effective evolutionary algorithm for the vehicle routing problem
• An exact method for the capacitated location-routing problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Location-routing: issues, models and methods
• A general heuristic for vehicle routing problems
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A two-phase tabu search approach to the location routing problem
• A comparative study of heuristics for a two-level routing-location problem
• Title not available (Why is that?)
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• New families of valid inequalities for the two-echelon vehicle routing problem

Cited In (98)

• A heuristic approach for a real-world electric vehicle routing problem
• A metaheuristic for the time-dependent pollution-routing problem
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
• Integrating order delivery and return operations for order fulfillment in an online retail environment
• A set covering based matheuristic for a real‐world city logistics problem
• A survey of recent research on location-routing problems
• A two-echelon inventory routing problem for perishable products
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• Models and algorithms for the delivery and installation routing problem
• The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
• A general framework for assessing the value of social data for disaster response logistics planning
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
• A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
• Asynchronous optimization of part logistics routing problem
• A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
• Two-echelon vehicle routing problem with satellite bi-synchronization
• Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics
• Solving the vehicle routing problem with multi-compartment vehicles for city logistics
• Two-echelon vehicle routing problems: a literature review
• Decomposition based hybrid metaheuristics
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
• Multi-period vehicle routing problem with due dates
• The two-echelon stochastic multi-period capacitated location-routing problem
• Synchronizing vans and cargo bikes in a city distribution network
• A survey of the standard location-routing problem
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
• Scheduling identical parallel machines with tooling constraints
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• The multi-pickup and delivery problem with time windows
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls
• A survey on two-echelon routing problems
• Battery swap station location-routing problem with capacitated electric vehicles
• A large neighbourhood based heuristic for two-echelon routing problems
• A bi-level model and memetic algorithm for arc interdiction location-routing problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A hybrid algorithm for time-dependent vehicle routing problem with time windows
• An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization
• A survey of adaptive large neighborhood search algorithms and applications
• Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
• A hybrid method for the probabilistic maximal covering location-allocation problem
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
• The vehicle routing problem with load-dependent travel times for cargo bicycles
• A location-or-routing problem with partial and decaying coverage
• Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
• The electric two-echelon vehicle routing problem
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
• A column generation approach for location-routing problems with pickup and delivery
• Designing a multi-modal and variable-echelon delivery system for last-mile logistics
• Service network design models for two-tier city logistics
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
• A survey of variants and extensions of the location-routing problem
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
• A two-stage stochastic location-routing problem for electric vehicles fast charging
• Solving the probabilistic drone routing problem: searching for victims in the aftermath of disasters
• Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
• Optimizing combined tours: the truck-and-cargo-bike case
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective
• An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
• Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person
• Drone location and vehicle fleet planning with trucks and aerial drones
• Integrating micro-depot freight transport in existing public transport services
• A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
• The vehicle routing problem with heterogeneous locker boxes
• Small and large neighborhood search for the park-and-loop routing problem with parking selection
• A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems
• Distance-based adaptive large neighborhood search algorithm for green-PDPTW
• A waste collection problem with service type option
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach
• The traveling purchaser problem with fast service option
• A large neighbourhood search metaheuristic for the contagious disease testing problem
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
• Routing electric vehicles with a single recharge per route
• A conceptually simple algorithm for the capacitated location-routing problem
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services
• Electric vehicles fast charger location-routing problem under ambient temperature
• Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
• A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
• Scheduled service network design with resource management for two-tier multimodal city logistics

This page was built for publication: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339671)