Solving the petroleum replenishment and routing problem with variable demands and time windows
type: Item
instance of: scholarly article
title: Solving the petroleum replenishment and routing problem with variable demands and time windows
zbMATH Open document ID: 1455.90023
author: Yan Cheng Hsu
author: Jose L. Walteros
author: Rajan Batta
published in: Annals of Operations Research
publication date: 2021-01-07T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7290915
zbMATH Keywords: gasoline distribution
zbMATH Keywords: vehicle routing with time windows
zbMATH Keywords: vehicle routing
zbMATH Keywords: scheduling
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10479-018-3042-5
OpenAlex ID: W2890000897
cites work: Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
cites work: Industrial aspects and literature survey: Combined inventory management and routing
cites work: Solving a fuel delivery problem by heuristic and exact approaches.
cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
cites work: A Vehicle Routing Problem with Stochastic Demand
cites work: Hybrid metaheuristics for the vehicle routing problem with stochastic demands
cites work: Q4955267
cites work: Scheduling deliveries in vehicles with multiple compartments
cites work: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
cites work: An exact algorithm for the petrol station replenishment problem
cites work: A heuristic for the multi-period petrol station replenishment problem
cites work: Heuristics for the multi-depot petrol station replenishment problem with time windows
cites work: The petrol station replenishment problem with time windows
cites work: The truck dispatching problem
cites work: Vehicle routing with compartments: applications, modelling and heuristics
cites work: A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
cites work: Q5687195
cites work: A tutorial on column generation and branch-and-price for vehicle routing problems
cites work: A note on branch-and-cut-and-price
cites work: A variable neighborhood search heuristic for periodic routing problems
cites work: The multi-compartment vehicle routing problem with flexible compartment sizes
cites work: Vehicle Routing Problem with Time Windows
cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
cites work: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
cites work: Nonlinear multiobjective optimization
cites work: Variable neighborhood search
cites work: Inventory routing problems: a logistical overview
cites work: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
cites work: Petrol delivery tanker assignment and routing: a case study in Hong Kong
cites work: A review of dynamic vehicle routing problems
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: Q3156770
cites work: The discrete time window assignment vehicle routing problem
cites work: Vehicle Routing
Wikidata QID: Q129228446
DOI: 10.1007/S10479-018-3042-5
description: scientific article; zbMATH DE number 7290915