- •Часть 2
- •1) Answer the questions.
- •2) Mark the statements as true or false according to the text.
- •3) Decide what type of product each passage illustrates.
- •4) Fill in the suitable words from the list (buy, consumer, difference, goods, people, industrial, services, threefold).
- •5) Make word combinations.
- •6) Match words with their definitions.
- •Answer the questions.
- •Mark the statements as true or false.
- •Fill in the suitable words from the list (control, distribution, availability, logistician, cycle, strategy, stocking, deployment).
- •1.Weight-Bulk Ratio
- •2. Value-Weight Ratio
- •3. .Substitutability
- •4. Risk Characteristics
- •Answer the questions.
- •Decide if the following statements are true or false.
- •Make word combinations from the following words.
- •Fill in the suitable words from the list (explode, price, costs, features, stolen, restrictions, system, risk).
- •1. F.O.B. Pricing
- •2. Zone pricing.
- •3. Single, or Uniform, Pricing
- •4. Freight Equalization Pricing
- •5. Basing Point Pricing
- •1) Answer the questions.
- •1) Answer the questions.
- •1) Answer the questions.
- •2) Make up word combinations from the following words.
- •3) Fill in the following words into the text ( destination, primary, point, cycle, loading, logistician, stocking, time, order ).
- •1) Answer the questions.
- •Information Substitution.
- •3) Match the following words to their definitions.
- •1. Order preparation.
- •Order transmittal.
- •3. Order entry.
- •Order filling.
- •Order status reporting.
- •1) Answer the questions.
- •2) Fill in the following words into the text (complete, entry, timely, chain, materials, information, accurate, on, efforts, activities).
- •4)Match the following expressions with their meanings.
- •1. Industrial Order Processing.
- •2. Retail Order Processing
- •3.Customer Order Processing.
- •1) Answer the questions.
- •2) Fill in the prepositions (of, throughout, by, into, through, for, to, on, out, from, in). Some prepositions may be used more than once.
- •1) Answer the questions
- •3) Fill in the gaps with the following words (costs, on hand, order, batching, volume, than, small, receives, partially, product, shipment).
- •Answer the questions
- •Make word combinations from the following words:
- •Answer the questions
- •Make word combinations from the following words
- •Intermodal Services
- •Answer the questions
- •Make word combinations from the following words
- •Answer the questions
- •Make the word combinations from the following words
- •Variable and Fixed Costs
- •1)Answer the questions
- •International Transport Documentation
- •1)Answer the questions
- •2)Make the word combinations from the following words
- •Basic Cost Trade-Offs
- •Competitive Considerations
- •1)Answer the questions.
- •Separate and Single Origin and Destination Points
- •Multiple Origin and Destination Points
- •Coincident Origin and Destination Points
- •1)Answer the questions.
- •3) Match the following terms with their definitions.
- •1) Answer the questions.
- •3) Fill in the text with prepositions from the brackets (at, of, around, in, between, by, before, on, toward, after, from, with, to). Some of them may be used more than once.
- •International Shipping Terms
Separate and Single Origin and Destination Points
The problem of routing a vehicle through a network has been nicely solved by methods designed specifically for it. Perhaps the simplest and most straightforward technique is the shortest route method. The approach may be paraphrased as follows. We are given a network represented by links and nodes, where the nodes are connecting points between links, and the links are the costs (distances, times, or a combination of both formed as a weighted average of time and distance) to traverse between nodes. Initially, all nodes are considered unsolved, that is, they are not yet on a defined route. A solved node is on the route. Starting with the origin as a solved node, then:
Multiple Origin and Destination Points
When there are multiple source points that may serve multiple destination points, there is a problem of assigning destinations to sources as well as finding the best routes between them. This problem commonly occurs when there is more than one vendor, plant, or warehouse to serve more than one customer for the same product. It is further complicated when the source points are restricted to the amount of the total customer demand that can be supplied from each location. A special class of the linear programming algorithm known as the transportation method is frequently applied to this problem type.
Coincident Origin and Destination Points
The logistician frequently encounters routing problems in which the origin point is the same as the destination point. This class of routing problem commonly occurs when transport vehicles are privately owned. Familiar examples include
Beverage delivery to bars and restaurants
Currency delivery and scheduling at ATM machines
Dynamic sourcing and transport of fuels
Grease pickups from restaurants
Home appliance repair, service, and delivery
Internet-based home grocery delivery
Milk pickup and inventory management
Pickup of charitable donations from homes
Portable toilet delivery, pickup, and service
Prisoner transportation between jails and courthouses
Retrieval of dead and diseased animals from roadsides
Snowplow and snow-removal routing
Transport of test samples from medical offices to laboratories
Transportation of disabled individuals by vans and taxis
Trash pickup and trans-shipments
Wholesale distribution from warehouses to retailers
Postal delivery truck routing
School bus routing
Newspaper delivery
Delivery of meals to shut-ins
This type of routing problem is an extension of the problem of separate origin and destination points, but the requirement that the tour is not complete until the vehicle returns to its starting point adds a complicating dimension. The objective is to find the sequence in which the points should be visited that will minimize total travel time or distance.
The coincident origin and destination routing problem is generally known as the "traveling salesman" problem. Numerous methods have been proposed to solve it. Finding the optimal route for a particular problem has not been practical for such problems when they contain many points or require a solution to be found quickly. Computational time on the fastest computers for optimization methods has been too long for many practical problems. Cognitive, heuristic, or combination heuristic-optimization solution procedures have been good alternatives.
Exercises.