Learn More
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. We address the optimization of the resource-constrained elementary shortest path problem and we present and compare three methods. The first method is a well-known exact dynamic(More)
The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depot to a set of customers and the collection of waste from the customers to the depot must be performed by the same vehicles of limited capacity and the customers(More)
International sea-freight container transportation has grown dramatically over the last years and container terminals represent nowadays a key actor in the global shipping network. Terminal managers have to face with an increasing competitiveness among terminals , which require more and more efficiency in container operations both along the quayside and(More)
In this paper we integrate two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). They are indeed strictly(More)
In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch-and-price algorithm is implemented to produce optimal integer solutions to the problem. In particular, we(More)
1 Abstract In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working(More)