An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
From MaRDI portal
Publication:323288
DOI10.1016/J.EJOR.2016.03.040zbMATH Open1346.90116OpenAlexW2332834184MaRDI QIDQ323288FDOQ323288
Authors: Philippe Grangier, Michel Gendreau, Fabien Lehuédé, Louis-Martin Rousseau 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.040
Recommendations
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- Two-echelon vehicle routing problem with satellite bi-synchronization
- A large neighbourhood based heuristic for two-echelon routing problems
- Multi-trip pickup and delivery problem with time windows and synchronization
Cites Work
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A general heuristic for vehicle routing problems
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- 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
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- New families of valid inequalities for the two-echelon vehicle routing problem
- Title not available (Why is that?)
- The dial-A-ride problem with transfers
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows
- A survey on two-echelon routing problems
- A large neighbourhood based heuristic for two-echelon routing problems
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- Vehicle Routeing with Multiple Use of Vehicles
Cited In (65)
- A heuristic approach for a real-world electric vehicle routing problem
- Vehicle routing problems with multiple trips
- On the one-to-one pickup-and-delivery problem with time windows and trailers
- A scalable exact algorithm for the vertex \(p\)-center problem
- 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
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A matheuristic for AGV scheduling with battery constraints
- Collaborative urban transportation: recent advances in theory and practice
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
- 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
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Multi-trip pickup and delivery problem with time windows and synchronization
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- 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
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
- Two-echelon vehicle routing problems: a literature review
- A concise guide to existing and emerging vehicle routing problem variants
- Parcel delivery cost minimization with time window constraints using trucks and drones
- Split demand and deliveries in an integrated three-level lot sizing and replenishment problem
- Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Synchronizing vans and cargo bikes in a city distribution network
- Crowd-shipping with time windows and transshipment nodes
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- The multi-pickup and delivery problem with time windows
- A survey on two-echelon routing problems
- Directions for future research on urban mobility and city logistics
- An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization
- The rendezvous vehicle routing problem
- A survey of adaptive large neighborhood search algorithms and applications
- The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints
- Vehicle routing problems with multiple trips
- Two-echelon vehicle routing optimization with time window and ``gray zone customers based on LNS algorithm
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- A location-or-routing problem with partial and decaying coverage
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- Designing a multi-modal and variable-echelon delivery system for last-mile logistics
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
- Optimizing combined tours: the truck-and-cargo-bike case
- Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person
- A neighborhood search and set cover hybrid heuristic for the two-echelon vehicle routing problem
- The grey zone two-echelon vehicle routing problem with customer-to-parcel locations and low-pollution vehicles for inner-city logistics
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services
- A note on the hierarchical multi-switch multi-echelon vehicle routing problem
- 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
This page was built for publication: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323288)
