Show simple item record

contributor authorVíctor Yepes
contributor authorJosep Medina
date accessioned2017-05-08T21:04:48Z
date available2017-05-08T21:04:48Z
date copyrightApril 2006
date issued2006
identifier other%28asce%290733-947x%282006%29132%3A4%28303%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/37865
description abstractA three-step local search algorithm based on a probabilistic variable neighborhood search is presented for the vehicle routing problem with a heterogeneous fleet of vehicles and soft time windows (VRPHESTW). A generation mechanism based on a greedy randomized adaptive search procedure, a diversification procedure using an extinctive selection evolution strategy, and a postoptimization method based on a threshold algorithm with restarts are considered to solve the problem. The results show the convenience of using an economic objective function to analyze the influence of the changes in the economic environment on the transportation average profit of vehicle routing problems. Near real-world vehicle routing problems need (1) an economic objective function to measure the quality of the solutions as well as (2) an appropriate guide function, which may be different from the economic objective function, for each heuristic method and for each economic scenario.
publisherAmerican Society of Civil Engineers
titleEconomic Heuristic Optimization for Heterogeneous Fleet VRPHESTW
typeJournal Paper
journal volume132
journal issue4
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)0733-947X(2006)132:4(303)
treeJournal of Transportation Engineering, Part A: Systems:;2006:;Volume ( 132 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record