File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adapting the large neighborhood search to effectively solve pickup and delivery problems with time windows

TitleAdapting the large neighborhood search to effectively solve pickup and delivery problems with time windows
Authors
Tam, VKwan, MC
KeywordsComputers
Hardware
Issue Date2004
PublisherIEEE.
Citation
Proceedings - International Conference On Tools With Artificial Intelligence, Ictai, 2004, p. 519-523 How to Cite?
DOI: http://dx.doi.org/10.1109/ICTAI.2004.23
AbstractPickup and delivery problems with time windows (PDP-TW) are challenging combinatorial optimization problems widely occurring in modern distribution and transportation industry. A previous proposal successfully adapted and combined the well-known push forward insertion heuristic (PFIH) with a new repair-based swap operator as a computationally reduced version of the Large Neighborhood Search (LNS) to efficiently solve the PDP-TWs. In this paper, we focus on a more systematic scheme to adapt the LNS in order to effectively solve PDP-TWs. Up to our knowledge, this work represents the first attempt to systematically adapt LNS for solving PDP-TWs. Besides, the empirical results obtained by our search proposals affirmed the attractive capability of the LNS approach to effectively reduce the total distance traveled in solving PDP-TWs, with similar results also achieved by the original LNS method in tackling the conventional vehicle routing problems with time windows. Lastly, our proposal of adapting LNS to solve hard combinatorial problems opens up many possible directions for future investigations. © 2004 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/45792
ISSN
1082-3409
2020 SCImago Journal Rankings: 0.190
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorTam, Ven_HK
dc.contributor.authorKwan, MCen_HK
dc.date.accessioned2007-10-30T06:35:34Z-
dc.date.available2007-10-30T06:35:34Z-
dc.date.issued2004en_HK
dc.identifier.citationProceedings - International Conference On Tools With Artificial Intelligence, Ictai, 2004, p. 519-523en_HK
dc.identifier.issn1082-3409en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45792-
dc.description.abstractPickup and delivery problems with time windows (PDP-TW) are challenging combinatorial optimization problems widely occurring in modern distribution and transportation industry. A previous proposal successfully adapted and combined the well-known push forward insertion heuristic (PFIH) with a new repair-based swap operator as a computationally reduced version of the Large Neighborhood Search (LNS) to efficiently solve the PDP-TWs. In this paper, we focus on a more systematic scheme to adapt the LNS in order to effectively solve PDP-TWs. Up to our knowledge, this work represents the first attempt to systematically adapt LNS for solving PDP-TWs. Besides, the empirical results obtained by our search proposals affirmed the attractive capability of the LNS approach to effectively reduce the total distance traveled in solving PDP-TWs, with similar results also achieved by the original LNS method in tackling the conventional vehicle routing problems with time windows. Lastly, our proposal of adapting LNS to solve hard combinatorial problems opens up many possible directions for future investigations. © 2004 IEEE.en_HK
dc.format.extent137002 bytes-
dc.format.extent883769 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings - International Conference on Tools with Artificial Intelligence, ICTAIen_HK
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.-
dc.subjectComputersen_HK
dc.subjectHardwareen_HK
dc.titleAdapting the large neighborhood search to effectively 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=519&epage=523&date=2004&atitle=Adapting+the+large+neighborhood+search+to+effectively+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.doi10.1109/ICTAI.2004.23en_HK
dc.identifier.scopuseid_2-s2.0-16244414624en_HK
dc.identifier.hkuros103184-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-16244414624&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage519en_HK
dc.identifier.epage523en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK
dc.identifier.scopusauthoridKwan, MC=8301739500en_HK
dc.identifier.issnl1082-3409-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats