The continuous pollution routing problem
DOI10.1016/J.AMC.2020.125072zbMATH Open1472.90017OpenAlexW3005489823MaRDI QIDQ2660100FDOQ2660100
Authors: Xiaorong Zuo, Jiaoying Huang, Abdullah Konak, Yuchun Xu, Yi-Yong Xiao 
Publication date: 29 March 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://publications.aston.ac.uk/id/eprint/41202/1/The_continuous_pollution_routing_problem.pdf
Recommendations
- A matheuristic approach for the pollution-routing problem
- The bi-objective pollution-routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- A speed and departure time optimization algorithm for the pollution-routing problem
- Using cost change estimates in a local search heuristic for the pollution routing problem
Convex programming (90C25) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06)
Cites Work
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- Routing vehicles to minimize fuel consumption
- A review of recent research on green road freight transportation
- Energy Minimizing Vehicle Routing Problem
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- A matheuristic approach for the pollution-routing problem
- A speed and departure time optimization algorithm for the pollution-routing problem
- Enhanced Model Formulations for Optimal Facility Layout
- A new mixed integer programming formulation for facility layout design using flexible bays
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Using cost change estimates in a local search heuristic for the pollution routing problem
- A metaheuristic for the time-dependent pollution-routing problem
Cited In (4)
- Using cost change estimates in a local search heuristic for the pollution routing problem
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
- An operator splitting Legendre-tau spectral method for Maxwell's equations with nonlinear conductivity in two dimensions
- The bi-objective pollution-routing problem
This page was built for publication: The continuous pollution routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2660100)
