We consider the vehicle routing problem with stochastic demands (VRPSD). We give randomized approximation algorithms achieving approximation guarantees of 1 + for split-delivery VRPSD, and 2 + for unsplit-delivery VRPSD; here  is the best approximation guarantee for the traveling salesman problem. These bounds match the best known for even the respective deterministic problems [Altinkemer, K...

Optimasi merupakan salah satu kajian dalam terapan Matematika yang bertujuan untuk mengoptimalkan suatu keadaan. Salah masalah dapat diaplikasikan optimasi adalah rute. Masalah nyata diterapkan kehidupan sehari-hari permasalahan rute pengangkutan sampah. Pada sampah digunakan konsep Vehicle Routing Problem (VRP). Konsep menggunakan VRP cukup populer di kalangan mahasiswa, namun sendiri tidak te...

Efficient routing and scheduling of vehicles has significant economic implications for both the public and private sectors. Although other variants of the classical vehicle routing problem (VRP) have received much attention from the genetic algorithms (GAs) community, we find it surprising to identify only one GA in the literature for the fixed destination multidepot vehicle routing problem (MD...

BACKGROUND Overexpression of the mdr-1 gene that codes for a 170 Kd transmembrane glycoprotein (P170) is a factor responsible for decreased cell sensitivity to anthracyclines and other drugs, and is related to treatment failure in acute leukemia and other tumors. Several agents, including verapamil and cyclosporine derivatives, can modify P170-related resistance in vitro and can be proposed as ...

BACKGROUND Adenosine analogs have been shown to produce antinociception after intrathecal administration. To determine the adenosine receptor subtype involved in spinal antinociception, the effects of selective agonists and an antagonist on the evoked potentials recorded from a neonatal rat spinal cord were studied. The measured potentials are a slow ventral root potential (slow VRP), which is ...

Electric vehicle routing problems (E-VRPs) deal with a fleet of electric vehicles (EVs) to serve set customers while minimizing an operational criterion, for example, cost or time. The feasibility the routes is constrained by autonomy EVs, which may be recharged along route. Much E-VRP research neglects capacity charging stations (CSs) and thus implicitly assumes that unlimited number EVs can s...

We study a new variant of the vehicle routing problem, called Mobile Production Vehicle Routing Problem (MoP-VRP). In this vehicles are equipped with 3D printers, and production takes place on way to customer. The objective is minimize weighted cost incurred by travel delay service. formulate Mixed Integer Programming (MIP) model develop an Adaptive Large Neighbourhood Search (ALNS) heuristic f...

In this paper, we study the pattern of S&P 500 index options implied volatility (IV) curves and their predictive ability for variance risk premium (VRP). We explore predictability employing by Zhang Xiang IV factor estimation. show that level term spread significantly predicts VRP, proxied straddle returns swap returns, in both in-sample out-of-sample tests. The is more pronounced rather than r...