Preview

Saving's Algorithm

Powerful Essays
Open Document
Open Document
1526 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Saving's Algorithm
Clarke & Wright's Savings Algorithm

Jens Lysgaard
(translated by Michael M. Sørensen)

Department of Management Science and Logistics The Aarhus School of Business Fuglesangs Allé 4 DK-8210 Aarhus V

September 1997

1. Introduction. In 1964 Clarke & Wright published an algorithm for the solution of that kind of vehicle routing problem, which is often called the classical vehicle routing problem. This algorithm is based on a so-called savings concept. This note briefly describes the algorithm and demonstrates its use by an example.

2. Problem characteristics. The vehicle routing problem, for which the algorithm has been designed, is characterized as follows. From a depot goods must be delivered in given quantities to given customers. For the transportation of the goods a number of vehicles are available, each with a certain capacity with regard to the quantities. Every vehicle that is applied in the solution must cover a route, starting and ending at the depot, on which goods are delivered to one or more customers. The problem is to determine the allocation of the customers among routes, the sequence in which the customers shall be visited on a route, and which vehicle that shall cover a route. The objective is to find a solution which minimizes the total transportation costs. Furthermore, the solution must satisfy the restrictions that every customer is visited exactly once, where the demanded quantities are delivered, and the total demand on every route must be within the vehicle’s capacity. The transportation costs are specified as the cost of driving from any point to any other point. The costs are not necessarily identical in the two directions between two given points.

-1-

3. The savings algorithm. The savings algorithm is a heuristic algorithm, and therefore it does not provide an optimal solution to the problem with certainty. The method does, however, often yield a relatively good solution. That is, a solution which deviates little from

