Green vehicle routing problem with heterogeneous fleet and time windows

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)

Abstract

The problem considered in this paper is to construct several routes and schedules of fleets that minimize the emission of a network consists of customers as nodes and their connection one to another by arcs, while varying the types of fleets and tightening the time windows. In the constructed models, the route of each fleet will be produced and treated as decision variable. The routes themselves depend on the capacity of each vehicle type and time windows constraints on each route. The objective of this paper is to construct routes of heterogeneous fleet problem with time windows with minimum emission, CO2eq in this context. A hybrid algorithm is used to construct the route. This algorithm is then validated using real demand historical data of a market in London. The result from model then used to analyze the differences which created by the algorithm and translated into a group of routes to be used.

Original languageEnglish
Title of host publicationProceedings of 2017 6th International Conference on Software and Computer Applications, ICSCA 2017
PublisherAssociation for Computing Machinery
Pages223-227
Number of pages5
ISBN (Electronic)9781450348577
DOIs
Publication statusPublished - 26 Feb 2017
Event6th International Conference on Software and Computer Applications, ICSCA 2017 - Bangkok, Thailand
Duration: 26 Feb 201728 Feb 2017

Publication series

NameACM International Conference Proceeding Series

Conference

Conference6th International Conference on Software and Computer Applications, ICSCA 2017
Country/TerritoryThailand
CityBangkok
Period26/02/1728/02/17

Keywords

  • Fuel emission optimization
  • Green vehicle routing problem
  • Tabu search algorithm
  • Transportation

Fingerprint

Dive into the research topics of 'Green vehicle routing problem with heterogeneous fleet and time windows'. Together they form a unique fingerprint.

Cite this