| dc.description.abstract | Since!the!vehicle!routing!problem!with!time!window!(VRPTW)!is!a!multiconstraint
and!combinatorial!optimization!problem,!this!study!proposes!a!Genetic!Algorithm!-
based!routing!arrangement!on!the!basis!of!customer!clustering,!thereby!reducing!the
processing!time!and!the!operating!costs!in!the!logistics!network.!Moreover,!this!study
propose!a!hybrid!genetic!algorithm!to!solve!a!3D!Bin!Packing!problem,!by!optimizing!
the!utilized!volume,!the!number,!and!total!value!of!the!contained!boxes.!Within!the
framework!of!the!proposed!algorithm,!a!special!diploid!representation!scheme!of
individual!is!used!and!a!modified!heuristic!packing!method,!derived!from!the!deepest
bottom!left!with!fill!(DBLF)!packing!method,!is!employed!to!realize!a!3D!packing!of
the!boxes.!
Finally,!a!real!case!study!of!a!transportation!company!in!Vietnam!is!employed!to!verify
the!efficiency!of!the!proposed!model!and!optimization!algorithm,!after!which!a
comparison!of!the!Genetic-based!results!and!the!exact!method demonstrates the
efficiency and adaptability of!the!proposed!method!to!address!the Vehicle Routing!with
Time!Window and the!3D!Bin!Packing!Problem! | en_US |
