Saving heuristic and/or Savings heuristic one calls an optimization procedure in route planning. A goal is to be minimized thereby the altogether put back distance between a camp and the customers who can be supplied.

In addition in each case pairs of customers are regarded. The saving potential is direct the saved distance, if both customers in a route are successively supplied, in relation to the way which can be put back with an individual supply of the two customers from stock.

Becomes clear: The saving potential is the larger, the further from the camp removes the customers lie and the more near they are to each other in relation to it. The saving potentials are determined for all customer mating. Route planning proceeds then from the customer mating, which promises the largest saving potential. Afterwards to it the further stations of the route with the remaining mating are integrated according to the order of rank of its saving potentials.

Articles in category "Savings heuristic"

We found here 16 articles.

Related Websites

We found here 6 related websites.

• A new enhancement of the Clarke and Wright savings heuristic for ...
  Motivated by their results we propose a new parallel savings heuristic which ... Section three is where we describe our new parallel savings heuristic. ...


• A new enhancement of the Clarke and Wright savings heuristic for ...
  A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. I dot K Alt nel1 and T


• Citations: Parallel Savings Heuristics for the Topological Design ...
  B. GAVISH and K. ALTINKEMER, 1986. Parallel Savings Heuristics for the Topological Design of Local Access Tree Networks, Proceedings of the IEEE Conference ...


• Tabu Search
  1997, Savings heuristic, Exchange, relocate, 2-opt*, 2-opt, Or-opt, No, Constraint programming used to check feasibility of moves ...


• Tutorial: Heuristic Search for Network Design
  Savings Heuristic. Start with a feasible star solution in which all ... Savings Heuristic. Select the node with the highest savings and ...


• Vehicle Routing and Scheduling
  Savings Heuristic (Parallel). Step 1. Compute savings s(i,j) for all. pairs of customers. Sort savings. Create out-and-back routes for all. customers. ...