作者: Víctor Yepes , Josep Medina
DOI: 10.1061/(ASCE)0733-947X(2006)132:4(303)
关键词:
摘要: A three-step local search algorithm based on a probabilistic variable neighborhood is presented for the vehicle routing problem with heterogeneous fleet of vehicles and soft time windows (VRPHESTW). generation mechanism greedy randomized adaptive procedure, diversification procedure using an extinctive selection evolution strategy, postoptimization method threshold restarts are considered to solve problem. The results show convenience economic objective function analyze influence changes in environment transportation average profit problems. Near real-world problems need (1) measure quality solutions as well (2) appropriate guide function, which may be different from each heuristic scenario.