A stochastic beam search for the berth allocation problem

Wang, Fan; Lim, Andrew

doi:10.1016/j.dss.2006.06.008

Cited by 145 publications

(64 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The derived solutions were found to be similar to those obtained from the MIP model. Following a multiple-stage decision procedure, Wang and Lim [36] solved the BAP using a stochastic beam search algorithm (SBSA), and the experimental results showed good performance of their algorithm. This algorithm was found to be more accurate and efficient than the state-of-the-art meta-heuristics and traditional deterministic beam search.…”

Section: Studies Focusing On Bap or Qcapmentioning

confidence: 99%

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

et al. 2017

View full text Add to dashboard Cite

Container terminals (CTs) play an essential role in the global transportation system. To deal with growing container shipments, a CT needs to better solve the three essential seaside operational problems; berth allocation problem (BAP), quay crane assignment problem (QCAP), and quay crane scheduling problem (QCSP), which affect the performance of a CT considerably. In past studies, the three seaside operational problems have often been solved individually or partially, which is likely to result in poor overall system performance. However, solving the three seaside operational problems simultaneously is in fact a very complicated task. In this research, we dealt with the three seaside operational problems at the same time by using a novel high-level Petri net, termed an Object-Oriented and Timed Predicate/Transition Net (OOTPr/Tr net). After defining the three seaside operational problems formally, we integrated them as a three-level framework that was further transformed into an OOTPr/Tr net model. Then, using the Prolog programming language, we implemented this model as a simulation tool to find the best solution based on the various combinations of heuristic rules used.

show abstract

Section: Studies Focusing On Bap or Qcapmentioning

confidence: 99%

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

et al. 2017

View full text Add to dashboard Cite

show abstract

“…Hansen et al (2008) solve the dynamic BAP problem by taking into account the service costs of ships depending on the berth they are assigned to in addition to the handling times. The continuous dynamic BAP with both fixed and berth-position dependent handling times has received considerable attention from researchers (Wang and Lim, 2007). many other version of the BAP has been considered by researchers.…”

Section: Berth Allocation Problem (Bap)mentioning

confidence: 99%

Sea Container Terminals: New Technologies, OR Models, and Emerging Research Areas

2014

View full text Add to dashboard Cite

Due to a rapid growth in world trade and a huge increase in containerized goods, sea container terminals play a vital role in globe-spanning supply chains. Container terminals should be able to handle large ships, with large call sizes within the shortest time possible, and at competitive rates. In response, terminal operators, shipping liners, and port authorities are investing in new technologies to improve container handling infrastructure and operational efficiency. Container terminals face challenging research problems which have received much attention from the academic community. The focus of this paper is to highlight the recent developments in the container terminals, which can be categorized into three areas: (1) innovative container terminal technologies, (2) new OR directions and models for existing research areas, and (3) emerging areas in container terminal research. By choosing this focus, we complement existing reviews on container terminal operations.

show abstract

“…Ow and Morton (1988) were the rst to systematically study the performance of Beam Search compared to other well-known heuristics for two scheduling problems. Since then, Beam Search was applied within multiple elds of application and many extensions have been developed, e.g., stochastic vertex choice (Wang and Lim, 2007) or hybridization with other meta-heuristics (Blum, 2005), so that Beam Search turns out to be a powerful meta-heuristic applicable to many real-world optimization problems. A review on these developments is provided by Sabuncuoglu et al (2008).…”

Section: 2mentioning

confidence: 99%

Scheduling Freight Trains in Rail-Rail Transshipment Yards

Boysen

Jaehn

Pesch

2011

Transportation Science

View full text Add to dashboard Cite

Transshipment yards, where gantry cranes allow for an ecient transshipment of containers between dierent freight trains, are important entities in modern railway systems and facilitate the general shift from point-to-point transport to hub-and-spoke railway systems. Modern rail-rail transshipment yards accelerate container handling, so that multiple smaller trains with equal destination can be consolidated to a reduced number of trains without jeopardizing on time deliveries. An important problem continuously arising during the daily operations of a transshipment yard is the train scheduling problem, which decides on the succession of trains at the parallel railway tracks. This problem with a special focus on resolving deadlocks and avoiding multiple crane picks per container move is investigated within the paper on hand. A mathematical program along with a complexity proof is provided and exact (Dynamic Programming) and heuristic (Beam Search) procedures are described.

show abstract

A stochastic beam search for the berth allocation problem

Cited by 145 publications

References 18 publications

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

Sea Container Terminals: New Technologies, OR Models, and Emerging Research Areas

Scheduling Freight Trains in Rail-Rail Transshipment Yards

Contact Info

Product

Resources

About