A voronoi-based genetic algorithm for waste collection vehicle routing problem

Mehrad Bastani, Aristotelis E. Thanos, Gregory Collins, Nurcin Celik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we present a genetic optimization algorithm embedding a Voronoi diagram to address the vehicle routing problem in waste collection. The proposed approach seeks to determine a set of delivery routes for the waste collection vehicles starting from the origin (the hauler's service center), leading to the generation nodes, picking up and transferring wastes to the treatment or disposal facilities, and finally, returning to the origin in a way which would minimize the total distance covered by the entire fleet. Furthermore, generation units are clustered into groups, for an easier and more convenient routing design of collection vehicles. Once a collection vehicle crosses an intersection of roads, it is obliged to continue and collect from the generation units it encounters in the next intersection. This fact gives the opportunity for clustering all the generation units of the same street between two consecutive intersections. In order to assign all generation units to the generation points in the most efficient manner, a Voronoi diagram is utilized to divide spaces into a number of regions called Voronoi cells. Lastly, an efficient combination of variables is determined through an embedded genetic optimization mechanism which starts with the initial population of candidate solutions subject to the overall time, capacity, and operational constraints.

Original languageEnglish (US)
Title of host publicationIIE Annual Conference and Expo 2015
PublisherInstitute of Industrial Engineers
Pages623-632
Number of pages10
ISBN (Electronic)9780983762447
StatePublished - 2015
EventIIE Annual Conference and Expo 2015 - Nashville, United States
Duration: May 30 2015Jun 2 2015

Other

OtherIIE Annual Conference and Expo 2015
CountryUnited States
CityNashville
Period5/30/156/2/15

Fingerprint

Vehicle routing
Genetic algorithms
Waste disposal

Keywords

  • Meta-heuristics
  • Route optimization
  • Solid waste management and optimization

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Cite this

Bastani, M., Thanos, A. E., Collins, G., & Celik, N. (2015). A voronoi-based genetic algorithm for waste collection vehicle routing problem. In IIE Annual Conference and Expo 2015 (pp. 623-632). Institute of Industrial Engineers.

A voronoi-based genetic algorithm for waste collection vehicle routing problem. / Bastani, Mehrad; Thanos, Aristotelis E.; Collins, Gregory; Celik, Nurcin.

IIE Annual Conference and Expo 2015. Institute of Industrial Engineers, 2015. p. 623-632.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bastani, M, Thanos, AE, Collins, G & Celik, N 2015, A voronoi-based genetic algorithm for waste collection vehicle routing problem. in IIE Annual Conference and Expo 2015. Institute of Industrial Engineers, pp. 623-632, IIE Annual Conference and Expo 2015, Nashville, United States, 5/30/15.
Bastani M, Thanos AE, Collins G, Celik N. A voronoi-based genetic algorithm for waste collection vehicle routing problem. In IIE Annual Conference and Expo 2015. Institute of Industrial Engineers. 2015. p. 623-632
Bastani, Mehrad ; Thanos, Aristotelis E. ; Collins, Gregory ; Celik, Nurcin. / A voronoi-based genetic algorithm for waste collection vehicle routing problem. IIE Annual Conference and Expo 2015. Institute of Industrial Engineers, 2015. pp. 623-632
@inproceedings{8be0feb9d3f84250aed1f14c284e2560,
title = "A voronoi-based genetic algorithm for waste collection vehicle routing problem",
abstract = "In this paper, we present a genetic optimization algorithm embedding a Voronoi diagram to address the vehicle routing problem in waste collection. The proposed approach seeks to determine a set of delivery routes for the waste collection vehicles starting from the origin (the hauler's service center), leading to the generation nodes, picking up and transferring wastes to the treatment or disposal facilities, and finally, returning to the origin in a way which would minimize the total distance covered by the entire fleet. Furthermore, generation units are clustered into groups, for an easier and more convenient routing design of collection vehicles. Once a collection vehicle crosses an intersection of roads, it is obliged to continue and collect from the generation units it encounters in the next intersection. This fact gives the opportunity for clustering all the generation units of the same street between two consecutive intersections. In order to assign all generation units to the generation points in the most efficient manner, a Voronoi diagram is utilized to divide spaces into a number of regions called Voronoi cells. Lastly, an efficient combination of variables is determined through an embedded genetic optimization mechanism which starts with the initial population of candidate solutions subject to the overall time, capacity, and operational constraints.",
keywords = "Meta-heuristics, Route optimization, Solid waste management and optimization",
author = "Mehrad Bastani and Thanos, {Aristotelis E.} and Gregory Collins and Nurcin Celik",
year = "2015",
language = "English (US)",
pages = "623--632",
booktitle = "IIE Annual Conference and Expo 2015",
publisher = "Institute of Industrial Engineers",

}

TY - GEN

T1 - A voronoi-based genetic algorithm for waste collection vehicle routing problem

AU - Bastani, Mehrad

AU - Thanos, Aristotelis E.

AU - Collins, Gregory

AU - Celik, Nurcin

PY - 2015

Y1 - 2015

N2 - In this paper, we present a genetic optimization algorithm embedding a Voronoi diagram to address the vehicle routing problem in waste collection. The proposed approach seeks to determine a set of delivery routes for the waste collection vehicles starting from the origin (the hauler's service center), leading to the generation nodes, picking up and transferring wastes to the treatment or disposal facilities, and finally, returning to the origin in a way which would minimize the total distance covered by the entire fleet. Furthermore, generation units are clustered into groups, for an easier and more convenient routing design of collection vehicles. Once a collection vehicle crosses an intersection of roads, it is obliged to continue and collect from the generation units it encounters in the next intersection. This fact gives the opportunity for clustering all the generation units of the same street between two consecutive intersections. In order to assign all generation units to the generation points in the most efficient manner, a Voronoi diagram is utilized to divide spaces into a number of regions called Voronoi cells. Lastly, an efficient combination of variables is determined through an embedded genetic optimization mechanism which starts with the initial population of candidate solutions subject to the overall time, capacity, and operational constraints.

AB - In this paper, we present a genetic optimization algorithm embedding a Voronoi diagram to address the vehicle routing problem in waste collection. The proposed approach seeks to determine a set of delivery routes for the waste collection vehicles starting from the origin (the hauler's service center), leading to the generation nodes, picking up and transferring wastes to the treatment or disposal facilities, and finally, returning to the origin in a way which would minimize the total distance covered by the entire fleet. Furthermore, generation units are clustered into groups, for an easier and more convenient routing design of collection vehicles. Once a collection vehicle crosses an intersection of roads, it is obliged to continue and collect from the generation units it encounters in the next intersection. This fact gives the opportunity for clustering all the generation units of the same street between two consecutive intersections. In order to assign all generation units to the generation points in the most efficient manner, a Voronoi diagram is utilized to divide spaces into a number of regions called Voronoi cells. Lastly, an efficient combination of variables is determined through an embedded genetic optimization mechanism which starts with the initial population of candidate solutions subject to the overall time, capacity, and operational constraints.

KW - Meta-heuristics

KW - Route optimization

KW - Solid waste management and optimization

UR - http://www.scopus.com/inward/record.url?scp=84971016419&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84971016419&partnerID=8YFLogxK

M3 - Conference contribution

SP - 623

EP - 632

BT - IIE Annual Conference and Expo 2015

PB - Institute of Industrial Engineers

ER -