| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10322467 | Expert Systems with Applications | 2012 | 10 Pages |
Abstract
⺠Vehicle routing problem (VRP) incorporating forced backhauls, routing cost minimisation and minimisation of span of travel tour is considered. ⺠Extended variant termed as bi-objective vehicle routing problem with forced backhauls (BVFB). ⺠Three heuristics for BVFB are: modified savings heuristic with arc removal procedure, with node swap procedure and adapted genetic algorithms. ⺠Randomly generated data-sets of BVFB and nine real-life cases of BVFB are considered. ⺠It is evident from the results that GA promises to be a useful tool for solving BVFB.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
S.P. Anbuudayasankar, K. Ganesh, S.C. Lenny Koh, Yves Ducq,