A critical-shaking neighborhood search for the yard allocation problem

Andrew Lim, Zhou Xu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

40 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)1247-1259
Number of pages13
JournalEuropean Journal of Operational Research
Volume174
Issue number2
DOIs
Publication statusPublished - 16 Oct 2006
Externally publishedYes

Keywords

  • Logistics
  • Metaheuristics
  • Packing
  • Scheduling

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this