Thumbnail
Access Restriction
Subscribed

Author Tam, V. ♦ Kwan, M.C.
Sponsorship IEEE Comput. Soc.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2004
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Special computer methods
Subject Keyword Vehicles ♦ Proposals ♦ Routing ♦ Job shop scheduling ♦ Processor scheduling ♦ Transportation ♦ Constraint optimization ♦ Artificial intelligence ♦ IEEE services ♦ scheduling ♦ heuristic search
Abstract Pickup 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. 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.
Description Author affiliation: Dept. of Electr. & Electron. Eng., Hong Kong Univ., China (Tam, V.; Kwan, M.C.)
ISBN 076952236X
ISSN 10823409
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2004-11-15
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 133.79 kB
Page Count 7
Starting Page 519
Ending Page 525


Source: IEEE Xplore Digital Library