An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
From MaRDI portal
Publication:339671
DOI10.1016/j.cor.2012.04.007zbMath1349.90858OpenAlexW2146004814WikidataQ41643170 ScholiaQ41643170MaRDI QIDQ339671
Teodor Gabriel Crainic, Vera 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
city logisticslocation routing problemadaptive large neighborhood search heuristictwo-echelon vehicle routing problem
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Asynchronous optimization of part logistics routing problem, An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, A survey of recent research on location-routing problems, Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers, A survey of variants and extensions of the location-routing problem, The electric two-echelon vehicle routing problem, A heuristic approach for a real-world electric vehicle routing problem, Sequential and parallel large neighborhood search algorithms for the periodic location routing problem, Decomposition based hybrid metaheuristics, Integrating order delivery and return operations for order fulfillment in an online retail environment, 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, Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex, An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization, A survey on two-echelon routing problems, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Battery swap station location-routing problem with capacitated electric vehicles, A hybrid method for the probabilistic maximal covering location-allocation problem, A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem, Multi-period vehicle routing problem with due dates, A simple and effective evolutionary algorithm for the capacitated location-routing problem, Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches, A large neighbourhood based heuristic for two-echelon routing problems, A waste collection problem with service type option, Synchronizing vans and cargo bikes in a city distribution network, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, A large neighbourhood search metaheuristic for the contagious disease testing problem, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach, Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, The traveling purchaser problem with fast service option, Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction, Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem, 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 survey of adaptive large neighborhood search algorithms and applications, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery, Routing electric vehicles with a single recharge per route, The two-echelon stochastic multi-period capacitated location-routing problem, A two-stage stochastic location-routing problem for electric vehicles fast charging, A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services, Designing a multi-modal and variable-echelon delivery system for last-mile logistics, Small and large neighborhood search for the park-and-loop routing problem with parking selection, 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, Electric vehicles fast charger location-routing problem under ambient temperature, 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 survey of the standard location-routing problem, An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization, A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, Service network design models for two-tier city logistics, A two-echelon inventory routing problem for perishable products, Scheduled service network design with resource management for two-tier multimodal city logistics, Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm, The multi-pickup and delivery problem with time windows, A bi-level model and memetic algorithm for arc interdiction location-routing problem, A column generation approach for location-routing problems with pickup and delivery, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology, A general framework for assessing the value of social data for disaster response logistics planning, A metaheuristic for the time-dependent pollution-routing problem, Scheduling identical parallel machines with tooling constraints, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic, A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach, A hybrid algorithm for time-dependent vehicle routing problem with time windows, 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, Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics, Models and algorithms for the delivery and installation routing problem, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, The vehicle routing problem with heterogeneous locker boxes, Solving the vehicle routing problem with multi-compartment vehicles for city logistics, Distance-based adaptive large neighborhood search algorithm for green-PDPTW, Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions, Two-echelon vehicle routing problems: a literature review, A set covering based matheuristic for a real‐world city logistics problem, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, A location-or-routing problem with partial and decaying coverage, The vehicle routing problem with load-dependent travel times for cargo bicycles, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Cites Work
- Unnamed Item
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A general heuristic for vehicle routing problems
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A comparative study of heuristics for a two-level routing-location problem
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- An Exact Method for the Capacitated Location-Routing Problem
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- A Method for Solving Traveling-Salesman Problems
