An ant colony system for responsive dynamic vehicle routing
From MaRDI portal
Publication:319660
DOI10.1016/j.ejor.2015.04.009zbMath1346.90829OpenAlexW2017268736MaRDI QIDQ319660
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://orbi.uliege.be/handle/2268/167478
Continuous location (90B85) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Eidetic wolf search algorithm with a global memory structure ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery ⋮ Two-stage optimization of airport ferry service delay considering flight uncertainty ⋮ A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem ⋮ Dynamic courier routing for a food delivery service ⋮ Emergency relief routing models for injured victims considering equity and priority ⋮ Dynamic path optimization in sharing mode to relieve urban traffic congestion
Uses Software
Cites Work
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A column generation approach to the heterogeneous fleet vehicle routing problem
- Dynamic pickup and delivery problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- Vehicle routing with split deliveries
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- An improved ant colony optimization for vehicle routing problem
- Time dependent vehicle routing problem with a multi ant colony system
- Ant colony system for a dynamic vehicle routing problem
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
- The period routing problem
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Vehicle routing problems with split deliveries
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Vehicle Routing Problem with Time Windows
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles
This page was built for publication: An ant colony system for responsive dynamic vehicle routing
