Solving a fuel delivery problem by heuristic and exact approaches.
From MaRDI portal
Publication:1410332
DOI10.1016/S0377-2217(02)00676-8zbMath1045.90012OpenAlexW2078219425MaRDI QIDQ1410332
Pasquale Avella, Maurizio Boccia, Aantonio Sforza
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00676-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)
Related Items
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015, An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands, Solving the petroleum replenishment and routing problem with variable demands and time windows, The multi-compartment vehicle routing problem with flexible compartment sizes, An iterated tabu search for the multi-compartment vehicle routing problem, The commodity-split multi-compartment capacitated arc routing problem, Heuristics for the multi-depot petrol station replenishment problem with time windows, Routing problems with loading constraints, Comments on: Routing problems with loading constraints, A transient stochastic simulation-optimization model for operational fuel planning in-theater, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints, Vehicle routing problems with multiple trips, Vehicle routing with compartments: applications, modelling and heuristics, A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem, A heuristic for the multi-period petrol station replenishment problem, A new modeling and solution approach for the set-partitioning problem, Product-oriented time window assignment for a multi-compartment vehicle routing problem, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Vehicle routing problems with multiple trips, Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries, Vehicle selection for a multi-compartment vehicle routing problem, The petrol station replenishment problem with time windows, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, A LP-based heuristic for a time-constrained routing problem, On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm, A guided local search procedure for the multi-compartment capacitated arc routing problem, Vehicle routing problems with loading constraints: state-of-the-art and future directions, A multi-compartment vehicle routing problem in cold-chain distribution, Optimizing routing and delivery patterns with multi-compartment vehicles, Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions, Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes, An inventory-routing problem with the objective of travel time minimization, An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem, A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
Uses Software
Cites Work
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem
- Routing problems: A bibliography
- Probabilistic diversification and intensification in local search for vehicle routing
- The Truck Dispatching Problem
- Vehicle Scheduling in Public Transit and Lagrangean Pricing
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