You May Also Find These Documents Helpful

  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Good Essays

    ECO 550 FINAL EXAM

    • 1177 Words
    • 4 Pages

    9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.…

    • 1177 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Case 36

    • 637 Words
    • 3 Pages

    Agrifarm Company is in the business of buying and selling grain. The company wants to increase profitability by ensuring that shipping costs are kept low. All is shipments come from 3 rail cars origins. In addition, all shipments must be routed through either of two grain processing centers before sending them to the final customer. The object is to minimize the total shipping cost, therefore selecting the proper shipping route for each carload.…

    • 637 Words
    • 3 Pages
    Good Essays
  • Good Essays

    References: Coyle, J.J., Novack, R.A., Gibson, B.J., & Bardi, E.J. (2011). Transportation: A Supply Chain Perspective, 7th edition, South Western College Publishing.…

    • 759 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    A Newsletter from Harvard Business School Publishing and The MIT Center for Transportation & Logistics…

    • 2205 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    References: Coyle, J. J., Novack, R. A., Gibson, B. J., & Barbi, E. J. (2003). Transportation: A Supply Chain Perspective, Seventh edition. Mason, Ohio: South-Western Cengage Learning.…

    • 412 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Chapter 13: Physical Distribution of Introduction to Materials Management Sixth Edition by J. R. Tony Arnold,…

    • 616 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Fedex Case

    • 2920 Words
    • 12 Pages

    2. List the types of information systems shown in the video. Can you describe how systems that were not shown might be used at FedEx?…

    • 2920 Words
    • 12 Pages
    Powerful Essays
  • Satisfactory Essays

    Air-Trak Proposal Sample

    • 427 Words
    • 2 Pages

    Route optimization, in which fleet managers can analyze routes and destinations to find the most time and fuel efficient path for each vehicle.…

    • 427 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Consumer Fashion Involvement

    • 12660 Words
    • 51 Pages

    Department of Marketing and Logistics, College of Business, University of North Texas, Denton, Texas, USA…

    • 12660 Words
    • 51 Pages
    Powerful Essays
  • Good Essays

    DMO Session B12

    • 1077 Words
    • 12 Pages

    Transshipment problem is a special type of transportation problem involving intermediate nodes. These problems in which a shipment may move through intermediate nodes before reaching a particular destination node. It can be converted to larger transportation problems and solved by a special transportation program. It can also be solved by general purpose linear programming codes.…

    • 1077 Words
    • 12 Pages
    Good Essays
  • Powerful Essays

    Abstract Transport models are applied to support the planner in the process of planning and decision making. Models attempt to replicate the system of interest and the system’s behaviour. The presented model considers the transportation system with its interactions between the several supply systems and the demand system. The transport model, implemented in a software product called VISUM, consists of • a network model describing the spatial and temporal structure of the supply systems, • a demand model simulating activities and generating trip chains, • routing and assignment models to determine service quality and route choice. The paper focuses on the requirements of a multi-modal transport model and • gives an overview of an activity-based demand model, • presents the structure of a network model integrating various modes and supply systems, • shows methods which support the design process and assist the planner in finding new solutions, • discusses multi-modal assignment procedures.…

    • 5205 Words
    • 21 Pages
    Powerful Essays
  • Good Essays

    If the studied company uses the proposed RAS metaheuristic, they could considerably reduce its transportation costs. Also, the planning of the buses routes might become an automated…

    • 726 Words
    • 3 Pages
    Good Essays
  • Good Essays

    [HR86] K. Hogan and C. S. ReVelle, Concept and applications of backup coverage, Management Science 32 (1986), no. 11, 1434–1444. [Jia08] Y. Jia, Improvement program of urban taxi stops based on simulated annealing algorithm in the context of china, Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (Washington, DC, USA), IEEE Computer Society, 2008, pp. 356–359. [LE96] P. Lopez and P. Esquirol, Consistency enforcing in scheduling: A general formulation based on energetic reasoning, 5th International Workshop on Projet Management and Scheduling (PMS’96) (Poznan (Poland)), 1996, pp. 155–158. [LSP08] J. H. Lee, I. H. Shin, and G. L. Park, Pick-up pattern for taxi location recommendation, 4th International Conference on Networked Computing and Advanced Information Management, 2008. [LWCT04] D.-H. Lee, H. Wang, R. L. Cheu, and S. H. Teo, Taxi dispatch system based on current demands and real-time traffic conditions, Transportation Research Record (2004), no. 1882, 193–200. [MMYH10] Q. Meng, S. Mabu, L. Yu, and K. Hirasawa, A novel taxi dispatch system integrating a multicustomer strategy and genetic network programming, Journal of Advanced Computational Intelligence and Intelligent Informatics 14 (2010), no. 5. [NSZ02] K. Neumann, C. Schwindt, and J. Zimmermann, Project Scheduling with Time Windows and Scarce Resources, Springer, 2002. [OD98] S. H. Owen and M. S. Daskin, Strategic facility location: A review, European Journal of Operational Research 111 (1998), no. 3, 423–447. [Sav92] M. W. P. Savelsbergh, The vehicle routing problem with time windows: Minimizing route duration, INFORMS Journal on Computing 4 (1992), no. 2, 146–154. [SCMK97] M. Shrivastava, P. K. Chande, A. S. Monga, and H. Kashiwagi, Taxi dispatch: A fuzzy approach, IEEE Conference on Intelligent Transportation System, 1997.…

    • 9144 Words
    • 37 Pages
    Good Essays
  • Powerful Essays

    The objective of Intelligent Transport System is to find out the optimal route for the vehicles to reach their destinations. vehicle routing is done in two phases. In the first phase Traffic Information System Collects the updated Traffic Status and stores it in the traffic information center. The Traffic Information System Consists of wired or wireless infrastructure and adhoc Vehicular communications. This information will be used for vehicle navigation. In the second phase LPA* vehicle path suggestion algorithm is used for finding the optimal route for the vehicle to reach the destination. The vehicle will follow the obtained route to reach the destination.…

    • 2245 Words
    • 9 Pages
    Powerful Essays

Related Topics