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.
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.
Cargo shipA cargo ship or freighter is a merchant ship that carries cargo, goods, and materials from one port to another. Thousands of cargo carriers ply the world's seas and oceans each year, handling the bulk of international trade. Cargo ships are usually specially designed for the task, often being equipped with cranes and other mechanisms to load and unload, and come in all sizes. Today, they are almost always built of welded steel, and with some exceptions generally have a life expectancy of 25 to 30 years before being scrapped.
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).
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.
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.
Cargo aircraftA cargo aircraft (also known as freight aircraft, freighter, airlifter or cargo jet) is a fixed-wing aircraft that is designed or converted for the carriage of cargo rather than passengers. Such aircraft usually do not incorporate passenger amenities and generally feature one or more large doors for loading cargo. Freighters may be operated by civil passenger or cargo airlines, by private individuals or by the armed forces of individual countries.
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.
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.
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).
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.
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.
Approximation-preserving reductionIn computability theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reduction is an algorithm for transforming one optimization problem into another problem, such that the distance of solutions from optimal is preserved to some degree. Approximation-preserving reductions are a subset of more general reductions in complexity theory; the difference is that approximation-preserving reductions usually make statements on approximation problems or optimization problems, as opposed to decision problems.
Los Angeles TimesThe Los Angeles Times is a daily newspaper that started publishing in Los Angeles in 1881. Based in the Los Angeles County city of El Segundo since 2018, it is the sixth-largest newspaper by circulation in the United States, as well as the largest newspaper in the western United States. Owned by Patrick Soon-Shiong and published by the Times Mirror Company, the paper has won more than 40 Pulitzer Prizes. In the 19th century, the paper developed a reputation for civic boosterism and opposition to labor unions, the latter of which led to the bombing of its headquarters in 1910.
Travelling salesman problemThe travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
Clique problemIn computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found. Common formulations of the clique problem include finding a maximum clique (a clique with the largest possible number of vertices), finding a maximum weight clique in a weighted graph, listing all maximal cliques (cliques that cannot be enlarged), and solving the decision problem of testing whether a graph contains a clique larger than a given size.
