An Exponential Monte-Carlo Local Search Algorithm for the Berth Allocation Problem
نویسنده
چکیده
Over the years, the demand for maritime transportation has rapidly increased [1], [2]. This usually leads to an increasing in competition among different ports in providing efficient services. Port managers face significant challenges in efficiently utilizing the given resources to provide a cost-effective service [1]. Among many optimization and decision making problems in the port management system, the berth allocation problem (BAP) is considered as one of the most challenging and it has a critical role in the ports effectiveness and competitiveness. The BAP seeks an allocation for a given set of vessels berthing positions and berthing times. The main objective of the BAP is to minimize the total waiting time for all vessels in a port [2].
منابع مشابه
Integrating tactical and operational berth allocation decisions via Simulation-Optimization
The berth allocation problem (BAP) arising in maritime container terminals has received great attention in the literature over recent years. It has been largely modeled as an integer mathematical programming formulation to be adopted at a tactical level, where detailed equipment and manpower schedules, as well as real-time operational conditions are not explicitly modeled. In this paper, decisi...
متن کاملOptimal Scheduled Unit Commitment Considering Wind Uncertainty Using Cuckoo Search Algorithm
In this paper, a new method to review the role of wind units as an energy-producer in the scheduling problem of unit commitment is presented. Today, renewable energy sources due to lack of environmental pollution, absence of dependence on fossil fuels, and consequently a very low marginal cost, have been receiving considerable attention in power system. But these sources are associated with unc...
متن کاملA Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملAn Investigation of Variable Neighbourhood Search for University Course Timetabling
The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent ...
متن کاملA new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کامل