Variable neighborhood search for minimum cost berth allocation-Reference-Cited by-同舟云学术

Variable neighborhood search for minimum cost berth allocation

Published:2008-12 Issue:3 Volume:191 Page:636-649
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Hansen Pierre,Oğuz Ceyda,Mladenović Nenad

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. Toward practical ‘neural’ computation for combinatorial optimization problems;Baum,1986

2. Models and tabu search heuristics for the berth-allocation problem;Cordeau;Transportation Science,2005

3. Stabilized column generation;du Merle;Discrete Mathematics,1999

4. The berth allocation problem: Models and solution methods;Guan;OR Spectrum,2004

5. Variable neighborhood search: Principles and applications;Hansen;European Journal of Operational Research,2001

Cited by 140 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A comprehensive bibliometric analysis and assessment of high-impact research on the berth allocation problem;Ocean Engineering;2024-05

2. Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem;Transportation Research Part B: Methodological;2024-04

3. A prescriptive analytics approach to solve the continuous berth allocation and yard assignment problem using integrated carbon emissions policies;Annals of Operations Research;2023-07-17

4. Collaborative multi-objective port allocation scheduling considering carbon emissions;2023-07-07

5. A bibliometric analysis and assessment of container terminal operations research;Maritime Business Review;2023-03-07