A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
From MaRDI portal
Publication:1681304
DOI10.1016/j.ejor.2017.08.011zbMath1374.90077OpenAlexW2742261706MaRDI QIDQ1681304
Lin Zhou, Daniele Vigo, Roberto Baldacci, Xu Wang
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.011
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Identifying an effective last-mile customer delivery option with an integrated eco-friendly inventory model, A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint, A waste collection problem with service type option, A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, Vehicle routing with private and shared delivery locations, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, A transformation technique for the clustered generalized traveling salesman problem with applications to logistics, The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers, Split demand and deliveries in an integrated three-level lot sizing and replenishment problem, 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, A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method, Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person, Last‐mile delivery with drone and lockers, Flexible two-echelon location routing problem, A generalized bin packing problem for parcel delivery in last-mile logistics, Same-day delivery with pickup stations and autonomous vehicles, 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, The vehicle routing problem with heterogeneous locker boxes, A covering traveling salesman problem with profit in the last mile delivery, Two-echelon vehicle routing problems: a literature review, Crowd-shipping with time windows and transshipment nodes, Simultaneous cooperation of refrigerated ground vehicle (RGV) and unmanned aerial vehicle (UAV) for rapid delivery with perishable food
Uses Software
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- A survey on two-echelon routing problems
- A simulated annealing heuristic for the open location-routing problem
- 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
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Heuristic algorithms for the multi-depot ring-star problem
- A comparative study of heuristics for a two-level routing-location problem
- How to choose ``last mile delivery modes for E-fulfillment
- The bi-objective stochastic covering tour problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- An efficient transformation of the generalized vehicle routing problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
- New mathematical models of the generalized vehicle routing problem and extensions
- Service network design models for two-tier city logistics
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- A survey of variants and extensions of the location-routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
- The Capacitated m-Ring-Star Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
