File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows

TitleA genetic algorithm for vehicle routing problems with stochastic demand and soft time windows
Authors
Issue Date2004
PublisherIEEE.
Citation
2004 Ieee Systems And Information Engineering Design Symposium, 2004, p. 183-190 How to Cite?
AbstractThis paper studies the stochastic vehicle routing problem with soft time windows (SVRPSTW). Vehicles with limited capacity are routed from the central depot to a set of geographically dispersed customers with unknown demands, predefined presence probability and time windows. The late arrival at the customer is allowed by adding a penalty to the objective value. A mathematical model is developed to describe the behavior of this kind of delivery system. A novel age based genetic scheduling algorithm is proposed as an optimization tool to solve this intractable vehicle routing problem in order to minimize the total cost. The effectiveness of the proposed scheduling algorithm is illustrated by using a set of randomly generated numerical examples. The results indicate that the proposed genetic approach is a simple but effective means for solving these problems.
Persistent Identifierhttp://hdl.handle.net/10722/46594
References

 

DC FieldValueLanguage
dc.contributor.authorMak, KLen_HK
dc.contributor.authorGuo, ZGen_HK
dc.date.accessioned2007-10-30T06:53:40Z-
dc.date.available2007-10-30T06:53:40Z-
dc.date.issued2004en_HK
dc.identifier.citation2004 Ieee Systems And Information Engineering Design Symposium, 2004, p. 183-190en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46594-
dc.description.abstractThis paper studies the stochastic vehicle routing problem with soft time windows (SVRPSTW). Vehicles with limited capacity are routed from the central depot to a set of geographically dispersed customers with unknown demands, predefined presence probability and time windows. The late arrival at the customer is allowed by adding a penalty to the objective value. A mathematical model is developed to describe the behavior of this kind of delivery system. A novel age based genetic scheduling algorithm is proposed as an optimization tool to solve this intractable vehicle routing problem in order to minimize the total cost. The effectiveness of the proposed scheduling algorithm is illustrated by using a set of randomly generated numerical examples. The results indicate that the proposed genetic approach is a simple but effective means for solving these problems.en_HK
dc.format.extent354720 bytes-
dc.format.extent2656 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartof2004 IEEE Systems and Information Engineering Design Symposiumen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.titleA genetic algorithm for vehicle routing problems with stochastic demand and soft time windowsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_HK
dc.identifier.authorityMak, KL=rp00154en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-3543091584en_HK
dc.identifier.hkuros86038-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-3543091584&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage183en_HK
dc.identifier.epage190en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.scopusauthoridGuo, ZG=7404658503en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats