The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a mixed-integer programming (MIP) model of retrieval sequencing in container yards. Exact penalty function methods are proposed to find the exact solution. The optimization goal is to minimize the weighted sum of the number of container movements and the total working time of the crane.
This paper presents a mixed-integer programming (MIP) model for the vehicles scheduling problem. A dynamic programming algorithm is proposed to solve the above-mentioned problem. This method can reduce the needed trailers without in creasing the overall dwell time of the ship in port, and decrease un productive empty travel. Further, the numerical result of a small sized problem is reported.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.