A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem

Fuente: Redalyc
Enregistré dans:
Détails bibliographiques
Auteur principal: Kenan KARAGUL
Format: Artículo científico
Langue:en
Publié: International Journal of Combinatorial Optimization Problems and Informatics 2014
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1876482204579659776
author Kenan KARAGUL
author_facet Kenan KARAGUL
contents A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem Kenan KARAGUL Computación Routing Algorithm Constructive Heuristics Vehicle Routing Problem Ochi’s routing approach Fleet Size a nd Mix Vehicle Routing Problem In this study, a new con structive routing algorithm for fleet size and mix vehicle routing problem is proposed in which residual costs rather than vehicle types are considered for route selection. The algorithm of the proposed routing approach is given and then the solution phas es of a sample problem are shown by using the given algorithm . In order to highlight the performance of the routing approach, Golden’s 12 test problems (Fleet Size and Mix Vehicle Routing Problem with Fixed Cost) are used. It is seen that the proposed meth od has better average time complexity and cost performances than Ochi’s routing approach . Therefore , the solutions of the proposed method that uses vehicle type information are better than those of the methods that use residual cost based on the vehicle t ype information. 2014 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265232977005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.2 Vol.5
format Artículo científico
id redalyc_265232977005
institution Redalyc
language en
publishDate 2014
publisher International Journal of Combinatorial Optimization Problems and Informatics
spellingShingle A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem
Kenan KARAGUL
Computación
Routing Algorithm
Constructive Heuristics
Vehicle Routing Problem
Ochi’s routing approach
Fleet Size a nd Mix Vehicle Routing Problem
A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem Kenan KARAGUL Computación Routing Algorithm Constructive Heuristics Vehicle Routing Problem Ochi’s routing approach Fleet Size a nd Mix Vehicle Routing Problem In this study, a new con structive routing algorithm for fleet size and mix vehicle routing problem is proposed in which residual costs rather than vehicle types are considered for route selection. The algorithm of the proposed routing approach is given and then the solution phas es of a sample problem are shown by using the given algorithm . In order to highlight the performance of the routing approach, Golden’s 12 test problems (Fleet Size and Mix Vehicle Routing Problem with Fixed Cost) are used. It is seen that the proposed meth od has better average time complexity and cost performances than Ochi’s routing approach . Therefore , the solutions of the proposed method that uses vehicle type information are better than those of the methods that use residual cost based on the vehicle t ype information. 2014 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265232977005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.2 Vol.5
title A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem
topic Computación
Routing Algorithm
Constructive Heuristics
Vehicle Routing Problem
Ochi’s routing approach
Fleet Size a nd Mix Vehicle Routing Problem
url https://www.redalyc.org/articulo.oa?id=265232977005