A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
From MaRDI portal
Publication:975999
DOI10.1016/j.cor.2009.06.015zbMath1188.90035OpenAlexW2129642120WikidataQ58171655 ScholiaQ58171655MaRDI QIDQ975999
Christelle Guéret, Andrés L. Medaglia, Jorge E. Mendoza, Nubia Velasco, Bruno Castanier
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.015
evolutionary algorithmsstochastic demandsmemetic algorithmsmulti-compartment vehicle routing problem
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (38)
Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows ⋮ Solving the petroleum replenishment and routing problem with variable demands and time windows ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands ⋮ A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order ⋮ The multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Satisficing measure approach for vehicle routing problem with time windows under uncertainty ⋮ Coupling a memetic algorithm to simulation models for promising multi-period asset allocations ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry ⋮ A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers ⋮ The Vehicle Routing Problem with Stochastic Demands and Split Deliveries ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ Region based memetic algorithm for real-parameter optimisation ⋮ Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands ⋮ Solving real-world vehicle routing problems in uncertain environments ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Vehicle selection for a multi-compartment vehicle routing problem ⋮ A way to optimally solve a green time-dependent vehicle routing problem with time windows ⋮ The capacitated vehicle routing problem with stochastic demands and time windows ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ A multi-compartment vehicle routing problem in cold-chain distribution ⋮ 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 ⋮ A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ A memetic algorithm for the orienteering problem with hotel selection ⋮ A stochastic inventory routing problem for infectious medical waste collection ⋮ A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem ⋮ A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ New Notation and Classification Scheme for Vehicle Routing Problems
Uses Software
Cites Work
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing
- Solving a fuel delivery problem by heuristic and exact approaches.
- Local branching
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Single vehicle routing with a predefined customer sequence and multiple depot returns
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- Stochastic Vehicle Routing Problem with Restocking
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Fast Algorithms for Geometric Traveling Salesman Problems
- GVR: A New Genetic Representation for the Vehicle Routing Problem
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Improving robustness of solutions to arc routing problems
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
