Research output: Contribution to conference - Without ISBN/ISSN › Abstract › peer-review
Research output: Contribution to conference - Without ISBN/ISSN › Abstract › peer-review
}
TY - CONF
T1 - Solving the time-and-load dependent green vehicle routing and scheduling problem on real road networks
AU - Raeesi, Ramin
AU - Zografos, Konstantinos
PY - 2016/6/6
Y1 - 2016/6/6
N2 - The Green Vehicle Routing and Scheduling Problem (GVRSP) has drawn considerable research attention, due to its capability to address the trade-off between traditional business and environmental objectives. Most of the existing models consider the problem on a complete graph composed of the depot and the customers. However, time and load dependent problems are not always possible to be modelled over a complete graph, since the departure times and carried loads between nodes are not known in advance. This paper formulatesthe GVRSP as a bi-objective time-and-load-dependent optimisation model and proposes an algorithm for solving it on a real road network. A network reduction technique to reduce the number of eligible paths between the network nodes, and an algorithm for departure time optimisation that can be embedded into different local search-based meta-heuristics are proposed. We are presenting results of computational experiments to demonstrate the efficiency of the proposed methodology.
AB - The Green Vehicle Routing and Scheduling Problem (GVRSP) has drawn considerable research attention, due to its capability to address the trade-off between traditional business and environmental objectives. Most of the existing models consider the problem on a complete graph composed of the depot and the customers. However, time and load dependent problems are not always possible to be modelled over a complete graph, since the departure times and carried loads between nodes are not known in advance. This paper formulatesthe GVRSP as a bi-objective time-and-load-dependent optimisation model and proposes an algorithm for solving it on a real road network. A network reduction technique to reduce the number of eligible paths between the network nodes, and an algorithm for departure time optimisation that can be embedded into different local search-based meta-heuristics are proposed. We are presenting results of computational experiments to demonstrate the efficiency of the proposed methodology.
UR - https://verolog2016.sciencesconf.org/93000/document
M3 - Abstract
T2 - VeRoLog 2016
Y2 - 6 June 2016 through 8 June 2016
ER -