PortA port is a maritime facility comprising one or more wharves or loading areas, where ships load and discharge cargo and passengers. Although usually situated on a sea coast or estuary, ports can also be found far inland, such as Hamburg, Manchester and Duluth; these access the sea via rivers or canals. Because of their roles as ports of entry for immigrants as well as soldiers in wartime, many port cities have experienced dramatic multi-ethnic and multicultural changes throughout their histories.
HeuristicA heuristic (hjʊˈrɪstɪk; ), or heuristic technique, is any approach to problem solving or self-discovery that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is nevertheless sufficient for reaching an immediate, short-term goal or approximation. Where finding an optimal solution is impossible or impractical, heuristic methods can be used to speed up the process of finding a satisfactory solution. Heuristics can be mental shortcuts that ease the cognitive load of making a decision.
Bulk cargoBulk cargo is commodity cargo that is transported unpackaged in large quantities. Bulk cargo refers to material in either liquid or granular, particulate form, as a mass of relatively small solids, such as petroleum/crude oil, grain, coal, or gravel. This cargo is usually dropped or poured, with a spout or shovel bucket, into a bulk carrier ship's hold, railroad car/railway wagon, or tanker truck/trailer/semi-trailer body. Smaller quantities can be boxed (or drummed) and palletised; cargo packaged in this manner is referred to as breakbulk cargo.
Bulk carrierA bulk carrier or bulker is a merchant ship specially designed to transport unpackaged bulk cargo—such as grain, coal, ore, steel coils, and cement—in its cargo holds. Since the first specialized bulk carrier was built in 1852, economic forces have led to increased size and sophistication of these ships. Today's bulk carriers are specially designed to maximize capacity, safety, efficiency, and durability. Today, bulk carriers make up 21 percent of the world's merchant fleets, and they range in size from single-hold mini-bulk carriers to mammoth ore ships able to carry 400,000 metric tons of deadweight (DWT).
Heuristic (psychology)Heuristics is the process by which humans use mental short cuts to arrive at decisions. Heuristics are simple strategies that humans, animals, organizations, and even machines use to quickly form judgments, make decisions, and find solutions to complex problems. Often this involves focusing on the most relevant aspects of a problem or situation to formulate a solution. While heuristic processes are used to find the answers and solutions that are most likely to work or be correct, they are not always right or the most accurate.
Container portA container port or container terminal is a facility where cargo containers are transshipped between different transport vehicles, for onward transportation. The transshipment may be between container ships and land vehicles, for example trains or trucks, in which case the terminal is described as a maritime container port. Alternatively, the transshipment may be between land vehicles, typically between train and truck, in which case the terminal is described as an inland container port.
Linear programmingLinear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints.
Heuristic (computer science)In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω "I find, discover") is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.
Approximation algorithmIn computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time.
ContainerizationContainerization is a system of intermodal freight transport using intermodal containers (also called shipping containers, or ISO containers). Containerization, also referred as container stuffing or container loading, is the process of unitization of cargoes in exports. Containerization is the predominant form of unitization of export cargoes, as opposed to other systems such as the barge system or palletization. The containers have standardized dimensions.
Intermodal containerAn intermodal container, often called a shipping container or ISO Container, is a large standardized container designed and built for intermodal freight transport, meaning these containers can be used across different modes of transport – from ship to rail to truck – without unloading and reloading their cargo. Intermodal containers are primarily used to store and transport materials and products efficiently and securely in the global containerized intermodal freight transport system, but smaller numbers are in regional use as well.
Operations researchOperations research (operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve decision-making. The term management science is occasionally used as a synonym. Employing techniques from other mathematical sciences, such as modeling, statistics, and optimization, operations research arrives at optimal or near-optimal solutions to decision-making problems.
MetaheuristicIn computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, tune, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem or a machine learning problem, especially with incomplete or imperfect information or limited computation capacity. Metaheuristics sample a subset of solutions which is otherwise too large to be completely enumerated or otherwise explored.
Breakbulk cargoIn shipping, break-bulk, breakbulk, or break bulk cargo, also called general cargo, is goods that are stowed on board ship in individually counted units. Traditionally, the large numbers of items are recorded on distinct bills of lading that list them by different commodities. This is in contrast to cargo stowed in modern intermodal containers as well as bulk cargo, which goes directly, unpackaged and in large quantities, into a ship's hold(s), measured by volume or weight (for instance, oil or grain).
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.
Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
Admissible heuristicIn computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path. It is related to the concept of consistent heuristics. While all consistent heuristics are admissible, not all admissible heuristics are consistent. An admissible heuristic is used to estimate the cost of reaching the goal state in an informed search algorithm.
Reduction (complexity)In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently efficient reduction from one problem to another may be used to show that the second problem is at least as difficult as the first. Intuitively, problem A is reducible to problem B, if an algorithm for solving problem B efficiently (if it existed) could also be used as a subroutine to solve problem A efficiently. When this is true, solving A cannot be harder than solving B.
CargoFreight consists of goods conveyed by water, air, or land, while cargo refers specifically to freight when conveyed via water or air. In economics, freight refers to goods transported at a freight rate for commercial gain. The term cargo is also used in case of goods in the cold-chain, because the perishable inventory is always in transit towards a final end-use, even when it is held in cold storage or other similar climate-controlled facilities, including warehouses.
Swap bodyA swap body, swop body, exchangeable container or interchangeable unit, is one of the types of standard freight containers for road and rail transport. Based on and very similar to the more widespread shipping containers (ISO containers), swap bodies normally have the same external dimensions for the bottom corner fittings as ISO shipping containers so that they can be placed on the same kinds of trucks, trailers and railroad cars designed for shipping containers. However, ISO containers inner dimensions (2.
