![A critical-shaking neighborhood search for the yard allocation problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0P6/bigB000P6ODSE.jpg)
A critical-shaking neighborhood search for the yard allocation problem [An article from: European Journal of Operational Research]
Book Details
Author(s)
A. Lim, Z. Xu
Publisher
Elsevier
ISBN / ASIN
B000P6ODSE
ISBN-13
978B000P6ODS6
Availability
Available for download now
Marketplace
United States 🇺🇸
Ratings & Reviews
No reviews yet — be the first!
No reviews yet.
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective meta-heuristic procedure, named critical-shaking neighborhood search. Extensive experiments have shown that the new method can produce higher quality solutions in a much shorter time, as compared with other meta-heuristics in the literature. Further to this, it has also improved or at least achieved the current best solutions to all the benchmark instances of the problem.
Description:
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective meta-heuristic procedure, named critical-shaking neighborhood search. Extensive experiments have shown that the new method can produce higher quality solutions in a much shorter time, as compared with other meta-heuristics in the literature. Further to this, it has also improved or at least achieved the current best solutions to all the benchmark instances of the problem.
