File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Solving pickup and delivery problems with refined construction and repair heuristics

TitleSolving pickup and delivery problems with refined construction and repair heuristics
Authors
Issue Date2004
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Artificial Intelligence (Subseries Of Lecture Notes In Computer Science), 2004, v. 3157, p. 932-933 How to Cite?
AbstractPickup and delivery problems with time windows (PDP-TW) involve assigning all paired pickup-and-delivery requests to various vehicles to satisfy relevant time-window requirements while minimizing certain objective measures including the total number of vehicles used. In some previous work, the conventional push forward insertion heuristic (PFIH) was successfully adapted to work with a new swap operator for repairs so as to effectively solve PDP-TWs. Here, we firstly adapted the PFIH to efficiently construct a better initial solution which will then be iteratively improved by another refined swapping scheme which systematically revises its neighborhood size for opportunistic improvements. The prototype using our refined heuristics gained impressive results against those of a tabu-embedded metaheuristic search on a set of modified Solomon's test cases. More importantly, the refined heuristics prompts for future investigation and improvement to effectively solve related scheduling problems. © Springer-Verlag Berlin Heidelberg 2004.
Persistent Identifierhttp://hdl.handle.net/10722/99423
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorTam, Ven_HK
dc.date.accessioned2010-09-25T18:29:31Z-
dc.date.available2010-09-25T18:29:31Z-
dc.date.issued2004en_HK
dc.identifier.citationLecture Notes In Artificial Intelligence (Subseries Of Lecture Notes In Computer Science), 2004, v. 3157, p. 932-933en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99423-
dc.description.abstractPickup and delivery problems with time windows (PDP-TW) involve assigning all paired pickup-and-delivery requests to various vehicles to satisfy relevant time-window requirements while minimizing certain objective measures including the total number of vehicles used. In some previous work, the conventional push forward insertion heuristic (PFIH) was successfully adapted to work with a new swap operator for repairs so as to effectively solve PDP-TWs. Here, we firstly adapted the PFIH to efficiently construct a better initial solution which will then be iteratively improved by another refined swapping scheme which systematically revises its neighborhood size for opportunistic improvements. The prototype using our refined heuristics gained impressive results against those of a tabu-embedded metaheuristic search on a set of modified Solomon's test cases. More importantly, the refined heuristics prompts for future investigation and improvement to effectively solve related scheduling problems. © Springer-Verlag Berlin Heidelberg 2004.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)en_HK
dc.titleSolving pickup and delivery problems with refined construction and repair heuristicsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailTam, V:vtam@eee.hku.hken_HK
dc.identifier.authorityTam, V=rp00173en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-22944432162en_HK
dc.identifier.hkuros103179en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-22944432162&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3157en_HK
dc.identifier.spage932en_HK
dc.identifier.epage933en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats