表紙画像

A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem

The vehicle routing problem (YRP) under distance and capacity constraints involves the design of a set of delivery routes which originate and terminate at a central depot after satisfying the customer demands . Each customer must be served exactly once and by one vehicle, where vehicle capacity and...

詳細記述

保存先:
書誌詳細
主要な著者: Chai, Jin Sian, Johar, Farhana
フォーマット: Conference or Workshop Item
言語:English
出版事項: 2015
主題:
TJ Mechanical engineering and machinery
オンライン･アクセス:http://eprints.utm.my/id/eprint/61596/1/FarhanaJohar2015_AFarthestInsertionHeuristicAlgorithmfortheDistance-Constrained.pdf
http://eprints.utm.my/id/eprint/61596/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.utm.61596
record_format eprints
spelling my.utm.615962017-08-08T03:46:46Z http://eprints.utm.my/id/eprint/61596/ A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem Chai, Jin Sian Johar, Farhana TJ Mechanical engineering and machinery The vehicle routing problem (YRP) under distance and capacity constraints involves the design of a set of delivery routes which originate and terminate at a central depot after satisfying the customer demands . Each customer must be served exactly once and by one vehicle, where vehicle capacity and distance limit become the constraints of the problem. In this study of Distance-Constrained Capacitated Vehicle Routing Problem (DCYRP), farthest insertion method is used to construct an initial solution. The method focuses on choosing the farthest customer from the route and then inserts the selected customer into the nearest path which will give the smallest increment of length without violating the distance and capacity constraints. C++ numerical programming is used to code the approach algorithm in order to solve DCYRP which involves large groups of data . Three categorie s of data which are cluster, random and random cluster data are being analyzed by considering different amount of distance and capacity constraints. By utilizing the farthest insert ion method , the number of routes participated and the total distance travelled by the vehicles can be obtained. Based on the computational results acquired, the increasing of the amount of capacity and distance constraints will reduce the number of routes formed as well as the total distance travelled. 2015 Conference or Workshop Item PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/61596/1/FarhanaJohar2015_AFarthestInsertionHeuristicAlgorithmfortheDistance-Constrained.pdf Chai, Jin Sian and Johar, Farhana (2015) A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem. In: Undergraduate Project Symposium Department of Mathematical Sciences (Semester II, Session 2014/2015), 22-23 June, 2015, Johor Bahru, Johor.
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic TJ Mechanical engineering and machinery
spellingShingle TJ Mechanical engineering and machinery
Chai, Jin Sian
Johar, Farhana
A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
description The vehicle routing problem (YRP) under distance and capacity constraints involves the design of a set of delivery routes which originate and terminate at a central depot after satisfying the customer demands . Each customer must be served exactly once and by one vehicle, where vehicle capacity and distance limit become the constraints of the problem. In this study of Distance-Constrained Capacitated Vehicle Routing Problem (DCYRP), farthest insertion method is used to construct an initial solution. The method focuses on choosing the farthest customer from the route and then inserts the selected customer into the nearest path which will give the smallest increment of length without violating the distance and capacity constraints. C++ numerical programming is used to code the approach algorithm in order to solve DCYRP which involves large groups of data . Three categorie s of data which are cluster, random and random cluster data are being analyzed by considering different amount of distance and capacity constraints. By utilizing the farthest insert ion method , the number of routes participated and the total distance travelled by the vehicles can be obtained. Based on the computational results acquired, the increasing of the amount of capacity and distance constraints will reduce the number of routes formed as well as the total distance travelled.
format Conference or Workshop Item
author Chai, Jin Sian
Johar, Farhana
author_facet Chai, Jin Sian
Johar, Farhana
author_sort Chai, Jin Sian
title A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
title_short A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
title_full A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
title_fullStr A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
title_full_unstemmed A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
title_sort farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
publishDate 2015
url http://eprints.utm.my/id/eprint/61596/1/FarhanaJohar2015_AFarthestInsertionHeuristicAlgorithmfortheDistance-Constrained.pdf
http://eprints.utm.my/id/eprint/61596/
_version_ 1643655213855277056
score 13.251813

類似資料