File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Effective Heuristics to Solve Pickup and Delivery Problems with Time Windows

TitleEffective Heuristics to Solve Pickup and Delivery Problems with Time Windows
Authors
KeywordsComputers
Hardware
Issue Date2003
PublisherIEEE.
Citation
Proceedings Of The International Conference On Tools With Artificial Intelligence, 2003, p. 184-188 How to Cite?
AbstractPickup and delivery problem with time windows (PDP-TW) is a challenging scheduling problem for which each delivery is coupled with a pickup request. Metaheuristic search techniques like the tabu search have been used to solve PDP-TW. In this paper, we investigated a min-conflicts based micro-genetic algorithm combining some interesting construction heuristic, namely the Align-Fold or Boomerang, and repair heuristics including a new Swap operator and a modified billiard operator to effectively solve PDD-TW. Our results compared favorably against those of a tabu-embedded metaheuristic search on a set of modified Solomon's test cases. More importantly, our proposed heuristics can easily be integrated into many search schemes for solving other complex scheduling problems.
Persistent Identifierhttp://hdl.handle.net/10722/46408
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorTam, Ven_HK
dc.contributor.authorTseng, LCYen_HK
dc.date.accessioned2007-10-30T06:49:14Z-
dc.date.available2007-10-30T06:49:14Z-
dc.date.issued2003en_HK
dc.identifier.citationProceedings Of The International Conference On Tools With Artificial Intelligence, 2003, p. 184-188en_HK
dc.identifier.issn1063-6730en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46408-
dc.description.abstractPickup and delivery problem with time windows (PDP-TW) is a challenging scheduling problem for which each delivery is coupled with a pickup request. Metaheuristic search techniques like the tabu search have been used to solve PDP-TW. In this paper, we investigated a min-conflicts based micro-genetic algorithm combining some interesting construction heuristic, namely the Align-Fold or Boomerang, and repair heuristics including a new Swap operator and a modified billiard operator to effectively solve PDD-TW. Our results compared favorably against those of a tabu-embedded metaheuristic search on a set of modified Solomon's test cases. More importantly, our proposed heuristics can easily be integrated into many search schemes for solving other complex scheduling problems.en_HK
dc.format.extent234383 bytes-
dc.format.extent883769 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings of the International Conference on Tools with Artificial Intelligenceen_HK
dc.rights©2003 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectComputersen_HK
dc.subjectHardwareen_HK
dc.titleEffective Heuristics to Solve Pickup and Delivery Problems with Time Windowsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1082-3409&volume=&spage=184&epage=188&date=2003&atitle=Effective+heuristics+to+solve+pickup+and+delivery+problems+with+time+windowsen_HK
dc.identifier.emailTam, V:vtam@eee.hku.hken_HK
dc.identifier.authorityTam, V=rp00173en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-0345097622en_HK
dc.identifier.hkuros89785-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0345097622&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage184en_HK
dc.identifier.epage188en_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK
dc.identifier.scopusauthoridTseng, LCY=7201526689en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats