This paper studies parsimonious, intuitive, and effective formulas to approximate the length of Traveling Salesman Problems (TSP) and Vehicle Routing Problems (VRP). Using intuition derived from continuous models and graph theory, a formula to approximate the length of vehicle routes is proposed. In instances with different patterns of customer spatial distribution, time windows, customer deman...

The vehicle routing problem (vrp) is related to service a number of customers with a fleet of vehicles. In real life, the applications of transportation, distribution and logistics are mostly studied as a research area for scientists and industrial practioners. In this study, the cargo distribution problem has been presented by using vrp procedures for a cargo company in Isparta City, Turkiye. ...

Vehicle Routing Problem (VRP) has been an interesting research area since its introduction. There are various types of VRP models and different solution techniques proposed for this problem. This paper uses several clustering algorithms in initialization of Simulated Annealing to solve VRP. The main contribution of this research is to assess the effect of using some clustering methods in buildi...

In Hong Kong, 35% of residential mortgage loans are adjustable rate mortgages with variable tenor (VRT). That is, with a change in interest rates, the loan adjusts its maturity and principal payment such that the monthly installment remains the same. In other words, instead of bearing a volatility on monthly payments as in a ®xed-tenor variable payment (VRP) mortgage, VRT mortgagors bear intere...

Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, to provide the efficient vehicle serving to the customer through different services by visiting the number of cities or stops, the VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is vis...

A matheuristic approach based on a reduced two-stage Stochastic Integer Linear Programming (SILP) model is presented. The proposed suitable for obtaining policy constructed dynamically the go during rollout algorithm. algorithm part of Approximate Dynamic (ADP) lookahead solution Markov Decision Processes (MDP) framed Multi-Depot Vehicle Routing Problem with Road Capacity (MDDVRPSRC). First, De...

Norwalk-like viruses (NLVs) are a diverse group of single-stranded, nonenveloped, positive-polarity RNA viruses and are the leading cause of epidemic acute gastroenteritis in the United States. In this study, the major capsid gene of Norwalk virus, the prototype NLV, has been cloned and expressed in mammalian cells using a Venezuelan equine encephalitis (VEE) replicon expression system. Upon in...

The Vehicle Routing Problem with Probabilistic Customers (VRP-PC) is a fundamental building block within the broad family of a priori routing models and has two decision stages. In the first stage, the dispatcher determines a set of vehicle routes serving all potential customer locations before the actual requests for service realize. In the second stage, vehicles are dispatched after observing...

This paper deals with a hub location-routing problem (HLRP) which integrates the hub location problem (HLP) and the multi-hub vehicle routing problem (MH-VRP) in parcel delivery service. The HLRP is very difficult to be solved since it is composed of two NP-hard problems, the HLP and the MH-VRP. To solve these problems simultaneously we present a novel solution framework which divides the probl...