Models and algorithms for the pollution-routing problem and its variations

摘要: This thesis is positioned within the field of green logistics with respect to CO2 emissions in road freight transportation. In order examine different aspects transportation, three related, but research questions are studied. Because proportional amount fuel consumed by vehicles, first goal review and compare several available emission models. The results extensive computational experiments show that all models tested sensitive changes load, speed acceleration. Second, dissertation studies Pollution-Routing Problem (PRP), an extension classical Vehicle Routing Time Windows (VRPTW). PRP consists routing a number vehicles serve set customers preset time windows, determining their on each route segment, so as minimise function comprising fuel, driver costs. A mathematical formulation this problem cannot be solved optimality for medium large scale instances. For reason, describes adaptive neighbourhood search (ALNS) based algorithm solve PRP. iterates between VRPTW optimisation problem, where former through enhanced ALNS latter using polynomial (SOA). third question relates two important objectives should taken into account, namely minimisation consumption total driving time. Computational instances both effective efficient solving up 200 nodes. therefore bi-objective one related environment, (hence emissions), other An described integrates scheme specialized SOA. need not compromise greatly terms achieve significant reduction emissions.