The close-open mixed vehicle routing problem
From MaRDI portal
Publication:1926744
DOI10.1016/j.ejor.2012.01.061zbMath1253.90050MaRDI QIDQ1926744
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.061
90C11: Mixed integer programming
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Location‐routing problem: a classification of recent research, An open source spreadsheet solver for vehicle routing problems, Scheduling heterogeneous delivery tasks on a mixed logistics platform, Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
Uses Software
Cites Work
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A tabu search algorithm for the open vehicle routing problem
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- The multi-depot vehicle routing problem with inter-depot routes
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- A general heuristic for vehicle routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- The capacity and distance constrained plant location problem
- An ILP improvement procedure for the open vehicle routing problem
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- A hybrid evolution strategy for the open vehicle routing problem
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- The fleet size and mix vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A heuristic algorithm for the truckload and less-than-truckload problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A heuristic for the routing and carrier selection problem
- A web-based decision support system for waste lube oils collection and recycling
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Integrating multi-product production and distribution in newspaper logistics
- Sequential search and its application to vehicle-routing problems
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Projection results for vehicle routing
- The Truck Dispatching Problem
- Context-Independent Scatter and Tabu Search for Permutation Problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A heuristic method for the open vehicle routing problem
- Plus court chemin avec contraintes d'horaires
- Two exact algorithms for the distance-constrained vehicle routing problem
- An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
- Optimal Routing under Capacity and Distance Restrictions
- On the Distance Constrained Vehicle Routing Problem
- Parallel iterative search methods for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A guide to vehicle routing heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
