An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
From MaRDI portal
(Redirected from Publication:339671)
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
Cites work
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A comparative study of heuristics for a two-level routing-location problem
- A general heuristic for vehicle routing problems
- A method for solving traveling-salesman problems
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A two-phase tabu search approach to the location routing problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact method for the capacitated location-routing problem
- Location-routing: issues, models and methods
- New families of valid inequalities for the two-echelon vehicle routing problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
Cited in
(only showing first 100 items - show all)- A heuristic approach for a real-world electric vehicle routing problem
- Asynchronous optimization of part logistics routing problem
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- 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
- Models and algorithms for the delivery and installation routing problem
- Scheduling identical parallel machines with tooling constraints
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- The electric two-echelon vehicle routing problem
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- A survey of recent research on location-routing problems
- The vehicle routing problem with load-dependent travel times for cargo bicycles
- A location-or-routing problem with partial and decaying coverage
- The two-echelon stochastic multi-period capacitated location-routing problem
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- Two-echelon vehicle routing problems: a literature review
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Synchronizing vans and cargo bikes in a city distribution network
- 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
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- A metaheuristic for the time-dependent pollution-routing problem
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- Integrating order delivery and return operations for order fulfillment in an online retail environment
- Designing a multi-modal and variable-echelon delivery system for last-mile logistics
- A set covering based matheuristic for a real-world city logistics problem
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- Decomposition based hybrid metaheuristics
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- A survey of the standard location-routing problem
- 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
- A survey of adaptive large neighborhood search algorithms and applications
- The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A two-echelon inventory routing problem for perishable products
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Service network design models for two-tier city logistics
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- A hybrid method for the probabilistic maximal covering location-allocation problem
- Multi-period vehicle routing problem with due dates
- 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 column generation approach for location-routing problems with pickup and delivery
- A general framework for assessing the value of social data for disaster response logistics planning
- A variable neighborhood search approach for the two-echelon location-routing problem
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- A large neighbourhood based heuristic for two-echelon routing problems
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- A survey of variants and extensions of the location-routing problem
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
- Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective
- Two-echelon vehicle routing optimization with time window and ``gray zone customers based on LNS algorithm
- An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
- The traveling purchaser problem with fast service option
- 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
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Distance-based adaptive large neighborhood search algorithm for green-PDPTW
- A waste collection problem with service type option
- The vehicle routing problem with heterogeneous locker boxes
- Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery
- Routing electric vehicles with a single recharge per route
- 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
- Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- Optimizing combined tours: the truck-and-cargo-bike case
- 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
- A conceptually simple algorithm for the capacitated location-routing problem
- 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
- A two-stage stochastic location-routing problem for electric vehicles fast charging
- Small and large neighborhood search for the park-and-loop routing problem with parking selection
- Scheduled service network design with resource management for two-tier multimodal city logistics
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services
- A neighborhood search and set cover hybrid heuristic for the two-echelon vehicle routing problem
- A large neighbourhood search metaheuristic for the contagious disease testing problem
- A note on the hierarchical multi-switch multi-echelon vehicle routing problem
- An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- Electric vehicles fast charger location-routing problem under ambient temperature
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- Solving the probabilistic drone routing problem: searching for victims in the aftermath of disasters
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)
