Eco-routing problem for the delivery of perishable products
From MaRDI portal
Publication:6109571
DOI10.1016/j.cor.2023.106198MaRDI QIDQ6109571
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Optimal joint replenishment, delivery and inventory management policies for perishable products
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
- Delivery strategies for blood products supplies
- Production scheduling and vehicle routing with time windows for perishable food products
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
- A two-echelon inventory routing problem for perishable products
- A metaheuristic for the time-dependent pollution-routing problem
- Route and speed optimization for autonomous trucks
- Competitive food supply chain networks with application to fresh produce
- The bi-objective pollution-routing problem
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
This page was built for publication: Eco-routing problem for the delivery of perishable products