The close-open mixed vehicle routing problem
type: Item
instance of: scholarly article
title: The close-open mixed vehicle routing problem
zbMATH Open document ID: 1253.90050
author: Ran Liu
author: Zhibin Jiang
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6119365
zbMATH Keywords: metaheuristics
zbMATH Keywords: close and open
zbMATH Keywords: vehicle routing
zbMATH Keywords: memetic algorithm
describes a project that uses: VRP
describes a project that uses: CPLEX
describes a project that uses: CVRPSP
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.01.061
OpenAlex ID: W2045716307
cites work: The capacity and distance constrained plant location problem
cites work: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: A heuristic for the routing and carrier selection problem
cites work: A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
cites work: A tabu search algorithm for the open vehicle routing problem
cites work: Context-independent scatter and tabu search for permutation problems
cites work: A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
cites work: A heuristic algorithm for the truckload and less-than-truckload problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A guide to vehicle routing heuristics
cites work: Q5431823
cites work: The multi-depot vehicle routing problem with inter-depot routes
cites work: The truck dispatching problem
cites work: Applying the attribute based hill climber heuristic to the vehicle routing problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Plus court chemin avec contraintes d'horaires
cites work: Creating very large scale neighborhoods out of smaller ones by compounding moves
cites work: A variable neighbourhood search algorithm for the open vehicle routing problem
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q3829367
cites work: The fleet size and mix vehicle routing problem
cites work: Guidelines for the use of meta-heuristics in combinatorial optimization.
cites work: Q4079017
cites work: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
cites work: Sequential search and its application to vehicle-routing problems
cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
cites work: Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Two exact algorithms for the distance-constrained vehicle routing problem
cites work: Optimal Routing under Capacity and Distance Restrictions
cites work: Q4532227
cites work: Projection results for vehicle routing
cites work: On the Distance Constrained Vehicle Routing Problem
cites work: The open vehicle routing problem: algorithms, large-scale test problems, and computational results
cites work: An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Active guided evolution strategies for large-scale vehicle routing problems with time windows
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
cites work: A general heuristic for vehicle routing problems
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: A web-based decision support system for waste lube oils collection and recycling
cites work: A hybrid evolution strategy for the open vehicle routing problem
cites work: Integrating multi-product production and distribution in newspaper logistics
cites work: An ILP improvement procedure for the open vehicle routing problem
cites work: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
cites work: A heuristic method for the open vehicle routing problem
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
DOI: 10.1016/J.EJOR.2012.01.061
Recommended article: The open vehicle routing problem with decoupling points
Recommended article: The fleet size and mix vehicle routing problem

The close-open mixed vehicle routing problem (Recommended article)
Recommended article: A heuristic method for the open vehicle routing problem
Similarity Score: 0.8850585
Recommender Run: Recommender Run 3

The close-open mixed vehicle routing problem (Recommended article)
Recommended article: The open vehicle routing problem with time windows
Similarity Score: 0.8770005
Recommender Run: Recommender Run 3

The close-open mixed vehicle routing problem (Recommended article)
Recommended article: Q3204336
Similarity Score: 0.87662375
Recommender Run: Recommender Run 3

The close-open mixed vehicle routing problem (Recommended article)
Recommended article: The vehicle routing problem
Similarity Score: 0.87662363
Recommender Run: Recommender Run 3

The close-open mixed vehicle routing problem (Recommended article)
Recommended article: A matheuristic for the MinMax capacitated open vehicle routing problem
Similarity Score: 0.8760756
Recommender Run: Recommender Run 3

The close-open mixed vehicle routing problem (Recommended article)
Recommended article: The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem
Similarity Score: 0.8733152
Recommender Run: Recommender Run 3