Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery
From MaRDI portal
Publication:6070418
DOI10.1111/itor.12796OpenAlexW3015958418MaRDI QIDQ6070418
Unnamed Author, Patrick Hirsch, Angel A. Juan
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12796
disaster managementtwo-echelon vehicle routing problemagile optimizationbiased-randomized algorithms
Related Items (6)
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery ⋮ Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ A multi-objective humanitarian pickup and delivery vehicle routing problem with drones
Cites Work
- A multi-agent based cooperative approach to scheduling and routing
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- The vehicle routing problem with drones: several worst-case results
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A comparative study of heuristics for a two-level routing-location problem
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- The electric two-echelon vehicle routing problem
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- The ALGACEA‐1 method for the capacitated vehicle routing problem
- The vehicle routing problem with drones: Extended models and connections
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
This page was built for publication: Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery