A speed and departure time optimization algorithm for the pollution-routing problem
DOI10.1016/J.EJOR.2015.06.037zbMATH Open1346.90142arXiv1501.05354OpenAlexW1679416201MaRDI QIDQ320086FDOQ320086
Authors: Raphael Kramer, A. Subramanian, T. Vidal, Nelson Maculan
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05354
Recommendations
- A metaheuristic for the time-dependent pollution-routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- A matheuristic approach for the pollution-routing problem
- The bi-objective pollution-routing problem
- Using cost change estimates in a local search heuristic for the pollution routing problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (20)
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
- Using cost change estimates in a local search heuristic for the pollution routing problem
- The green location-routing problem
- A metaheuristic for the time-dependent pollution-routing problem
- A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem
- The role of operational research in green freight transportation
- An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem
- A Joint Vehicle Routing and Speed Optimization Problem
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- The green mixed fleet vehicle routing problem with partial battery recharging and time windows
- Carbon pricing initiatives-based bi-level pollution routing problem
- A matheuristic approach for the pollution-routing problem
- Sustainable operations
- Optimization of vehicle speed for batches to minimize supply chain cost under uncertain demand
- Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- The continuous pollution routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- Fuel-optimal truck path and speed profile in dynamic conditions: an exact algorithm
This page was built for publication: A speed and departure time optimization algorithm for the pollution-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320086)