A tabu search approach to the cargo prioritisation and terminal allocation problem
نویسندگان
چکیده
منابع مشابه
A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولA Tabu Search Based Algorithm for Cargo Loading Problem
Given a finite set of three-dimensional boxes in different sizes and an unlimited set of containers in the same size, the cargo loading problem is to determine the minimum number of containers that can contain all the boxes. The problem is NP-hard. In this paper, we propose to use Tabu search optimization with a tree-based heuristic cargo loading algorithm as its inner heuristic to solve this p...
متن کاملA tabu search heuristic for the dynamic space allocation problem
The dynamic space allocation problem (DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distan...
متن کاملA Tabu Search Approach To The Fuzzy Clustering Problem *
In this paper we consider the fuzzy clustering problem. This is a nonconvex problem that has many local minima. It has been studied by many researchers and the most well-known method is the fuzzy c-means algorithm. We develop a new algorithm for solving this problem based on a tabu search technique. Preliminary computational experience on the developed algorithm are encouraging and compare favo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Shipping and Transport Logistics
سال: 2020
ISSN: 1756-6517,1756-6525
DOI: 10.1504/ijstl.2020.10028342