Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem

This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC).Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel...

Full description

Saved in:
Bibliographic Details
Main Authors: Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza
Format: Article
Language:English
Published: Universiti Utara Malaysia 2018
Subjects:
Online Access:http://repo.uum.edu.my/24429/1/JICT%20%2017%201%20%202018%2055-78.pdf
http://repo.uum.edu.my/24429/
http://jict.uum.edu.my/index.php/previous-issues/153-vol17no12018#A4
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.24429
record_format eprints
spelling my.uum.repo.244292018-07-23T01:12:14Z http://repo.uum.edu.my/24429/ Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem Mat, Nur Azriati Benjamin, Aida Mauziah Abdul-Rahman, Syariza QA75 Electronic computers. Computer science This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC).Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. This problem is referred to as Time-Dependent Vehicle Routing Problem (TD-VRP) in previous literature.The benchmark problem consisted of ten sub problems, involving up to 2092 customers.Previous studies solved the benchmark problem using DIC and CIS algorithms with the assumption that the vehicles are travelling with a static speed when collecting the waste.However, in this paper the static speed that was considered in both algorithms were improved by introducing dynamic travel speeds to construct vehicle routes for the waste collection drivers. Compared to previous studies the enhanced CIS and DIC with dynamic travel speeds affected the waste collection problem in terms of the number of vehicles used, the total distance travelled and the total travel time.However, different settings of speed may give different impacts to the solution.The study reveals that with a setting of dynamic speed between 40 mph and 55 mph, DIC is able to reduce two vehicles (from 98 to 96 number of vehicles used), 7.85% of total distance travelled, and 19.10% of total travel time. Universiti Utara Malaysia 2018 Article PeerReviewed application/pdf en http://repo.uum.edu.my/24429/1/JICT%20%2017%201%20%202018%2055-78.pdf Mat, Nur Azriati and Benjamin, Aida Mauziah and Abdul-Rahman, Syariza (2018) Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem. Journal of Information and Communication Technology (JICT), 17 (1). pp. 55-78. ISSN 1675-414X http://jict.uum.edu.my/index.php/previous-issues/153-vol17no12018#A4
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutionali Repository
url_provider http://repo.uum.edu.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Mat, Nur Azriati
Benjamin, Aida Mauziah
Abdul-Rahman, Syariza
Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
description This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC).Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. This problem is referred to as Time-Dependent Vehicle Routing Problem (TD-VRP) in previous literature.The benchmark problem consisted of ten sub problems, involving up to 2092 customers.Previous studies solved the benchmark problem using DIC and CIS algorithms with the assumption that the vehicles are travelling with a static speed when collecting the waste.However, in this paper the static speed that was considered in both algorithms were improved by introducing dynamic travel speeds to construct vehicle routes for the waste collection drivers. Compared to previous studies the enhanced CIS and DIC with dynamic travel speeds affected the waste collection problem in terms of the number of vehicles used, the total distance travelled and the total travel time.However, different settings of speed may give different impacts to the solution.The study reveals that with a setting of dynamic speed between 40 mph and 55 mph, DIC is able to reduce two vehicles (from 98 to 96 number of vehicles used), 7.85% of total distance travelled, and 19.10% of total travel time.
format Article
author Mat, Nur Azriati
Benjamin, Aida Mauziah
Abdul-Rahman, Syariza
author_facet Mat, Nur Azriati
Benjamin, Aida Mauziah
Abdul-Rahman, Syariza
author_sort Mat, Nur Azriati
title Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
title_short Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
title_full Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
title_fullStr Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
title_full_unstemmed Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
title_sort enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: a waste collection problem
publisher Universiti Utara Malaysia
publishDate 2018
url http://repo.uum.edu.my/24429/1/JICT%20%2017%201%20%202018%2055-78.pdf
http://repo.uum.edu.my/24429/
http://jict.uum.edu.my/index.php/previous-issues/153-vol17no12018#A4
_version_ 1644284052611530752
score 13.211869