Cash distribution using skip concept for heuristics vehicle routing methodology

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Business, Engineering

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

  2013cited by this paper
• Efficiency Improvement for Multi Depot Vehicle Routing: A Case Study in Cash Distribution

  2013cited by this paper
• A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

  2011cited by this paper
• Assignment Problem and Vehicle Routing Problem for an Improvement of Cash Distribution

  2011cited by this paper
• The Vehicle Routing Problem with Stochastic Demand and Duration Constraints

  2010cited by this paper
• The Vehicle Routing Problem with Discrete Split Delivery and Time Windows

  2009cited by this paper
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

  2008cited by this paper
• The open vehicle routing problem: Algorithms, large-scale test problems, and computational results

  2007cited by this paper
• A branch-and-cut algorithm for the capacitated open vehicle routing problem

  2007cited by this paper
• Worst-Case Analysis for Split Delivery Vehicle Routing Problems

  2006cited by this paper
• A VEHICLE ROUTING PROBLEM WITH BACKHAULS AND TIME WINDOWS: A GUIDED LOCAL SEARCH SOLUTION

  2005cited by this paper
• A tabu search algorithm for the open vehicle routing problem

  2004cited by this paper
• An Exact Method for the Vehicle Routing Problem with Backhauls

  1999cited by this paper
• Split-delivery routeing heuristics in livestock feed distribution

  1997cited by this paper
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs

  1994cited by this paper
• The vehicle scheduling problem with intermittent customer demands

  1992cited by this paper
• THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC CUSTOMERS AND DEMANDS

  1992cited by this paper
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

  1991cited by this paper
• Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

  1964cited by this paper

• On Formulation of the Vehicle Routing Problems Objective Function with Focus on Time Windows, Quantities and Split Delivery Priorities

  year unknowncites this paper