A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
From MaRDI portal
Publication:2165264
DOI10.1007/s10878-022-00870-1zbMath1497.90191MaRDI QIDQ2165264
Issam Nouaouri, Hajer Ben-Romdhane, Nasreddine Ouertani, Saoussen Krichen
Publication date: 19 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00870-1
multi-objective optimization; local search; dynamic optimization problem; exploration-exploitation trade-off; pollution routing problem; vector evaluated GA
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- A matheuristic approach for the pollution-routing problem
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
- Vehicle routing to minimize time-dependent emissions in urban areas
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- A metaheuristic for the time-dependent pollution-routing problem
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Dynamic vehicle routing: Status and prospects
- A dynamic multi-objective optimization model with interactivity and uncertainty for real-time reservoir flood control operation
- Carbon pricing initiatives-based bi-level pollution routing problem
- A review of dynamic vehicle routing problems
- The bi-objective pollution-routing problem
- Dynamic vehicle routing with time windows in theory and practice
- The continuous pollution routing problem
- Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Recent Developments in Dynamic Vehicle Routing Systems
- Dynamic programming based metaheuristics for the dial-a-ride problem
