Solving the time-and-load dependent green vehicle routing and scheduling problem on real road networks

Raeesi, Ramin and Zografos, Konstantinos (2016) Solving the time-and-load dependent green vehicle routing and scheduling problem on real road networks. In: VeRoLog 2016, 2016-06-062016-06-08, Mines Nantes engineering school.

Full text not available from this repository.

Abstract

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 formulates the 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.

Item Type:
Contribution to Conference (Other)
Journal or Publication Title:
VeRoLog 2016
ID Code:
88446
Deposited By:
Deposited On:
27 Oct 2017 07:56
Refereed?:
Yes
Published?:
Published
Last Modified:
23 Oct 2020 00:38